Please report any queries concerning the funding data grouped in the sections named "Externally Awarded" or "Internally Disbursed" (shown on the profile page) to
your Research Finance Administrator. Your can find your Research Finance Administrator at https://www.ucl.ac.uk/finance/research/rs-contacts.php by entering your department
Please report any queries concerning the student data shown on the profile page to:
Email: portico-services@ucl.ac.uk
Help Desk: http://www.ucl.ac.uk/ras/portico/helpdesk
Email: portico-services@ucl.ac.uk
Help Desk: http://www.ucl.ac.uk/ras/portico/helpdesk
Publication Detail
Perfect Non-interactive Zero Knowledge for NP
-
Publication Type:Conference
-
Authors:Groth J, Ostrovsky R, Sahai A
-
Publisher:Springer
-
Publication date:2006
-
Pagination:339, 358
-
Volume:4004
-
Series:Lecture Notes in Computer Science
-
Editors:Vaudenay S
-
ISBN-13:9783540345466
-
Status:Published
-
Name of conference:Advances in Cryptology - EUROCRYPT: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques
-
Conference place:St. Petersburg, Russia
-
Conference start date:28/05/2006
-
Conference finish date:01/06/2006
-
Keywords:Non-interactive zero-knowledge, universal composability, non-malleability
-
Publisher URL:
-
Full Text URL:
Abstract
Non-interactive zero-knowledge (NIZK) proof systems are
fundamental cryptographic primitives used in many constructions, including
CCA2-secure cryptosystems, digital signatures, and various cryptographic
protocols. What makes them especially attractive, is that they
work equally well in a concurrent setting, which is notoriously hard for
interactive zero-knowledge protocols. However, while for interactive zeroknowledge
we know how to construct statistical zero-knowledge argument
systems for all NP languages, for non-interactive zero-knowledge,
this problem remained open since the inception of NIZK in the late
1980’s. Here we resolve two problems regarding NIZK:
– We construct the first perfect NIZK argument system for any NP
language.
– We construct the first UC-secure NIZK argument for any NP language
in the presence of a dynamic/adaptive adversary.
While it is already known how to construct efficient prover computational
NIZK proofs for any NP language, the known techniques yield
large common reference strings and large proofs. Another contribution
of this paper is NIZK proofs with much shorter common reference string
and proofs than previous constructions.
› More search options
UCL Researchers