Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ
Authors:
- 26 April 2019
- journal article
- research article
- Published by Springer Nature in Journal of Cryptology
- Vol. 32 (3) , 1026-1069
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Efficient Scalable Constant-Round MPC via Garbled Circuits2017
- Optimizing Semi-Honest Secure Multiparty Computation for the Internet2016
- Efficient Three-Party Computation from Cut-and-ChooseLecture Notes in Computer Science, 2014
- Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC ProtocolLecture Notes in Computer Science, 2012
- FairplayMP2008
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator2005
- The round complexity of secure protocols1990
- Multiparty unconditionally secure protocols1988
- Completeness theorems for non-cryptographic fault-tolerant distributed computation1988
- Limits on the security of coin flips when half the processors are faulty1986