Jens Groth Rafail Ostrovsky + Department of Computer Science...  Home/Search
Context Related
| iacr.org/2005/290.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/complete/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Non-interactive zero-knowledge (NIZK) 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 zero-knowledge we know how to construct statistical zero-knowledge argument systems for all ... (Update)
Cited by: More
Non-interactive Zaps and New Techniques for NIZK - Jens Groth Rafail (Correct)
Perfect Non-Interactive Zero Knowledge for NP - Jens Groth Rafail (Correct)
Sequential Aggregate Signatures and.. - Lu, Ostrovsky.. (2006) (Correct)
Active bibliography (related documents): More All
0.2: On Simulation-Sound Trapdoor Commitments - MacKenzie, Yang (2003) (Correct)
0.2: Efficient Mutual Data Authentication Using Manually.. - Laur, Asokan, Nyberg (2005) (Correct)
0.1: Foundations of Cryptography - Goldreich (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
Related documents from co-citation: More All
6: Short group signatures - Boneh, Boyen et al. - 2004
6: Evaluating 2-DNF formulas on ciphertexts (context) - Boneh, Goh et al. - 2005
5: Foundations of group signatures: Formal definitions (context) - Bellare, Micciancio et al. - 2003
BibTeX entry: (Update)
Jens Groth, Rafail Ostrovsky, and Amit Sahai. Perfect non-interactive zero knowledge for NP. In Advances in Cryptology---EUROCRYPT 2006, Lecture Notes in Computer Science. Springer-Verlag, 2006. To appear. http://citeseer.ist.psu.edu/article/groth05perfect.html More
@misc{ groth06perfect,
author = "J. Groth and R. Ostrovsky and A. Sahai",
title = "Perfect non-interactive zero knowledge for NP",
text = "Jens Groth, Rafail Ostrovsky, and Amit Sahai. Perfect non-interactive zero
knowledge for NP. In Advances in Cryptology---EUROCRYPT 2006, Lecture Notes
in Computer Science. Springer-Verlag, 2006. To appear.",
year = "2006",
url = "citeseer.ist.psu.edu/article/groth05perfect.html" }
Citations (may not include all citations):326 Non-malleable cryptography - Dolev, Dwork et al. - 2000
196 Minimum disclosure proofs of knowledge (context) - Brassard, Chaum et al. - 1988
189 Universally composable security: A new paradigm for cryptogr.. - Canetti - 2000
84 Noninteractive zero-knowledge - Blum, De Santis et al. - 1991
77 Non-interactive zero-knowledge and its applications (context) - Blum, Feldman et al. - 1988
43 Universally composable two-party and multi-party secure comp.. - Canetti, Lindell et al. - 2002
41 Non-transitive transfer of confidence: A perfect zeroknowled.. - Brassard, Crepeau - 1986
16 Evaluating 2-dnf formulas on ciphertexts (context) - Boneh, Goh et al. - 2005
14 Perfect zero-knowledge languages can be recognized in two ro.. (context) - Aiello, Hastad - 1987
4 Efficient and non-interactive non-malleable commitment - Di Crescenzo, Katz et al. - 2001
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999) (Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997) (Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC