Secure computation of functionalities based on Hamming distance and its application to computing document similarity (Q381129)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Secure computation of functionalities based on Hamming distance and its application to computing document similarity |
scientific article |
Statements
Secure computation of functionalities based on Hamming distance and its application to computing document similarity (English)
0 references
15 November 2013
0 references
Summary: 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 then show applications of HDOT. These include protocols for checking similarity between documents without disclosing additional information about them (these protocols are based on algorithms of Broder et al. for computing document similarity based on the Jaccard measure). Another application is a variant of symmetric private information retrieval (SPIR), which 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. The receiver does not learn whether it receives an individual value or the default value. This variant of PIR is unique since it can be based on the existence of OT alone.
0 references
secure two-party computation
0 references
document similarity
0 references
Hamming distance
0 references
HDOT
0 references
symmetric private information retrieval
0 references
SPIR
0 references
protocol security
0 references
oblivious transfer protocols
0 references