Stochastic secret sharing with 1-bit shares and applications to MPC
From MaRDI portal
Publication:6652972
Recommendations
Cites work
- scientific article; zbMATH DE number 1754644 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Amortized complexity of information-theoretically secure MPC revisited
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- Fundamentals of Error-Correcting Codes
- General secure multi-party computation from any linear secret-sharing scheme
- How to share a secret
- Introduction to Coding Theory
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- OT-Combiners via Secure Computation
- On Robust Combiners for Oblivious Transfer and Other Primitives
- On the communication required for unconditionally secure multiplication
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Perfectly-Secure MPC with Linear Communication Complexity
- Ramp hyper-invertible matrices and their applications to MPC protocols
- Reed–Muller Codes Achieve Capacity on Erasure Channels
- Secure Computation from Random Error Correcting Codes
- Secure multiparty computation and secret sharing
- The price of low communication in secure multi-party computation
- Threshold secret sharing requires a linear-size alphabet
- Topics in Cryptology – CT-RSA 2005
- Unconditional communication-efficient MPC via Hall's marriage theorem
- Zero-knowledge proofs from secure multiparty computation
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)
