Abstract
In this paper, we construct efficient secure protocols for set intersection and pattern matching. Our protocols for secure computing the set intersection functionality are based on secure pseudorandom function evaluations, in contrast to previous protocols that are based on polynomials. In addition to the above, we also use secure pseudorandom function evaluation in order to achieve secure pattern matching. In this case, we utilize specific properties of the Naor–Reingold pseudorandom function in order to achieve high efficiency.
Our results are presented in two adversary models. Our protocol for secure pattern matching and one of our protocols for set intersection achieve security against malicious adversaries under a relaxed definition where one corruption case is simulatable and, for the other, only privacy (formalized through indistinguishability) is guaranteed. We also present a protocol for set intersection that is fully simulatable in the model of covert adversaries. Loosely speaking, this means that a malicious adversary can cheat but will then be caught with good probability.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
W. Aiello, Y. Ishai, O. Reingold, Priced oblivious transfer: how to sell digital goods, in EUROCRYPT ’01. LNCS, vol. 2045 (Springer, Berlin, 2001), pp. 110–135
Y. Aumann, Y. Lindell, Security against covert adversaries: efficient protocols for realistic adversaries, in TCC 2007. LNCS, vol. 4392 (Springer, Berlin, 2007), pp. 137–156
R. Agrawal, R. Srikant, Privacy-preserving data mining, in The 2000 SIGMOD Conference (2000), pp. 439–450
R.S. Boyer, J.S. Moore, A fast string searching algorithm. Commun. Assoc. Comput. Mach. 20, 762–772 (1977)
D. Beaver, Foundations of secure interactive computing, in CRYPTO’91. LNCS, vol. 576 (Springer, Berlin, 1991), pp. 377–391
R. Canetti, Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143–202 (2000)
R. Cleve, Limits on the security of coin flips when half the processors are faulty, in 18th STOC (1986), pp. 364–369
T. El-Gamal, A public-key cryptosystem and a signature scheme based on discrete logarithms, in CRYPTO’84. LNCS, vol. 196 (Springer, Berlin, 1984), pp. 10–18
M.J. Freedman, Y. Ishai, B. Pinkas, O. Reingold, Keyword search and oblivious pseudorandom functions, in TCC 2005. LNCS, vol. 3378 (Springer, Berlin, 2005), pp. 303–324
M.J. Freedman, K. Nissim, B. Pinkas, Efficient private matching and set intersection, in EUROCRYPT 2004. LNCS, vol. 3027 (Springer, Berlin, 2004), pp. 1–19
O. Goldreich, Basic Tools. Foundations of Cryptography, vol. 1 (Cambridge University Press, Cambridge, 2001)
O. Goldreich, Basic Applications. Foundations of Cryptography, vol. 2 (Cambridge University Press, Cambridge, 2004)
O. Goldreich, S. Micali, A. Wigderson, How to play any mental game—a completeness theorem for protocols with honest majority, in 19th STOC (1987), pp 218–229
S. Goldwasser, L. Levin, Fair computation of general functions in presence of immoral majority, in CRYPTO’90. LNCS, vol. 537 (Springer, Berlin, 1990), pp. 77–93
C. Hazay, Y. Lindell, Efficient oblivious polynomial evaluation and transfer with simulation-based security. Manuscript, 2008
J. Katz, Bridging game theory and cryptography: recent results and future directions, in The 5th TCC. LNCS, vol. 4948 (Springer, Berlin, 2008), pp. 251–272
L. Kissner, D.X. Song, Privacy-preserving set operations, in CRYPTO 2005. LNCS, vol. 3621 (Springer, Berlin, 2005), pp. 241–257
D.E. Knuth, J.H. Morris, V.R. Pratt, Fast pattern matching in strings. SIAM J. Comput. 6, 323–350 (1977)
Y. Lindell, Parallel coin-tossing and constant-round secure two-party computation. J. Cryptol. 16(3), 143–184 (2003)
Y. Lindell, B. Pinkas, Privacy preserving data mining. J. Cryptol. 15(3), 177–206 (2002)
S. Micali, P. Rogaway, Secure computation. Unpublished manuscript, 1992. Preliminary version, in CRYPTO’91. LNCS, vol. 576 (1991), pp. 392–404
M. Naor, B. Pinkas, Oblivious transfer and polynomial evaluation, in 31st STOC (1999), pp. 245–254
M. Naor, B. Pinkas, Efficient oblivious transfer protocols, in 12th SODA (2001), pp. 448–457
M. Naor, O. Reingold, Number-theoretic constructions of efficient pseudo-random functions, in 38th FOCS (1997), pp. 231–262
A. Yao, How to generate and exchange secrets, in 27th FOCS (1986), pp. 162–167
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Hugo Krawczyk
An extended abstract of this paper appeared in TCC 2008. The research was supported by an Eshkol scholarship and Infrastructures grant from the Israel Ministry of Science and Technology.
Rights and permissions
About this article
Cite this article
Hazay, C., Lindell, Y. Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. J Cryptol 23, 422–456 (2010). https://doi.org/10.1007/s00145-008-9034-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00145-008-9034-x