All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments Under Cryptographic Assumptions
- 1 January 1991
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Making Conditionally Secure Cryptosystems Unconditionally Abuse-Free in a General ContextPublished by Springer Nature ,2001
- An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some GeneralizationsPublished by Springer Nature ,2000
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Special Uses and Abuses of the Fiat-Shamir Passport Protocol (extended abstract)Published by Springer Nature ,1988
- Subliminal-free Authentication and SignaturePublished by Springer Nature ,1988
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Probabilistic encryptionJournal of Computer and System Sciences, 1984