On the communication required for unconditionally secure multiplication
From MaRDI portal
Publication:2829225
DOI10.1007/978-3-662-53008-5_16zbMATH Open1391.94740OpenAlexW2403802810MaRDI QIDQ2829225FDOQ2829225
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
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
- 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
- Title not available (Why is that?)
- On the communication complexity of secure computation
- Randomness complexity of private computation
- Title not available (Why is that?)
- A communication-privacy tradeoff for modular addition
- On the power of correlated randomness in secure computation
- Title not available (Why is that?)
- 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 (14)
- On the Bottleneck Complexity of MPC with Correlated Randomness
- Atomic Secure Multi-party Multiplication with Low Communication
- 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
- Title not available (Why is that?)
- 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)
