Stochastic secret sharing with 1-bit shares and applications to MPC
From MaRDI portal
Publication:6652972
DOI10.1007/978-3-031-68388-6_11MaRDI QIDQ6652972FDOQ6652972
Authors: Benny Applebaum, Eliran Kachlon 
Publication date: 13 December 2024
Recommendations
Cites Work
- How to share a secret
- Fundamentals of Error-Correcting Codes
- Introduction to Coding Theory
- Secure Computation from Random Error Correcting Codes
- General secure multi-party computation from any linear secret-sharing scheme
- Advances in Cryptology - CRYPTO 2003
- On Robust Combiners for Oblivious Transfer and Other Primitives
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Perfectly-Secure MPC with Linear Communication Complexity
- Title not available (Why is that?)
- OT-Combiners via Secure Computation
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Zero-knowledge proofs from secure multiparty computation
- Topics in Cryptology – CT-RSA 2005
- Amortized complexity of information-theoretically secure MPC revisited
- Secure multiparty computation and secret sharing
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- The price of low communication in secure multi-party computation
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- Reed–Muller Codes Achieve Capacity on Erasure Channels
- Unconditional communication-efficient MPC via Hall's marriage theorem
- On the communication required for unconditionally secure multiplication
- Threshold secret sharing requires a linear-size alphabet
- Ramp hyper-invertible matrices and their applications to MPC protocols
This page was built for publication: Stochastic secret sharing with 1-bit shares and applications to MPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652972)
