NDLI: Efficient Noninteractive Proof Systems for Bilinear Groups

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Sahai, Amit Groth, Jens
Copyright Year	2012
Abstract	Noninteractive zero-knowledge proofs and noninteractive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficiency has prevented them from being used in practice. One of the roots of this inefficiency is that noninteractive zero-knowledge proofs have been constructed for general NP-complete languages such as Circuit Satisfiability, causing an expensive blowup in the size of the statement when reducing it to a circuit. The contribution of this paper is a general methodology for constructing very simple and efficient noninteractive zero-knowledge proofs and noninteractive witness-indistinguishable proofs that work directly for a wide class of languages that are relevant in practice (namely, ones involving the satisfiability of equations over bilinear groups), without needing a reduction to Circuit Satisfiability. Groups with bilinear maps have enjoyed tremendous success in the field of cryptography in recent years and have been used to construct a plethora of protocols. This paper provides noninteractive witness-indistinguishable proofs and noninteractive zero-knowledge proofs that can be used in connection with these protocols. Our goal is to spread the use of noninteractive cryptographic proofs from mainly theoretical purposes to the large class of practical cryptographic protocols based on bilinear groups.
Starting Page	1193
Ending Page	1232
Page Count	40
File Format	PDF
ISSN	00975397
DOI	10.1137/080725386
e-ISSN	10957111
Journal	SIAM Journal on Computing (SMJCAT)
Issue Number	5 (Special Section on the Forty-Third Annual ACM Symposium on Theory of Computing (STOC 2011))
Volume Number	41
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2012-10-02
Access Restriction	Subscribed
Subject Keyword	noninteractive witness-indistinguishability noninteractive zero-knowledge common reference string bilinear groups Cryptography
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

New Techniques for Noninteractive Zero-Knowledge

Efficient non-interactive proof systems for bilinear groups (2007)

Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions

Witness indistinguishability and witness hiding against quantum attacks

Interactive and Noninteractive Zero Knowledge Coincide in the Help Model (2007)

Efficient non-interactive proof systems for bilinear groups (2008)

Noninteractive Zero-Knowledge

Universal Arguments and their Applications

Logarithmic size ring signatures without random oracles

Efficient Noninteractive Proof Systems for Bilinear Groups

Similar Documents

New Techniques for Noninteractive Zero-Knowledge

Efficient non-interactive proof systems for bilinear groups (2007)

Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions

Witness indistinguishability and witness hiding against quantum attacks

Interactive and Noninteractive Zero Knowledge Coincide in the Help Model (2007)

Efficient non-interactive proof systems for bilinear groups (2008)

Noninteractive Zero-Knowledge

Universal Arguments and their Applications

Logarithmic size ring signatures without random oracles

Efficient Noninteractive Proof Systems for Bilinear Groups