Stochastic secret sharing with 1-bit shares and applications to MPC
From MaRDI portal
Publication:6652972
DOI10.1007/978-3-031-68388-6_11MaRDI QIDQ6652972
Benny Applebaum, Eliran Kachlon
Publication date: 13 December 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Amortized complexity of information-theoretically secure MPC revisited
- The price of low communication in secure multi-party computation
- Unconditional communication-efficient MPC via Hall's marriage theorem
- On the Communication Required for Unconditionally Secure Multiplication
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- How to share a secret
- Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Zero-Knowledge Proofs from Secure Multiparty Computation
- Fundamentals of Error-Correcting Codes
- Reed–Muller Codes Achieve Capacity on Erasure Channels
- On Robust Combiners for Oblivious Transfer and Other Primitives
- Advances in Cryptology - CRYPTO 2003
- Secure Computation from Random Error Correcting Codes
- Perfectly-Secure MPC with Linear Communication Complexity
- OT-Combiners via Secure Computation
- Secure Multiparty Computation and Secret Sharing
- Topics in Cryptology – CT-RSA 2005
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Introduction to Coding Theory
- 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
