How to construct constant-round zero-knowledge proof systems for NP
Authors:
Open Access
- 1 June 1996
- journal article
- Published by Springer Nature in Journal of Cryptology
- Vol. 9 (3) , 167-189
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On the Composition of Zero-Knowledge Proof SystemsSIAM Journal on Computing, 1996
- A uniform-complexity treatment of encryption and zero-knowledgeJournal of Cryptology, 1993
- Constant-round perfect zero-knowledge computationally convincing protocolsTheoretical Computer Science, 1991
- A discrete logarithm implementation of perfect zero-knowledge blobsJournal of Cryptology, 1990
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- A hard-core predicate for all one-way functions1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- Non-interactive zero-knowledge and its applications1988
- Coin flipping by telephone a protocol for solving impossible problemsACM SIGACT News, 1983