Better Preprocessing for Secure Multiparty Computation
From MaRDI portal
Publication:2822679
DOI10.1007/978-3-319-39555-5_18zbMath1346.68085OpenAlexW2477068038MaRDI QIDQ2822679
Carsten Baum, Rasmus Zakarias, Tomas Toft, Ivan B. Damgård
Publication date: 4 October 2016
Published in: Applied Cryptography and Network Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-39555-5_18
Related Items
Efficient Secure Multiparty Computation with Identifiable Abort ⋮ More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ MPClan: protocol suite for privacy-conscious computations ⋮ Attaining GOD beyond honest majority with friends and foes ⋮ Towards practical topology-hiding computation ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Secure Multi-party Computation: Information Flow of Outputs and Game Theory ⋮ Better Preprocessing for Secure Multiparty Computation ⋮ How to Prove Knowledge of Small Secrets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Unified Approach to MPC with Preprocessing Using OT
- Better Preprocessing for Secure Multiparty Computation
- Multiparty Computation from Somewhat Homomorphic Encryption
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- A New Approach to Practical Active-Secure Two-Party Computation
- Publicly Auditable Secure Multi-Party Computation
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Semi-homomorphic Encryption and Multiparty Computation
- Polynomial Codes Over Certain Finite Fields
- Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
- Secure Multiparty Computation Goes Live
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
- On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations
- Advances in Cryptology - CRYPTO 2003
