Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
Secure Hamming Distance Based Computation and Its Applications
verfasst von : Ayman Jarrous, Benny Pinkas
Erschienen in: Applied Cryptography and Network Security
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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
/log
N
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.