A Note on the Round-Complexity of Concurrent Zero-Knowledge
- 11 August 2000
- book chapter
- Published by Springer Nature
- p. 451-468
- https://doi.org/10.1007/3-540-44598-6_28
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Efficient Concurrent Zero-Knowledge in the Auxiliary String ModelPublished by Springer Nature ,2000
- On the Concurrent Composition of Zero-Knowledge ProofsPublished by Springer Nature ,1999
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- Concurrent zero-knowledgePublished by Association for Computing Machinery (ACM) ,1998
- On the Composition of Zero-Knowledge Proof SystemsSIAM Journal on Computing, 1996
- How To Construct Constant-Round Zero-Knowledge Proof Systems for NPJournal of Cryptology, 1996
- Definitions and properties of zero-knowledge proof systemsJournal of Cryptology, 1994
- Constant-round perfect zero-knowledge computationally convincing protocolsTheoretical Computer Science, 1991
- Bit commitment using pseudorandomnessJournal of Cryptology, 1991
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989