Cryptographic Applications of the Non-Interactive Metaproof and Many-prover Systems
- 1 January 1991
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 366-377
- https://doi.org/10.1007/3-540-38424-3_27
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Pseudo-random generation from one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- How to play ANY mental gamePublished 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
- How to construct random functionsJournal of the ACM, 1986
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971