STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Comparing information without leaking it
Communications of the ACM
Privacy preserving auctions and mechanism design
Proceedings of the 1st ACM conference on Electronic commerce
Strict polynomial-time in simulation and extraction
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Client/Server Tradeoffs for Online Elections
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Privacy preserving association rule mining in vertically partitioned data
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Composition of Secure Multi-Party Protocols: A Comprehensive Study
Composition of Secure Multi-Party Protocols: A Comprehensive Study
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Privacy-preserving distributed k-means clustering over arbitrarily partitioned data
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient proofs that a committed number lies in an interval
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Fair secure two-party computation
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
On private scalar product computation for privacy-preserving data mining
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
| Hi-index | 0.00 |
Squared Euclidean Distance metric that uses the same equation as the Euclidean distance metric, but does not take the square root (thus clustering with the Squared Euclidean Distance metric is faster than clustering with the regular Euclidean Distance) is an efficient tool for clustering databases. Since there appears to be no previous implementation of secure Squared Euclidean Distance protocols in the malicious model, this paper studies two-party computation of Squared Euclidean Distance protocols in the presence of malicious adversaries based on state-of-the art homomorphic cryptographic primitives without using Yao-style circuit. The security of our protocol is analyzed by comparing what an adversary can do in the a real protocol execution to what it can do in an ideal scenario. We show that the proposed scheme is provably secure against malicious adversary assuming that the underlying homomorphic commitment is statistically hiding and computationally binding and the homomorphic encryption scheme is semantically secure in the common reference string model.