Paper 2012/202

Secure Similarity Coefficients Computation with Malicious Adversaries

Bo Zhang and Fangguo Zhang

Abstract

Similarity coefficients play an important role in many application aspects. Recently, a privacy-preserving similarity coefficients protocol for binary data was proposed by Wong and Kim (Computers and Mathematics with Application 2012). In this paper, we show that their protocol is not secure, even in the semi-honest model, since the client can retrieve the input of the server without deviating from the protocol. Also we propose a secure similarity coefficients computation in the presence of malicious adversaries, and prove it using the standard simulation-based security definitions for secure two-party computation. We also discuss several extensions of our protocol for settling other problems. Technical tools in our protocol include zero-knowledge proofs and distributed ElGamal encryption.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Contact author(s)
isszhfg @ mail sysu edu cn
History
2012-04-13: received
Short URL
https://ia.cr/2012/202
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2012/202,
      author = {Bo Zhang and Fangguo Zhang},
      title = {Secure Similarity Coefficients Computation with Malicious Adversaries},
      howpublished = {Cryptology ePrint Archive, Paper 2012/202},
      year = {2012},
      note = {\url{https://eprint.iacr.org/2012/202}},
      url = {https://eprint.iacr.org/2012/202}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.