On the Power of Correlated Randomness in Secure Computation
From MaRDI portal
Publication:4910301
DOI10.1007/978-3-642-36594-2_34zbMath1315.94080OpenAlexW20180677MaRDI QIDQ4910301
Sigurd Meldgaard, Yuval Ishai, Eyal Kushilevitz, Anat Paskin-Cherniavsky, Claudio Orlandi
Publication date: 18 March 2013
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36594-2_34
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (23)
Sublinear GMW-style compiler for MPC with preprocessing ⋮ Two-round MPC: information-theoretic and black-box ⋮ Secure Computation with Minimal Interaction, Revisited ⋮ Secure multiparty computation with sublinear preprocessing ⋮ On the Bottleneck Complexity of MPC with Correlated Randomness ⋮ Secure computation with preprocessing via function secret sharing ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ Programmable distributed point functions ⋮ Sublinear secure computation from new assumptions ⋮ Oblivious transfer with constant computational overhead ⋮ Quadratic multiparty randomized encodings beyond honest majority and their applications ⋮ On perfectly secure two-party computation for symmetric functionalities with correlated randomness ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Communication Optimal Tardos-Based Asymmetric Fingerprinting ⋮ Yet another compiler for active security or: efficient MPC over arbitrary rings ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ On perfectly secure 2PC in the OT-hybrid model ⋮ Breaking the circuit size barrier for secure computation under quasi-polynomial LPN ⋮ Function secret sharing for mixed-mode and fixed-point secure computation ⋮ High-Precision Secure Computation of Satellite Collision Probabilities ⋮ On the Communication Required for Unconditionally Secure Multiplication ⋮ Actively secure setup for SPDZ ⋮ Efficient pseudorandom correlation generators from ring-LPN
This page was built for publication: On the Power of Correlated Randomness in Secure Computation