On the complexity of compressing obfuscation

DOI10.1007/978-3-319-96878-0_26zbMath1457.94092OpenAlexW2883862991MaRDI QIDQ5896077

Rafael Pass, Ilan Komargodski, Gilad Asharov, Naomi Ephraim

Publication date: 30 June 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-96878-0_26

zbMATH Keywords

compressing obfuscation with perfect correctnessindistinguishability obfuscation

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (1)

Simple and generic constructions of succinct functional encryption

This page was built for publication: On the complexity of compressing obfuscation