Multiparty Protocols Tolerating Half Faulty Processors
- 6 July 2001
- book chapter
- Published by Springer Nature
- p. 560-572
- https://doi.org/10.1007/0-387-34805-0_49
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Non-cryptographic fault-tolerant computing in constant number of rounds of interactionPublished by Association for Computing Machinery (ACM) ,1989
- Verifiable secret sharing and multiparty protocols with honest majorityPublished by Association for Computing Machinery (ACM) ,1989
- Founding crytpography on oblivious transferPublished by Association for Computing Machinery (ACM) ,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
- How to play ANY mental gamePublished by Association for Computing Machinery (ACM) ,1987
- How to generate and exchange secretsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Verifiable secret sharing and achieving simultaneity in the presence of faultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- How to share a secretCommunications of the ACM, 1979