Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries

DOI10.1007/978-3-540-79499-8_12zbMath1166.94340OpenAlexW1598252566MaRDI QIDQ3600327

Marc Mouffron, Frederic Rousseau, Huafei Zhu

Publication date: 10 February 2009

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79499-8_12

zbMATH Keywords

Secure two-party computationSquared Euclidean DistanceStand-alone and simulation-based model

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Composition of secure multi-party protocols. A comprehensive study.
• Strict polynomial-time in simulation and extraction
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Foundations of Cryptography
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries