Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction

DOI10.1007/978-3-642-38348-9_34zbMath1312.94052OpenAlexW1948221507MaRDI QIDQ4924433

Mike Rosulek, Tal Malkin, Hoeteck Wee, S. Dov Gordon

Publication date: 31 May 2013

Published in: Advances in Cryptology – EUROCRYPT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38348-9_34

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

On the Bottleneck Complexity of MPC with Correlated Randomness ⋮ Is information-theoretic topology-hiding computation possible? ⋮ How to obfuscate MPC inputs ⋮ Topology-hiding computation on all graphs