A uniform-complexity treatment of encryption and zero-knowledge
- 1 March 1993
- journal article
- Published by Springer Nature in Journal of Cryptology
- Vol. 6 (1), 21-53
- https://doi.org/10.1007/bf02620230
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- On the composition of zero-knowledge proof systemsPublished by Springer Nature ,2005
- Secret Sharing Over Infinite DomainsPublished by Springer Nature ,2001
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial InformationPublished by Springer Nature ,2000
- Constant-round perfect zero-knowledge computationally convincing protocolsTheoretical Computer Science, 1991
- Everything Provable is Provable in Zero-KnowledgeLecture Notes in Computer Science, 1990
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyondPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- Communication Theory of Secrecy Systems*Bell System Technical Journal, 1949