Hiding the input-size in secure two-party computation

DOI10.1007/978-3-642-42045-0_22MaRDI QIDQ2867168zbMATH OpenOpenAlexFDO

Authors Yehuda Lindell, Kobbi Nissim, Claudio Orlandi

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

input-size hidingsecure two-party computation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Size-Hiding Computation for Multiple Parties
• Secure two-party input-size reduction: challenges, solutions and applications
• Size-hiding in private set intersection: existential results and constructions
• Executable proofs, input-size hiding secure computation and a new ideal world
• On the communication complexity of secure function evaluation with long output

Cited in

(12)

• Private set intersection: new generic constructions and feasibility results
• Laconic private set intersection and applications
• Bounded size-hiding private set intersection
• Executable proofs, input-size hiding secure computation and a new ideal world
• Size-Hiding Computation for Multiple Parties
• On the communication complexity of secure function evaluation with long output
• On the bottleneck complexity of MPC with correlated randomness
• Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden
• Hiding the input-size in multi-party private set intersection
• Secure two-party input-size reduction: challenges, solutions and applications
• How to obfuscate MPC inputs
• Maliciously secure massively parallel computation for all-but-one corruptions

This page was built for publication: Hiding the input-size in secure two-party computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867168)