Secure hamming distance based computation and its applications

Ayman Jarrous, Benny Pinkas

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

39 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 languageEnglish
Title of host publicationApplied Cryptography and Network Security - 7th International Conference, ACNS 2009, Proceedings
Pages107-124
Number of pages18
DOIs
StatePublished - 2009
Externally publishedYes
Event7th International Conference on Applied Cryptography and Network Security, ACNS 2009 - Paris-Rocquencourt, France
Duration: 2 Jun 20095 Jun 2009

Publication series

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

Conference

Conference7th International Conference on Applied Cryptography and Network Security, ACNS 2009
Country/TerritoryFrance
CityParis-Rocquencourt
Period2/06/095/06/09

Fingerprint

Dive into the research topics of 'Secure hamming distance based computation and its applications'. Together they form a unique fingerprint.

Cite this