On the Communication Required for Unconditionally Secure Multiplication
From MaRDI portal
Publication:2829225
DOI10.1007/978-3-662-53008-5_16zbMATH Open1391.94740OpenAlexW2403802810MaRDI QIDQ2829225FDOQ2829225
Antigoni Polychroniadou, Jesper Buus Nielsen, Michael Raskin, Ivan B. Damgård
Publication date: 27 October 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53008-5_16
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- Secure Arithmetic Computation with No Honest Majority
- A minimal model for secure computation (extended abstract)
- Privacy and Communication Complexity
- Scalable and Unconditionally Secure Multiparty Computation
- Communication preserving protocols for secure function evaluation
- Circuits resilient to additive attacks with applications to secure computation
- Perfectly-Secure MPC with Linear Communication Complexity
- Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- On the Communication Complexity of Secure Computation
- Randomness complexity of private computation
- A communication-privacy tradeoff for modular addition
- On the Power of Correlated Randomness in Secure Computation
- Randomness in Private Computations
- Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
- Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
- On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
- Lower bounds on the amount of randomness in private computation
Cited In (12)
- On the Bottleneck Complexity of MPC with Correlated Randomness
- Efficient perfectly secure computation with optimal resilience
- Efficient perfectly secure computation with optimal resilience
- Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND
- Title not available (Why is that?)
- Sharing transformation and dishonest majority MPC with packed secret sharing
- The Security and Performance of “GCM” when Short Multiplications Are Used Instead
- Lower and upper bounds on the randomness complexity of private computations of AND
- Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation
- Oblivious transfer from trapdoor permutations in minimal rounds
- Stochastic secret sharing with 1-bit shares and applications to MPC
- ATLAS: efficient and scalable MPC in the honest majority setting
This page was built for publication: On the Communication Required for Unconditionally Secure Multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829225)
