NDLI: On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation

Please wait, while we are loading the content...

On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Bitansky, Nir Paneth, Omer
Copyright Year	2015
Abstract	The introduction of a non-black-box simulation technique by Barak (FOCS 2001) has been a major landmark in cryptography, breaking the previous barriers of black-box impossibility. Barak's technique has given rise to various powerful applications and is a key component in all known protocols with non-black-box simulation. We present the first non-black-box simulation technique that does not rely on Barak's technique (or on nonstandard assumptions). Invoking this technique, we obtain new and improved protocols resilient to various resetting attacks. These improvements include weaker computational assumptions and better round complexity. A prominent feature of our technique is its compatibility with rewinding techniques from classic black-box zero-knowledge protocols. The combination of rewinding with non-black-box simulation has proven instrumental in coping with challenging goals such as simultaneously resettable zero-knowledge, proofs of knowledge, and resettable security from one-way functions. While previous works required tailored modifications to Barak's technique, we give a general recipe for combining our technique with rewinding. This yields simplified resettable protocols in the above settings, as well as improvements in round complexity and required computational assumptions. The main ingredient in our technique is a new impossibility result for general program obfuscation. The results extend the impossibility result of Barak et al. (CRYPTO 2001) to the case of obfuscation with approximate functionality, thus settling a question left open by Barak et al. In the converse direction, we show a generic transformation from any resettably sound zero-knowledge protocol to a family of functions that cannot be obfuscated.
Starting Page	1325
Ending Page	1383
Page Count	59
File Format	PDF
ISSN	00975397
DOI	10.1137/130928236
e-ISSN	10957111
Journal	SIAM Journal on Computing (SMJCAT)
Issue Number	5 (Special Section on the Fifty-Third Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012))
Volume Number	44
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2015-10-27
Access Restriction	Subscribed
Subject Keyword	resettable security non-black-box simulation zero-knowledge obfuscation
Content Type	Text
Resource Type	Article
Subject	Mathematics Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

From the Impossibility of Obfuscation to a New Non-Black-Box Simulation Technique

On the impossibility of approximate obfuscation and applications to resettable cryptography

Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security

Non-black-box simulation from one-way functions and applications to resettable security

ON NON-BLACK-BOX SIMULATION AND THE IMPOSSIBILITY OF APPROXIMATE OBFUSCATION ∗

Non-black-box simulation from one-way functions and applications to resettable security (2013)

Non-black-box simulation from one-way functions and applications to resettable security (2013)

On the impossibility of approximate obfuscation and applications to resettable cryptography. Cryptology eprint archive, report 2012/729 (2012).

Electronic Colloquium on Computational Complexity, Report No. 83 (2004) Lower Bounds for Non-Black-Box Zero Knowledge ∗ (2004)

On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation

Similar Documents

From the Impossibility of Obfuscation to a New Non-Black-Box Simulation Technique

On the impossibility of approximate obfuscation and applications to resettable cryptography

Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security

Non-black-box simulation from one-way functions and applications to resettable security

ON NON-BLACK-BOX SIMULATION AND THE IMPOSSIBILITY OF APPROXIMATE OBFUSCATION ∗

Non-black-box simulation from one-way functions and applications to resettable security (2013)

Non-black-box simulation from one-way functions and applications to resettable security (2013)

On the impossibility of approximate obfuscation and applications to resettable cryptography. Cryptology eprint archive, report 2012/729 (2012).

Electronic Colloquium on Computational Complexity, Report No. 83 (2004) Lower Bounds for Non-Black-Box Zero Knowledge ∗ (2004)

On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation