Tight bounds on the randomness complexity of secure multiparty computation
DOI10.1007/978-3-031-15985-5_17zbMATH Open1517.94104OpenAlexW4312818261MaRDI QIDQ6166963FDOQ6166963
Authors: Vipul Goyal, Yuval Ishai, Yifan Song 
Publication date: 7 July 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-15985-5_17
Recommendations
Data encryption (aspects in computer science) (68P25) Information theory (general) (94A15) Cryptography (94A60) Distributed systems (68M14) Network protocols (68M12) Boolean functions (94D10)
Cites Work
- Title not available (Why is that?)
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- Robust pseudorandom generators
- Title not available (Why is that?)
- A Theorem on Sensitivity and Applications in Private Computation
- Randomness complexity of private computation
- Private circuits: a modular approach
- Communication and Randomness Lower Bounds for Secure Computation
- Private multiparty sampling and approximation of vector combinations
- A communication-privacy tradeoff for modular addition
- Randomness in Private Computations
- A Randomness-Rounds Tradeoff in Private Computation
- Circuit compilers with \(O(1/\log (n))\) leakage rate
- Randomness versus fault-tolerance
- Side-channel masking with pseudo-random generator
- Amortizing randomness complexity in private circuits
- Private circuits with quasilinear randomness
- Amortizing Randomness in Private Multiparty Computations
- $\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation
- Lower and upper bounds on the randomness complexity of private computations of AND
- Title not available (Why is that?)
Cited In (16)
- Amortizing Randomness in Private Multiparty Computations
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
- $\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation
- Towards characterizing securely computable two-party randomized functions
- On the message complexity of secure multiparty computation
- On the bottleneck complexity of MPC with correlated randomness
- Communication and Randomness Lower Bounds for Secure Computation
- 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
- On the complexity of verifiable secret sharing and multiparty computation
- On perfectly secure two-party computation for symmetric functionalities with correlated randomness
- Lower and upper bounds on the randomness complexity of private computations of AND
- Computational Irrelevancy: Bridging the Gap Between Pseudo- and Real Randomness in MPC Protocols
- A generalization of Bernstein-Vazirani algorithm with multiple secret keys and a probabilistic oracle
- Title not available (Why is that?)
This page was built for publication: Tight bounds on the randomness complexity of secure multiparty computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166963)
