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




Related Items (23)

Sublinear GMW-style compiler for MPC with preprocessingTwo-round MPC: information-theoretic and black-boxSecure Computation with Minimal Interaction, RevisitedSecure multiparty computation with sublinear preprocessingOn the Bottleneck Complexity of MPC with Correlated RandomnessSecure computation with preprocessing via function secret sharingEncoding Functions with Constant Online Rate, or How to Compress Garbled Circuit KeysProgrammable distributed point functionsSublinear secure computation from new assumptionsOblivious transfer with constant computational overheadQuadratic multiparty randomized encodings beyond honest majority and their applicationsOn perfectly secure two-party computation for symmetric functionalities with correlated randomnessRobust Transforming Combiners from Indistinguishability Obfuscation to Functional EncryptionCommunication Optimal Tardos-Based Asymmetric FingerprintingYet another compiler for active security or: efficient MPC over arbitrary ringsOn perfectly secure 2PC in the OT-hybrid modelOn perfectly secure 2PC in the OT-hybrid modelBreaking the circuit size barrier for secure computation under quasi-polynomial LPNFunction secret sharing for mixed-mode and fixed-point secure computationHigh-Precision Secure Computation of Satellite Collision ProbabilitiesOn the Communication Required for Unconditionally Secure MultiplicationActively secure setup for SPDZEfficient pseudorandom correlation generators from ring-LPN




This page was built for publication: On the Power of Correlated Randomness in Secure Computation