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

DOI10.1007/978-3-540-79499-8_12MaRDI QIDQ3600327zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• An efficient protocol for secure two-party computation in the presence of malicious adversaries
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Quantum secure two-party Euclidean distance computation based on mutually unbiased bases
• Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
• Two-output secure computation with malicious adversaries
• Advances in Cryptology – CRYPTO 2004
• Secure multiparty computation of approximations

Cites work

• A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
• Composition of secure multi-party protocols. A comprehensive study.
• Efficient proofs that a committed number lies in an interval
• Foundations of Cryptography
• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• scientific article; zbMATH DE number 2085426 (Why is no real title available?)
• scientific article; zbMATH DE number 1088224 (Why is no real title available?)
• scientific article; zbMATH DE number 2009950 (Why is no real title available?)
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Strict polynomial-time in simulation and extraction
• Theory of Cryptography

Cited in

(2)

• Oblivious sampling with applications to two-party k-means clustering
• Secure distributed computation of the square root and applications

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

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