Robust Non-interactive Zero Knowledge
- 2 August 2001
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 566-598
- https://doi.org/10.1007/3-540-44647-8_33
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Necessary and Sufficient Assumptions for Non-interactive Zero-Knowledge Proofs of Knowledge for All NP RelationsLecture Notes in Computer Science, 2000
- Non-interactive Zero-Knowledge: A Low-Randomness Characterization of NP (Extended Abstract)Lecture Notes in Computer Science, 1999
- An Efficient Noninteractive Zero-Knowledge Proof System for NP with General AssumptionsJournal of Cryptology, 1998
- Randomness-efficient non-interactive zero knowledgeLecture Notes in Computer Science, 1997
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, 1991
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systemsJournal of the ACM, 1991
- Bit commitment using pseudorandomnessJournal of Cryptology, 1991
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- How to construct random functionsJournal of the ACM, 1986