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

Content Provider	IEEE Xplore Digital Library
Author	Bitansky, N. Paneth, O.
Copyright Year	2012
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 techniques were subsequently extended and have given rise to various powerful applications. We present the first non-black-box simulation technique that does not rely on Barak's technique (or on non-standard assumptions). Our technique is based on essentially different tools: {\em it does not invoke universal arguments}, nor does it rely on collision-resistant hashing. Instead, the main ingredient we use is the impossibility of general program obfuscation (Barak et al., CRYPTO 2001). Using our technique, we construct a new resettably-sound zero-knowledge (\rsZK) protocol. \rsZK protocols remain sound even against cheating provers that can repeatedly reset the verifier to its initial state and random tape. Indeed, for such protocols black-box simulation is impossible. Our $\rsZK$ protocol is the first to be based solely on semi-honest oblivious transfer and does not rely on collision-resistant hashing, in addition, our protocol does not use $\PCP$ machinery. In the converse direction, we show a generic transformation from any $\rsZK$ protocol to a family of functions that cannot be obfuscated.
Starting Page	223
Ending Page	232
File Size	225989
Page Count	10
File Format	PDF
ISBN	9781467343831
ISSN	02725428
e-ISBN	9780769548746
DOI	10.1109/FOCS.2012.40
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-10-20
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Protocols Computational modeling Cryptography Machinery Privacy Abstracts resettable-security zero-knowledge non-black-box-simulation
Content Type	Text
Resource Type	Article

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 Libarray 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

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

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

Constant-Round Concurrent Zero Knowledge from P-Certificates

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)

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

Obfuscation-based non-black-box simulation and four message concurrent zero knowledge for np (2013).

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

Similar Documents

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

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

Constant-Round Concurrent Zero Knowledge from P-Certificates

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)

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

Obfuscation-based non-black-box simulation and four message concurrent zero knowledge for np (2013).

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