Secure hamming distance based computation and its applications

Ayman Jarrous; Benny Pinkas

doi:10.1007/978-3-642-01957-9_7

Secure hamming distance based computation and its applications

Ayman Jarrous, Benny Pinkas

University of Haifa

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

40 Scopus citations

Abstract

This paper examines secure two-party computation of functions which depend only on the Hamming distance of the inputs of the two parties. We present efficient protocols for computing these functions. In particular, we present protocols which are secure in the sense of full simulatability against malicious adversaries. We show different applications of this family of functions, including a protocol we call m-point-SPIR, which is an efficient variant of symmetric private information retrieval (SPIR). It can be used if the server's database contains N entries, at most N/logN of which have individual values, and the rest are set to some default value. This variant of PIR is unique since it can be based on the existence of OT alone.

Original language	English
Title of host publication	Applied Cryptography and Network Security - 7th International Conference, ACNS 2009, Proceedings
Pages	107-124
Number of pages	18
DOIs	https://doi.org/10.1007/978-3-642-01957-9_7
State	Published - 2009
Externally published	Yes
Event	7th International Conference on Applied Cryptography and Network Security, ACNS 2009 - Paris-Rocquencourt, France Duration: 2 Jun 2009 → 5 Jun 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5536 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	7th International Conference on Applied Cryptography and Network Security, ACNS 2009
Country/Territory	France
City	Paris-Rocquencourt
Period	2/06/09 → 5/06/09

Funding

Funders	Funder number
Seventh Framework Programme	208173

Access to Document

10.1007/978-3-642-01957-9_7

Cite this

Jarrous, A., & Pinkas, B. (2009). Secure hamming distance based computation and its applications. In Applied Cryptography and Network Security - 7th International Conference, ACNS 2009, Proceedings (pp. 107-124). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5536 LNCS). https://doi.org/10.1007/978-3-642-01957-9_7

@inproceedings{b21f1dcf85a9401895247ee14712003e,

title = "Secure hamming distance based computation and its applications",

abstract = "This paper examines secure two-party computation of functions which depend only on the Hamming distance of the inputs of the two parties. We present efficient protocols for computing these functions. In particular, we present protocols which are secure in the sense of full simulatability against malicious adversaries. We show different applications of this family of functions, including a protocol we call m-point-SPIR, which is an efficient variant of symmetric private information retrieval (SPIR). It can be used if the server's database contains N entries, at most N/logN of which have individual values, and the rest are set to some default value. This variant of PIR is unique since it can be based on the existence of OT alone.",

author = "Ayman Jarrous and Benny Pinkas",

year = "2009",

doi = "10.1007/978-3-642-01957-9_7",

language = "אנגלית",

isbn = "3642019560",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "107--124",

booktitle = "Applied Cryptography and Network Security - 7th International Conference, ACNS 2009, Proceedings",

note = "7th International Conference on Applied Cryptography and Network Security, ACNS 2009 ; Conference date: 02-06-2009 Through 05-06-2009",

}

Jarrous, A & Pinkas, B 2009, Secure hamming distance based computation and its applications. in Applied Cryptography and Network Security - 7th International Conference, ACNS 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5536 LNCS, pp. 107-124, 7th International Conference on Applied Cryptography and Network Security, ACNS 2009, Paris-Rocquencourt, France, 2/06/09. https://doi.org/10.1007/978-3-642-01957-9_7

Secure hamming distance based computation and its applications. / Jarrous, Ayman; Pinkas, Benny.
Applied Cryptography and Network Security - 7th International Conference, ACNS 2009, Proceedings. 2009. p. 107-124 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5536 LNCS).

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

TY - GEN

T1 - Secure hamming distance based computation and its applications

AU - Jarrous, Ayman

AU - Pinkas, Benny

PY - 2009

Y1 - 2009

N2 - This paper examines secure two-party computation of functions which depend only on the Hamming distance of the inputs of the two parties. We present efficient protocols for computing these functions. In particular, we present protocols which are secure in the sense of full simulatability against malicious adversaries. We show different applications of this family of functions, including a protocol we call m-point-SPIR, which is an efficient variant of symmetric private information retrieval (SPIR). It can be used if the server's database contains N entries, at most N/logN of which have individual values, and the rest are set to some default value. This variant of PIR is unique since it can be based on the existence of OT alone.

AB - This paper examines secure two-party computation of functions which depend only on the Hamming distance of the inputs of the two parties. We present efficient protocols for computing these functions. In particular, we present protocols which are secure in the sense of full simulatability against malicious adversaries. We show different applications of this family of functions, including a protocol we call m-point-SPIR, which is an efficient variant of symmetric private information retrieval (SPIR). It can be used if the server's database contains N entries, at most N/logN of which have individual values, and the rest are set to some default value. This variant of PIR is unique since it can be based on the existence of OT alone.

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

U2 - 10.1007/978-3-642-01957-9_7

DO - 10.1007/978-3-642-01957-9_7

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:68849096248

SN - 3642019560

SN - 9783642019562

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 107

EP - 124

BT - Applied Cryptography and Network Security - 7th International Conference, ACNS 2009, Proceedings

T2 - 7th International Conference on Applied Cryptography and Network Security, ACNS 2009

Y2 - 2 June 2009 through 5 June 2009

ER -

Jarrous A, Pinkas B. Secure hamming distance based computation and its applications. In Applied Cryptography and Network Security - 7th International Conference, ACNS 2009, Proceedings. 2009. p. 107-124. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-01957-9_7

Secure hamming distance based computation and its applications

Abstract

Publication series

Conference

Funding

Access to Document

Other files and links

Fingerprint

Cite this