On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
From MaRDI portal
Publication:1688409
DOI10.1007/s00453-017-0276-6zbMath1405.94064OpenAlexW2576585009WikidataQ123227862 ScholiaQ123227862MaRDI QIDQ1688409
Shai Halevi, Craig Gentry, Sanjam Garg, Daniel Wichs
Publication date: 5 January 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-017-0276-6
Related Items
Hidden cosets and applications to unclonable cryptography, Laconic function evaluation for Turing machines, Structure-preserving compilers from new notions of obfuscations
Cites Work
- Unnamed Item
- Unnamed Item
- Advances in cryptology -- ASIACRYPT 2014. 20th international conference on the theory and application of cryptology and information security, Kaoshiung, Taiwan, R.O.C., December 7--11, 2014, Proceedings, Part II
- Theory of cryptography. 11th theory of cryptography conference, TCC 2014, San Diego, CA, USA, February 24--26, 2014. Proceedings
- Limits of Extractability Assumptions with Distributional Auxiliary Input
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- How to Run Turing Machines on Encrypted Data
- The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- How to use indistinguishability obfuscation
- On the existence of extractable one-way functions
- Public-Coin Differing-Inputs Obfuscation and Its Applications
- On the (im)possibility of obfuscating programs
- Protecting Obfuscation against Algebraic Attacks
- Advances in Cryptology - CRYPTO 2003
- Witness encryption and its applications
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- On Extractability Obfuscation
