Alfredo De Santis Giovanni Di Crescenzo Rafail Ostrovsky Giuseppe Persiano...  Home/Search
Context Related
| ucla.edu/~rafail/PUBLIC/55.ps 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: ucla.edu/~rafail/PUBLIC/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attention in the last decade and has been used throughout modern cryptography in several essential ways. For example, NIZK plays a central role in building provably secure public-key cryptosystems based on general complexity-theoretic assumptions that achieve security against chosen ciphertext attacks. In essence, in a... (Update)
Cited by: More
Perfect Non-Interactive Zero Knowledge for NP - Jens Groth Rafail (Correct)
A Stronger Definition for - Anonymous Electronic Cash (2006) (Correct)
Concurrently Non-Malleable Zero Knowledge in the.. - Deng, Di Crescenzo, Lin (2006) (Correct)
Similar documents (at the sentence level):
11.9%: Simulation-Sound Non-Interactive Zero Knowledge - Amit Sahai January (2000) (Correct)
Active bibliography (related documents): More All
3.4: Robust Non-Interactive Zero Knowledge - Alfredo De Santis (Correct)
0.3: Efficient and Non-Interactive Non-Malleable Commitment - Di Crescenzo, Katz.. (2001) (Correct)
0.3: Universally Composable Two-Party and Multi-Party.. - Canetti, Lindell.. (2002) (Correct)
Similar documents based on text: More All
0.8: Zero-Knowledge Arguments and Public-Key Cryptography - De Santis, Di Crescenzo.. (1995) (Correct)
0.8: On Monotone Formula Closure of SZK - de Santis, Di Crescenzo, Persiano.. (1994) (Correct)
0.7: Communication-Efficient Anonymous Group Identification - De Santis, Di Crescenzo.. (1998) (Correct)
Related documents from co-citation: More All
20: Non-malleable cryptography - Dolev, Dwork et al. - 1991
19: Non-malleable non-interactive zero-knowledge and adaptive chosen-ciphertext secu.. - Sahai - 1999
19: Universally composable security: A new paradigm for cryptographic protocols - Canetti - 2001
BibTeX entry: (Update)
A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano and A. Sahai. Robust non-interactive zero knowledge. In CRYPTO http://citeseer.ist.psu.edu/727612.html More
@article{ desantis01robust,
author = "Alfredo De Santis and Giovanni Di Crescenzo and Rafail Ostrovsky and Giuseppe Persiano and Amit Sahai",
title = "Robust Non-interactive Zero Knowledge",
journal = "Lecture Notes in Computer Science",
volume = "2139",
pages = "566--??",
year = "2001",
url = "citeseer.ist.psu.edu/727612.html" }
Citations (may not include all citations):531 The knowledge complexity of interactive proof systems (context) - GOLDWASSER, MICALI et al. - 1989
419 How to construct random functions (context) - GOLDREICH, GOLDWASSER et al. - 1986
326 Non-Malleable Cryptography - DOLEV, DWORK et al. - 2000
254 A practical public key cryptosystem provably secure against .. - CRAMER, SHOUP - 1998
208 Universal One-Way Hash Functions and their Cryptographic App.. - NAOR, YUNG - 1989
196 Minimum Disclosure Proofs of Knowledge (context) - Brassard, Chaum et al.
194 Proofs that Yield Nothing but their Validity or All Language.. (context) - Goldreich, Micali et al. - 1991
177 Public-key cryptosystems provably secure against chosen ciph.. - NAOR, YUNG - 1990
140 How to play any mental game or a completeness theorem for pr.. (context) - GOLDREICH, MICALI et al. - 1987
124 Bit Commitment Using Pseudo-Randomness - NAOR - 1991
114 Non-interactive zero-knowledge proof of knowledge and chosen.. (context) - RACKOFF, SIMON - 1991
95 Multiple non-interactive zero knowledge proofs based on a si.. (context) - FEIGE, LAPIDOT et al. - 1990
94 Concurrent Zero-Knowledge - DWORK, NAOR et al. - 1998
85 Construction of pseudorandom generator from any one-way func.. - ASTAD, IMPAGLIAZZO et al. - 1990
77 Non-interactive zero-knowledge and its applications (context) - BLUM, FELDMAN et al. - 1988
39 Zero-knowledge proofs of knowledge without interaction (context) - DE SANTIS, PERSIANO - 1992
26 Perfect zero-knowledge arguments for NP can be based on gene.. - NAOR, OSTROVSKY et al. - 1998
24 A Hard Predicate for All One-way Functions (context) - Goldreich, Levin - 1989
21 Non-Interactive and Non-Malleable Commitment - DI CRESCENZO, ISHAI et al. - 1998
20 New paradigms for digital signatures and message authenticat.. (context) - BELLARE, GOLDWASSER - 1989
14 WIGDERSON One-Way Functions are Essential for Non-Trivial Ze.. (context) - OSTROVSKY - 1993
6 Non-Interactive ZeroKnowledge Proofs (context) - BLUM, DE SANTIS et al. - 1991
5 PETRANK Concurrent and Resettable Zero-Knowledge in Poly-log.. (context) - KILIAN - 1901
5 Necessary and Sufficient Assumptions for Non-Interactive Zer.. (context) - DE SANTIS, DI CRESCENZO et al. - 2000
5 Non-Interactive Zero-Knowledge: A Low-Randomness Characteriz.. (context) - DE SANTIS, DI CRESCENZO et al. - 1999
4 Hard on Average Problems and Statistical Zeroknowledge Proof.. (context) - One-way - 1991
4 PETRANK An Efficient Non-Interactive Zero-Knowledge Proof Sy.. (context) - KILIAN - 1998
3 ROSEN Black-Box Concurrent ZeroKnowledge Requires (context) - CANETTI, KILIAN et al. - 1901
3 Preliminary version appeared in ACM STOC (context) - Canetti, Goldreich et al. - 2000
3 OSTROVSKY Invariant Signatures and Non-Interactive ZeroKnowl.. (context) - GOLDWASSER - 1992
3 Randomness-efficient NonInteractive Zero-Knowledge - DE SANTIS, DI CRESCENZO et al. - 1997
2 First draft available at http://theory (context) - Goldreich, Computation - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.ucla.edu/~rafail/PUBLIC/index.html): More
Batch Codes and Their Applications - Ishai, Kushilevitz, Ostrovsky, Sahai (2004) (Correct)
Efficient Consistency Proofs for Generalized Queries on.. - Ostrovsky, Rackoff.. (2004) (Correct)
Round-Optimal Secure Two-Party Computation - Katz, Ostrovsky (2004) (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