Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
From MaRDI portal
Publication:2914294
DOI10.1007/978-3-642-32009-5_39zbMath1296.94082MaRDI QIDQ2914294
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32009-5_39
94A60: Cryptography
Related Items
On the Computational Overhead of MPC with Dishonest Majority, Efficient asynchronous verifiable secret sharing and multiparty computation, Better Preprocessing for Secure Multiparty Computation, Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing, Proactive Secret Sharing with a Dishonest Majority, Network Oblivious Transfer, Secure Protocol Transformations, On the Communication Required for Unconditionally Secure Multiplication, Broadcast (and Round) Efficient Verifiable Secret Sharing, Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits