Hiding the Input-Size in Secure Two-Party Computation

DOI10.1007/978-3-642-42045-0_22zbMath1326.94110OpenAlexW224789532MaRDI QIDQ2867168

Claudio Orlandi, Yehuda Lindell, Kobbi Nissim

Publication date: 10 December 2013

Published in: Advances in Cryptology - ASIACRYPT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-42045-0_22

zbMATH Keywords

secure two-party computationinput-size hiding

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden ⋮ On the Bottleneck Complexity of MPC with Correlated Randomness ⋮ Private set intersection: new generic constructions and feasibility results ⋮ Hiding the input-size in multi-party private set intersection ⋮ Size-Hiding Computation for Multiple Parties ⋮ Secure two-party input-size reduction: challenges, solutions and applications ⋮ Maliciously secure massively parallel computation for all-but-one corruptions ⋮ Laconic private set intersection and applications ⋮ Bounded Size-Hiding Private Set Intersection

This page was built for publication: Hiding the Input-Size in Secure Two-Party Computation