On the Computational Overhead of MPC with Dishonest Majority
From MaRDI portal
Publication:5738762
DOI10.1007/978-3-662-54388-7_13zbMath1400.94167OpenAlexW2950612815MaRDI QIDQ5738762
Samuel Ranellucci, Jesper Buus Nielsen
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://eprint.iacr.org/2016/643
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- New hash functions and their use in authentication and set equality
- Player simulation and general adversary structures in perfect multiparty computation
- Secure Protocol Transformations
- Efficient Multiparty Protocols via Log-Depth Threshold Formulae
- Multiparty Computation from Somewhat Homomorphic Encryption
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- Reducing the Overhead of MPC over a Large Population
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
- Authenticated Algorithms for Byzantine Agreement
- Expander codes
- Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Founding Cryptography on Oblivious Transfer – Efficiently
- An O (log n ) expected rounds randomized byzantine generals protocol
- Universally Composable Synchronous Computation
- Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
This page was built for publication: On the Computational Overhead of MPC with Dishonest Majority
