Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/inderscience-publishers/secure-computation-of-functionalities-based-on-hamming-distance-and-HW9Eo0XJT6
References (69)
-
A. Broder (1993)
Some applications of Rabin’s fingerprinting method -
A. Broder (1997)
On the resemblance and containment of documentsProceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171)
-
(2008)
Efficient oblivious polynomial evaluation and transfer with simulation-based security -
Julien Stern (1998)
A new and efficient all-or-nothing disclosure of secrets protocolLecture Notes in Computer Science, 1514
-
(1981)
Fingerprinting by random polynomials Harvard Aiken Computational Laboratory TR-15-81 -
Pascal Paillier (1999)
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes -
I. Blake, V. Kolesnikov (2006)
Conditional Encrypted Mapping and Comparing Encrypted Numbers -
Donald Beaver (1996)
Correlated pseudorandomness and the complexity of private computations -
M. Charikar (2002)
Similarity estimation techniques from rounding algorithms -
Stanislaw Jarecki, Vitaly Shmatikov (2007)
Efficient Two-Party Secure Computation on Committed Inputs -
G. Crescenzo, A. Rubin (2006)
Financial Cryptography and Data Security: 10th International Conference, FC 2006 Anguilla, British West Indies, February 27 - March 2, 2006, Revised Selected Papers -
D. Malkhi, N. Nisan, Benny Pinkas, Yaron Sella (2004)
Fairplay - Secure Two-Party Computation System -
J. Feigenbaum, Y. Ishai, T. Malkin, Kobbi Nissim, M. Strauss, R. Wright (2001)
Secure multiparty computation of approximations -
W. Aiello, Y. Ishai, Omer Reingold (2001)
Priced Oblivious Transfer: How to Sell Digital Goods -
R. Canetti (2000)
Security and Composition of Multiparty Cryptographic ProtocolsJournal of Cryptology, 13
-
A. Stolcke, K. Ries, N. Coccaro, Elizabeth Shriberg, R. Bates, Dan Jurafsky, P. Taylor, Rachel Martin, C. Ess-Dykema, M. Meteer (2000)
Dialogue act modeling for automatic tagging and recognition of conversational speechComputational Linguistics, 26
-
Yehuda Lindell, Benny Pinkas, N. Smart (2008)
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries -
@BULLET If Sim learns the inputs of A, namely, A does not cheat, Sim sends to the trusted party m 0 , m 1 , outputs whatever A outputs and halts -
M. Naor, Benny Pinkas (1999)
Oblivious transfer and polynomial evaluation -
Yael Gertner, Y. Ishai, E. Kushilevitz, T. Malkin (1998)
Protecting data privacy in private information retrieval schemes -
R. Cramer, I. Damgård, Berry Schoenmakers (1994)
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols -
(2000)
Min-wise independent permutations -
R. Agrawal, A. Evfimievski, R. Srikant (2003)
Information sharing across private databases -
B. Huberman, M. Franklin, T. Hogg (1999)
Enhancing privacy and trust in electronic communities -
R. Meier, Bartosz Przydatek (2006)
On Robust Combiners for Private Information Retrieval and Other Primitives -
Seung Choi, A. Kiayias, T. Malkin (2011)
BiTR: Built-in Tamper Resilience -
P. Indyk, David Woodruff (2006)
Polylogarithmic Private Approximations and Efficient MatchingElectron. Colloquium Comput. Complex., TR05
-
A. Broder (2000)
Identifying and Filtering Near-Duplicate Documents -
A. Yao (1986)
How to Generate and Exchange Secrets (Extended Abstract) -
Yehuda Lindell, Benny Pinkas (2007)
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious AdversariesJournal of Cryptology, 28
-
R. Wright, Zhiqiang Yang (2004)
Privacy-preserving Bayesian network structure computation on distributed heterogeneous dataProceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
-
Yan-Cheng Chang (2004)
Single Database Private Information Retrieval with Logarithmic Communication -
P. Bogetoft, I. Damgård, Thomas Jakobsen, K. Nielsen, J. Pagter, Tomas Toft (2006)
A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation -
If Sim does not accept the proofs, it sends ⊥ to the trusted party and halts. Otherwise, Sim proceeds in the execution of the protocol -
Craig Gentry, Zulfikar Ramzan (2005)
Single-Database Private Information Retrieval with Constant Communication Rate -
S. Blackburn, S. Blake-Wilson, M. Burmester (1998)
Shared Generation of Shared Rsa Keys 1 -
J. Camenisch, G. Neven, Abhi Shelat (2007)
Simulatable Adaptive Oblivious Transfer -
(1981)
Fingerprinting by random polynomials, 1981 -
M. Green, S. Hohenberger (2007)
Blind Identity-Based Encryption and Simulatable Oblivious Transfer -
Pascal Paillier (2000)
Trapdooring Discrete Logarithms on Elliptic Curves over Rings -
Otherwise, if Sim accepts the proofs, extracts m 0 , m 1 from the commitments since it knows the private SK of CS encryption scheme -
M. Naor, Kobbi Nissim (2001)
Communication preserving protocols for secure function evaluation -
Sim acts as an honest P R , performs the same steps, where by the end of the step, Sim runs zeroknowledge proof of ZKDLEQ(g -
Julien Stern (1998)
A New Efficient All-Or-Nothing Disclosure of Secrets Protocol -
R. Giancarlo, D. Sankoff (2000)
Combinatorial pattern matching : 11th Annual Symposium, CPM 2000, Montreal, Canada, June 21-23, 2000 : proceedings -
Y. Ishai, J. Kilian, Kobbi Nissim, E. Petrank (2003)
Extending Oblivious Transfers Efficiently -
M. Bellare, S. Micali (1989)
Non-Interactive Oblivious Transfer and Spplications -
S. Even, Oded Goldreich, A. Lempel (1985)
A randomized protocol for signing contractsCommun. ACM, 28
-
Oded Goldreich, S. Micali, A. Wigderson (1987)
How to play ANY mental gameProceedings of the nineteenth annual ACM symposium on Theory of computing
-
E. Kushilevitz, R. Ostrovsky (1997)
Replication is not needed: single database, computationally-private information retrievalProceedings 38th Annual Symposium on Foundations of Computer Science
-
Simulation of COTCD Step 2, as previous steps, Sim acts an honest P R , retrieves both commitments of m 0 , m 1 , which committed by A. Sim plays as the verifier in the zero-knowledge proof of -
I. Damgård, M. Jurik (2001)
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System -
C. Cachin, S. Micali, M. Stadler (1999)
Computationally Private Information Retrieval with Polylogarithmic Communication -
Bart Goethals, S. Laur, H. Lipmaa, Taneli Mielikäinen (2004)
On Private Scalar Product Computation for Privacy-Preserving Data Mining -
Ronald Fagin, M. Naor, P. Winkler (1996)
Comparing information without leaking itCommun. ACM, 39
-
G. Poupard, J. Stern (1998)
Generation of Shared RSA Keys by Two Parties -
A. Broder, S. Glassman, M. Manasse, G. Zweig (1997)
Syntactic Clustering of the WebComput. Networks, 29
-
Assaf Ben-David, N. Nisan, Benny Pinkas (2008)
FairplayMP: a system for secure multi-party computationProceedings of the 15th ACM conference on Computer and communications security
-
H. Lipmaa (2005)
An Oblivious Transfer Protocol with Log-Squared Communication -
M. Ben-Or, S. Goldwasser, A. Wigderson (1988)
Completeness theorems for non-cryptographic fault-tolerant distributed computation -
Barstow Hansen, Gries, Luckham, C. Moler, Pnueli Seegrnuller, J., Stoer Wirth (2000)
Advances in Cryptology -
Oded Goldreich (2001)
The Foundations of Cryptography - Volume 2: Basic Applications -
M. Freedman, Kobbi Nissim, Benny Pinkas (2004)
Efficient Private Matching and Set Intersection -
M. Ben-Or, S. Goldwasser, A. Wigderson (1988)
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) -
M. Naor, Benny Pinkas (2001)
Efficient oblivious transfer protocols -
@BULLET If in any step, A sends ⊥ or fail in verifying in the zero-knowledge proofs, Sim sends ⊥ to the trusted party and halts the execution -
J. Camenisch, V. Shoup (2003)
Practical Verifiable Encryption and Decryption of Discrete LogarithmsIACR Cryptol. ePrint Arch., 2002
-
M. Naor, Benny Pinkas (2004)
Computationally Secure Oblivious TransferJournal of Cryptology, 18
-
Benny Pinkas, T. Schneider, N. Smart, S. Williams (2009)
Secure Two-Party Computation is Practical
- Publisher
- Inderscience Publishers
- Copyright
- Copyright © Inderscience Enterprises Ltd. All rights reserved
- ISSN
- 1753-0563
- eISSN
- 1753-0571
- DOI
- 10.1504/IJACT.2013.053433
- Publisher site
- See Article on Publisher Site
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 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.
Journal
International Journal of Applied Cryptography – Inderscience Publishers
Published: Jan 1, 2013