On the Communication Required for Unconditionally Secure Multiplication

DOI10.1007/978-3-662-53008-5_16zbMath1391.94740OpenAlexW2403802810MaRDI QIDQ2829225

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

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Related Items (11)

ATLAS: efficient and scalable MPC in the honest majority setting ⋮ On the Bottleneck Complexity of MPC with Correlated Randomness ⋮ 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 ⋮ Sharing transformation and dishonest majority MPC with packed secret sharing ⋮ Unnamed Item ⋮ Oblivious transfer from trapdoor permutations in minimal rounds ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Stochastic secret sharing with 1-bit shares and applications to MPC ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A communication-privacy tradeoff for modular addition
• Randomness complexity of private computation
• A minimal model for secure computation (extended abstract)
• On the Communication Complexity of Secure 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
• Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Lower bounds on the amount of randomness in private computation
• On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• Secure Arithmetic Computation with No Honest Majority
• Scalable and Unconditionally Secure Multiparty Computation
• Privacy and Communication Complexity
• Randomness in Private Computations
• On the Power of Correlated Randomness in Secure 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

This page was built for publication: On the Communication Required for Unconditionally Secure Multiplication