Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
- 1 January 2002
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 32 (1), 1-47
- https://doi.org/10.1137/s0097539701392949
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Foundations of CryptographyPublished by Cambridge University Press (CUP) ,2001
- 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
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systemsJournal of the ACM, 1991
- On the power of two-point based samplingJournal of Complexity, 1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- New hash functions and their use in authentication and set equalityJournal of Computer and System Sciences, 1981