On the (in)efficiency of non-interactive secure multiparty computation
Open Access
- 26 March 2018
- journal article
- research article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 86 (8) , 1793-1805
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Robust Non-interactive Multiparty Computation Against Constant-Size Collusion2017
- Non-Interactive Secure Multiparty Computation2014
- On the Communication Complexity of Secure Computation2014
- Efficient General-Adversary Multi-Party Computation2013
- On d-Multiplicative Secret SharingJournal of Cryptology, 2010
- Secure Multi-party Computation Made Simple2003
- Player Simulation and General Adversary Structures in Perfect Multiparty ComputationJournal of Cryptology, 2000
- Verifiable secret sharing and multiparty protocols with honest majority1989
- Completeness theorems for non-cryptographic fault-tolerant distributed computation1988
- Protocols for secure computations1982