Abstract
Regular expressions are a frequently used tool to search in large texts. They provide the ability to compare against a structured pattern that can match many text strings and are common to many applications, even programming languages. This paper extends the problem to the private two-party setting where one party has the text string and the other party has the regular expression. The privacy constraint is that neither party should learn about the input of the other party, i.e. the string or the regular expression, except the result of the computation which is wether the string matches the regular expression or not. Secure Multiparty Computation provides general algorithms for any such problem, but it has been recommended to develop special protocols for important cases that provide better performance using the domain knowledge of that problem. This paper presents two protocols: One with perfect secrecy that provides a lower-bound on protocols using circuit construction and a fast one that provides better performance bounds, but the secrecy it provides is limited and tuned for practical applications. The fast protocol presented here uses permutation and commutative encryption as its only building blocks.
Chapter PDF
Similar content being viewed by others
Keywords
- Regular Expression
- Oblivious Transfer
- Deterministic Finite Automaton
- Private Information Retrieval
- Secure Multiparty Computation
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Agrawal, A. Evfimievski, and R. Srikant. Information sharing across private databases. Proceedings of the ACM SIGMOD international conference on Management of data, 2003.
M. Atallah, F. Kerschbaum, and W. Du. Secure and Private Sequence Comparisons. Proceedings of the 2nd Workshop on Privacy in the Electronic Society, 2003.
M. Ben-Or, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. Proceedings of the 20th ACM symposium on Theory of computing, 1988.
D. Betel, and C. Hogue. Kangaroo — A pattern-matching program for biological sequences. Bioinformatics 3(20), 2002.
M. Bykova, M. Atallah, J. Li, K. Frikken, and M. Topkara. Private Collaborative Forecasting and Benchmarking. Proceedings of the 3rd Workshop on Privacy in the Electronic Society, 2004.
C. Cachin, S. Micali, and M. Stadler. Computationally private information retrieval with poly-logarithmic communication. Proceedings of EUROCRYPT, 1999.
R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 2000.
D. Chaum, C. Crepeau, and I. Damgard. Multiparty unconditionally secure protocols. Proceedings of the 20th ACM symposium on Theory of computing, 1988.
B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private Information Retrieval. Proceedings of the 36th Symposium on Foundations of Computer Science, 1995.
J. DeLaurentis. A further weakness in the common modulus protocol for the RSA cryptoalgorithm. Cryptologia 8(3), 1984.
W. Du, and M. Atallah. Privacy-Preserving Cooperative Scientific Computations. Proceedings of the 14th IEEE Computer Security Foundations Workshop, 2001.
B. Eckman, A. Kosky, L. Laroco. Extending traditional query-based integration approaches for functional characterization of post-genomic data. Bioinformatics 17(7), 2001.
K. Frikken, and M. Atallah. Privacy Preserving Electronic Surveillance. Proceedings of the 2nd Workshop on Privacy in the Electronic Society, 2003.
Y. Gertner, Y. Ishai, and E. Kushilevitz. Protecting data privacy in private information retrieval schemes. Proceedings of the 30th ACM Symposium on Theory of Computing, 1998.
S. Goldwasser. Multi party computations: past and present. Proceedings of the 16th ACM symposium on Principles of distributed computing, 1997.
O. Goldreich. Secure Multi-party Computation. Available at http://www. wisdom.weizmann.ac.il/~oded/pp.html, 2002.
O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. Proceedings of the 19th ACM conference on Theory of computing, 1987.
J. Hopcroft, R. Motwani, and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison Wesley, 2000.
F. Kerschbaum. Practical Private Regular Expression Matching. Technical Report, University of Dortmund, available at http://www4.cs.uni-dortmund.de/RVS/FK/, 2005.
E. Kushilevitz, and R. Ostrovsky. Replication is not needed: single database, computationally-private information retrieval. Proceedings of the 38th Symposium on Foundations of Computer Science, 1997.
S. Pohlig, and M. Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Transactions on Information Theory 24, 1978.
R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21(2), 1978.
B. Schneier. Applied Cryptography, 2nd Edition. John Wiley & Sons, 1996.
D. X. Song, D. Wagner, and A. Perrig. Practical Techniques for Searches on Encrypted Data. Proceedings of IEEE Symposium on Security and Privacy, 2000.
J. Vaidya, and C. Clifton. Privacy Preserving Association Rule Mining in Vertically Partitioned Data. Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2002.
L. Wall, T. Christiansen, J. Orwant. Programming Perl, 3rd Edition. O’Reilly, 2000.
A. Yao. Protocols for Secure Computations. Proceedings of the IEEE Symposium on Foundations of Computer Science 23, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Kerschbaum, F. (2006). Practical Private Regular Expression Matching. In: Fischer-Hübner, S., Rannenberg, K., Yngström, L., Lindskog, S. (eds) Security and Privacy in Dynamic Environments. SEC 2006. IFIP International Federation for Information Processing, vol 201. Springer, Boston, MA. https://doi.org/10.1007/0-387-33406-8_43
Download citation
DOI: https://doi.org/10.1007/0-387-33406-8_43
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-33405-9
Online ISBN: 978-0-387-33406-6
eBook Packages: Computer ScienceComputer Science (R0)