An efficient secure comparison protocol

Zhenmin Lin; Jerzy W. Jaromczyk

doi:10.1109/ISI.2012.6283425

An efficient secure comparison protocol

Zhenmin Lin, Jerzy W. Jaromczyk

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

Abstract

We propose a new efficient cryptography-based secure comparison protocol for comparing secrets that are additively split between two parties. Our solution, based on homomorphic cryptosystems, needs 2N + 6 invocations of secure multiplications when the two secrets are numbers in the range [0, 2 ^N); previous solutions required 12N + O(1) secure multiplications. The protocol provides substantial performance improvement in privacy preserving data mining protocols that use comparison as a primitive operation. In particular, we experimentally evaluate the performance of our secure comparison protocol in the implementation of a secure k-means clustering protocol applied to several real datasets.

Original language	English
Title of host publication	ISI 2012 - 2012 IEEE International Conference on Intelligence and Security Informatics
Subtitle of host publication	Cyberspace, Border, and Immigration Securities
Pages	30-35
Number of pages	6
DOIs	https://doi.org/10.1109/ISI.2012.6283425
State	Published - 2012
Event	2012 10th IEEE International Conference on Intelligence and Security Informatics, ISI 2012 - Washington, DC, United States Duration: Jun 11 2012 → Jun 14 2012

Publication series

Name	ISI 2012 - 2012 IEEE International Conference on Intelligence and Security Informatics: Cyberspace, Border, and Immigration Securities

Conference

Conference	2012 10th IEEE International Conference on Intelligence and Security Informatics, ISI 2012
Country/Territory	United States
City	Washington, DC
Period	6/11/12 → 6/14/12

Keywords

k-means
privacy preserving data mining
secure comparison

ASJC Scopus subject areas

Artificial Intelligence
Information Systems

Access to Document

10.1109/ISI.2012.6283425

Cite this

Lin, Z., & Jaromczyk, J. W. (2012). An efficient secure comparison protocol. In ISI 2012 - 2012 IEEE International Conference on Intelligence and Security Informatics: Cyberspace, Border, and Immigration Securities (pp. 30-35). Article 6283425 (ISI 2012 - 2012 IEEE International Conference on Intelligence and Security Informatics: Cyberspace, Border, and Immigration Securities). https://doi.org/10.1109/ISI.2012.6283425

@inproceedings{1d570ae01dee4f499e3fd4f81938c805,

title = "An efficient secure comparison protocol",

abstract = "We propose a new efficient cryptography-based secure comparison protocol for comparing secrets that are additively split between two parties. Our solution, based on homomorphic cryptosystems, needs 2N + 6 invocations of secure multiplications when the two secrets are numbers in the range [0, 2 N); previous solutions required 12N + O(1) secure multiplications. The protocol provides substantial performance improvement in privacy preserving data mining protocols that use comparison as a primitive operation. In particular, we experimentally evaluate the performance of our secure comparison protocol in the implementation of a secure k-means clustering protocol applied to several real datasets.",

keywords = "k-means, privacy preserving data mining, secure comparison",

author = "Zhenmin Lin and Jaromczyk, {Jerzy W.}",

year = "2012",

doi = "10.1109/ISI.2012.6283425",

language = "English",

isbn = "9781467321037",

series = "ISI 2012 - 2012 IEEE International Conference on Intelligence and Security Informatics: Cyberspace, Border, and Immigration Securities",

pages = "30--35",

booktitle = "ISI 2012 - 2012 IEEE International Conference on Intelligence and Security Informatics",

note = "2012 10th IEEE International Conference on Intelligence and Security Informatics, ISI 2012 ; Conference date: 11-06-2012 Through 14-06-2012",

}

Lin, Z & Jaromczyk, JW 2012, An efficient secure comparison protocol. in ISI 2012 - 2012 IEEE International Conference on Intelligence and Security Informatics: Cyberspace, Border, and Immigration Securities., 6283425, ISI 2012 - 2012 IEEE International Conference on Intelligence and Security Informatics: Cyberspace, Border, and Immigration Securities, pp. 30-35, 2012 10th IEEE International Conference on Intelligence and Security Informatics, ISI 2012, Washington, DC, United States, 6/11/12. https://doi.org/10.1109/ISI.2012.6283425

An efficient secure comparison protocol. / Lin, Zhenmin; Jaromczyk, Jerzy W.
ISI 2012 - 2012 IEEE International Conference on Intelligence and Security Informatics: Cyberspace, Border, and Immigration Securities. 2012. p. 30-35 6283425 (ISI 2012 - 2012 IEEE International Conference on Intelligence and Security Informatics: Cyberspace, Border, and Immigration Securities).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An efficient secure comparison protocol

AU - Lin, Zhenmin

AU - Jaromczyk, Jerzy W.

PY - 2012

Y1 - 2012

N2 - We propose a new efficient cryptography-based secure comparison protocol for comparing secrets that are additively split between two parties. Our solution, based on homomorphic cryptosystems, needs 2N + 6 invocations of secure multiplications when the two secrets are numbers in the range [0, 2 N); previous solutions required 12N + O(1) secure multiplications. The protocol provides substantial performance improvement in privacy preserving data mining protocols that use comparison as a primitive operation. In particular, we experimentally evaluate the performance of our secure comparison protocol in the implementation of a secure k-means clustering protocol applied to several real datasets.

AB - We propose a new efficient cryptography-based secure comparison protocol for comparing secrets that are additively split between two parties. Our solution, based on homomorphic cryptosystems, needs 2N + 6 invocations of secure multiplications when the two secrets are numbers in the range [0, 2 N); previous solutions required 12N + O(1) secure multiplications. The protocol provides substantial performance improvement in privacy preserving data mining protocols that use comparison as a primitive operation. In particular, we experimentally evaluate the performance of our secure comparison protocol in the implementation of a secure k-means clustering protocol applied to several real datasets.

KW - k-means

KW - privacy preserving data mining

KW - secure comparison

UR - http://www.scopus.com/inward/record.url?scp=84867362002&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867362002&partnerID=8YFLogxK

U2 - 10.1109/ISI.2012.6283425

DO - 10.1109/ISI.2012.6283425

M3 - Conference contribution

AN - SCOPUS:84867362002

SN - 9781467321037

T3 - ISI 2012 - 2012 IEEE International Conference on Intelligence and Security Informatics: Cyberspace, Border, and Immigration Securities

SP - 30

EP - 35

BT - ISI 2012 - 2012 IEEE International Conference on Intelligence and Security Informatics

T2 - 2012 10th IEEE International Conference on Intelligence and Security Informatics, ISI 2012

Y2 - 11 June 2012 through 14 June 2012

ER -

Lin Z, Jaromczyk JW. An efficient secure comparison protocol. In ISI 2012 - 2012 IEEE International Conference on Intelligence and Security Informatics: Cyberspace, Border, and Immigration Securities. 2012. p. 30-35. 6283425. (ISI 2012 - 2012 IEEE International Conference on Intelligence and Security Informatics: Cyberspace, Border, and Immigration Securities). doi: 10.1109/ISI.2012.6283425

An efficient secure comparison protocol

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this