Everything Provable is Provable in Zero-Knowledge
- 1 January 1990
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- The Notion of Security for Probabilistic CryptosystemsSIAM Journal on Computing, 1988
- Interactive proof systems: Provers that never fail and random selectionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- On the cunning power of cheating verifiers: Some observations about zero knowledge proofsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Recognizing primes in random polynomial timePublished by Association for Computing Machinery (ACM) ,1987
- The complexity of perfect zero-knowledgePublished 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
- Almost all primes can be quickly certifiedPublished by Association for Computing Machinery (ACM) ,1986
- Trading group theory for randomnessPublished by Association for Computing Machinery (ACM) ,1985
- One-way functions and pseudorandom generatorsPublished by Association for Computing Machinery (ACM) ,1985
- Probabilistic encryptionJournal of Computer and System Sciences, 1984