Trading correctness for privacy in unconditional multi-party computation
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 121-136
- https://doi.org/10.1007/bfb0055724
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Incoercible multiparty computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Private information retrievalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The design and implementation of a secure auction serviceIEEE Transactions on Software Engineering, 1996
- Adaptively secure multi-party computationPublished by Association for Computing Machinery (ACM) ,1996
- Robust and Efficient Sharing of RSA FunctionsPublished by Springer Nature ,1996
- Multi-Authority Secret-Ballot Elections with Linear WorkPublished by Springer Nature ,1996
- Perfectly secure message transmissionJournal of the ACM, 1993
- Strong verifiable secret sharing extended abstractPublished by Springer Nature ,1991
- Optimal algorithms for Byzantine agreementPublished by Association for Computing Machinery (ACM) ,1988
- Completeness theorems for non-cryptographic fault-tolerant distributed computationPublished by Association for Computing Machinery (ACM) ,1988