Parallel Reducibility for Information-Theoretically Secure Computation
- 11 August 2000
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Foundations of Secure Interactive ComputingPublished by Springer Nature ,2001
- General Secure Multi-party Computation from any Linear Secret-Sharing SchemePublished by Springer Nature ,2000
- Security and Composition of Multiparty Cryptographic ProtocolsJournal of Cryptology, 2000
- An Optimal Probabilistic Protocol for Synchronous Byzantine AgreementSIAM Journal on Computing, 1997
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minorityJournal of Cryptology, 1991
- Verifiable secret sharing and multiparty protocols with honest majorityPublished by Association for Computing Machinery (ACM) ,1989
- Multiparty computation with faulty majorityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Multiparty unconditionally secure protocolsPublished by Association for Computing Machinery (ACM) ,1988
- How to play ANY mental gamePublished by Association for Computing Machinery (ACM) ,1987
- Protocols for secure computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982