Tight bounds on the randomness complexity of secure multiparty computation

DOI10.1007/978-3-031-15985-5_17MaRDI QIDQ6166963zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

privacysmall probability spacesxor functionrandomness complexity of protocols

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Information theory (general) (94A15) Cryptography (94A60) Distributed systems (68M14) Network protocols (68M12) Boolean functions (94D10)

Recommendations

• On the communication complexity of secure computation
• Randomness versus fault-tolerance
• Amortizing Randomness in Private Multiparty Computations
• Lower and upper bounds on the randomness complexity of private computations of AND
• Randomness in Private Computations

Cites work

• scientific article; zbMATH DE number 4039795 (Why is no real title available?)
• scientific article; zbMATH DE number 3614066 (Why is no real title available?)
• scientific article; zbMATH DE number 1256773 (Why is no real title available?)
• scientific article; zbMATH DE number 1962807 (Why is no real title available?)
• $\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation
• A Randomness-Rounds Tradeoff in Private Computation
• A Theorem on Sensitivity and Applications in Private Computation
• A communication-privacy tradeoff for modular addition
• Advances in Cryptology - CRYPTO 2003
• Amortizing Randomness in Private Multiparty Computations
• Amortizing randomness complexity in private circuits
• Circuit compilers with \(O(1/\log (n))\) leakage rate
• Communication and Randomness Lower Bounds for Secure Computation
• Lower and upper bounds on the randomness complexity of private computations of AND
• Private circuits with quasilinear randomness
• Private circuits: a modular approach
• Private multiparty sampling and approximation of vector combinations
• Randomness complexity of private computation
• Randomness in Private Computations
• Randomness versus fault-tolerance
• Robust pseudorandom generators
• Side-channel masking with pseudo-random generator
• The dining cryptographers problem: Unconditional sender and recipient untraceability

Cited in

(16)

• $\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation
• On the message complexity of secure multiparty computation
• Communication and Randomness Lower Bounds for Secure Computation
• Computational Irrelevancy: Bridging the Gap Between Pseudo- and Real Randomness in MPC Protocols
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• On the power of correlated randomness in secure computation
• A generalization of Bernstein-Vazirani algorithm with multiple secret keys and a probabilistic oracle
• On perfectly secure two-party computation for symmetric functionalities with correlated randomness
• Towards characterizing securely computable two-party randomized functions
• Lower and upper bounds on the randomness complexity of private computations of AND
• On the bottleneck complexity of MPC with correlated randomness
• Amortizing Randomness in Private Multiparty Computations
• scientific article; zbMATH DE number 1754645 (Why is no real title available?)
• ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
• On the communication complexity of secure computation
• On the complexity of verifiable secret sharing and multiparty computation

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)