On the communication required for unconditionally secure multiplication

DOI10.1007/978-3-662-53008-5_16MaRDI QIDQ2829225zbMATH OpenOpenAlexFDO

Authors Jesper Buus Nielsen, Antigoni Polychroniadou, Ivan B. Damgård, Michael Raskin

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)

Recommendations

• Communication lower bounds for statistically secure MPC, with or without preprocessing
• scientific article; zbMATH DE number 7706034
• On the communication complexity of secure computation
• Near-linear unconditionally-secure multiparty computation with a dishonest minority
• Atomic Secure Multi-party Multiplication with Low Communication

Cites work

• scientific article; zbMATH DE number 503242 (Why is no real title available?)
• scientific article; zbMATH DE number 1942426 (Why is no real title available?)
• scientific article; zbMATH DE number 1406796 (Why is no real title available?)
• A communication-privacy tradeoff for modular addition
• A minimal model for secure computation (extended abstract)
• A new approach to practical active-secure two-party computation
• Circuits resilient to additive attacks with applications to secure computation
• Communication preserving protocols for secure function evaluation
• Efficient multi-party computation: from passive to active security via secure SIMD circuits
• Lower bounds on the amount of randomness in private computation
• Multiparty Computation from Somewhat Homomorphic Encryption
• Near-linear unconditionally-secure multiparty computation with a dishonest minority
• On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
• On the communication complexity of secure computation
• On the power of correlated randomness in secure computation
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Perfectly-Secure MPC with Linear Communication Complexity
• Privacy and Communication Complexity
• Randomness complexity of private computation
• Randomness in Private Computations
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• Scalable and Unconditionally Secure Multiparty Computation
• Secure Arithmetic Computation with No Honest Majority
• Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems

Cited in

(16)

• Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation
• Atomic Secure Multi-party Multiplication with Low Communication
• Efficient perfectly secure computation with optimal resilience
• Efficient perfectly secure computation with optimal resilience
• Sharing transformation and dishonest majority MPC with packed secret sharing
• Communication lower bounds for statistically secure MPC, with or without preprocessing
• The Security and Performance of “GCM” when Short Multiplications Are Used Instead
• On the bottleneck complexity of MPC with correlated randomness
• Lower and upper bounds on the randomness complexity of private computations of AND
• The bottleneck complexity of secure multiparty computation
• Lower and upper bounds on the randomness complexity of private computations of AND
• scientific article; zbMATH DE number 7706034 (Why is no real title available?)
• 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)