How to Utilize the Randomness of Zero-Knowledge Proofs
- 18 May 2001
- book chapter
- Published by Springer Nature
- p. 456-475
- https://doi.org/10.1007/3-540-38424-3_33
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Witness indistinguishable and witness hiding protocolsPublished by Association for Computing Machinery (ACM) ,1990
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- A hard-core predicate for all one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- 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 applicationsPublished by Association for Computing Machinery (ACM) ,1988
- Subliminal-free Authentication and SignaturePublished by Springer Nature ,1988
- Zero knowledge proofs of identityPublished by Association for Computing Machinery (ACM) ,1987
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- New directions in cryptographyIEEE Transactions on Information Theory, 1976