Round-Optimal Zero-Knowledge Arguments Based on Any One-Way Function
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 280-305
- https://doi.org/10.1007/3-540-69053-0_20
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Multiple non-interactive zero knowledge proofs based on a single random stringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor PermutationJournal of Cryptology, 1996
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, 1991
- Constant-round perfect zero-knowledge computationally convincing protocolsTheoretical Computer Science, 1991
- The (true) complexity of statistical zero knowledgePublished by Association for Computing Machinery (ACM) ,1990
- Witness indistinguishable and witness hiding protocolsPublished by Association for Computing Machinery (ACM) ,1990
- Perfect zero-knowledge in constant roundsPublished by Association for Computing Machinery (ACM) ,1990
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Zero-knowledge proofs of identityJournal of Cryptology, 1988
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984