High-Throughput Secure Three-Party Computation with an Honest Majority
- 22 May 2023
- journal article
- research article
- Published by Springer Nature in Journal of Cryptology
- Vol. 36 (3) , 1-68
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- GMW vs. Yao? Efficient Secure Two-Party Computation with Low Depth Circuits2013
- High-performance secure multi-party computation for data mining applicationsInternational Journal of Information Security, 2012
- Efficient Secure Computation with Garbled Circuits2011
- Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer2011
- Information-Theoretically Secure Protocols and Security under CompositionSIAM Journal on Computing, 2010
- Sharemind: A Framework for Fast Privacy-Preserving Computations2008
- Secure Multi-Party Computation without AgreementJournal of Cryptology, 2005
- Efficient Multiparty Protocols Using Circuit Randomization2001
- Security and Composition of Multiparty Cryptographic ProtocolsJournal of Cryptology, 2000
- How to play ANY mental game1987