Secure Hamming Distance Based Computation and Its Applications

  • Ayman Jarrous
  • Benny Pinkas
Conference paper

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

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5536)
Cite this paper as:
Jarrous A., Pinkas B. (2009) Secure Hamming Distance Based Computation and Its Applications. In: Abdalla M., Pointcheval D., Fouque PA., Vergnaud D. (eds) Applied Cryptography and Network Security. ACNS 2009. Lecture Notes in Computer Science, vol 5536. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Ayman Jarrous
    • 1
  • Benny Pinkas
    • 1
  1. 1.University of Haifa 

Personalised recommendations