Cryptographic Protocols Provably Secure Against Dynamic Adversaries
- 18 May 2001
- book chapter
- Published by Springer Nature
- p. 307-323
- https://doi.org/10.1007/3-540-47555-9_26
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minorityJournal of Cryptology, 1991
- The round complexity of secure protocolsPublished by Association for Computing Machinery (ACM) ,1990
- Minimum-Knowledge Interactive Proofs for Decision ProblemsSIAM Journal on Computing, 1989
- Multiparty computation with faulty majorityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Zero-knowledge proofs of identityJournal of Cryptology, 1988
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- Multiparty unconditionally secure protocolsPublished by Association for Computing Machinery (ACM) ,1988
- Completeness theorems for non-cryptographic fault-tolerant distributed computationPublished by Association for Computing Machinery (ACM) ,1988
- Achieving independence in logarithmic number of roundsPublished by Association for Computing Machinery (ACM) ,1987