Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung  Home/Search
Context Related
| ucla.edu/~rafail/PUBLIC/10.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: Zero-knowledge arguments" is a fundamental cryptographic primitive which allows one polynomial-time player to convince another polynomial-time player of the validity of an NP statement, without revealing any additional information in the information-theoretic sense. (Update)
Similar documents based on text: More All
1.0: Perfect Zero-Knowledge Arguments for NP Can Be Based .. - Naor, Ostrovsky.. (1992) (Correct)
0.8: Perfect Zero-Knowledge Arguments for NP Using any.. - Naor, Ostrovsky.. (1996) (Correct)
0.6: Secure Commitment Against A Powerful Adversary - A.. - Ostrovsky, Venkatesan, .. (1992) (Correct)
BibTeX entry: (Update)
Naor, Moni, R. Ostrovsky, R. Venkatesan and M. Yung, "Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions", Advances in Cryptology --- Proceedings of Crypto '92, August 1992, Springer -- Verlag, pp. 196 -- 214. http://citeseer.ist.psu.edu/moni92perfect.html More
@inproceedings{ naor92perfect,
author = "Moni Naor and Rafail Ostrovsky and Ramarathnam Venkatesan and Moti Yung",
title = "Perfect Zero-Knowledge Arguments for {NP} Can Be Based on General Complexity Assumptions (Extended Abstract)",
booktitle = "{CRYPTO}",
pages = "196-214",
year = "1992",
url = "citeseer.ist.psu.edu/moni92perfect.html" }
Citations (may not include all citations):531 The Knowledge Complexity of Interactive Proof-Systems (context) - Goldwasser, Micali et al.
339 Theory and Applications of Trapdoor functions (context) - Yao - 1982
334 How to Generate Cryptographically Strong Sequences Of Pseudo.. (context) - Blum - 1984
208 Universal One-Way Hash Functions and their Cryptographic App.. - Naor, Yung
206 Zero-Knowledge Proofs of Identity (context) - Feige, Fiat et al.
196 Minimum Disclosure Proofs of Knowledge (context) - Brassard, Chaum et al.
167 Pseudo-random generation from oneway functions (context) - Impagliazzo, Levin et al. - 1989
124 Bit Commitment Using Pseudo-Randomness - Naor
99 One-way Functions are Necessary and Sufficient for Secure Si.. (context) - Rompel
84 Non-Interactive ZeroKnowledge - Blum, DeSantis et al.
79 One-way Functions are Essential for Complexity-Based Cryptog.. (context) - Impagliazzo, Luby
58 On Defining Proof of Knowledge - Bellare
56 Proofs that Yields Nothing But their Validity (context) - Goldreich, Micali et al.
55 Pseudo-Random Generators under Uniform Assumptions (context) - Hastad
46 Efficient Cryptographic Schemes Provably as Secure as Subset.. - Impagliazzo, Naor
[Article contains additional citations not shown here]
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