Two-Party Regular Expression Matching Protocol without Asymmetric Cryptography Operations

Authors

  • Gurgen H. Khachatryan American University of Armenia
  • Mihran M. Hovsepyan Russian-Armenian (Slavonic) University
  • Aram H. Jivanyan Onecryptor CJSC

Keywords:

Cryptography, Secure function evaluation, Secure pattern matching, Oblivious transfer

References

P. Mohassel, S. Niksefat, S. Sadeghian and B. Sadeghiyan, “An efficient protocol for oblivious dfa evaluation and applications”, In Proceedings of Cryptographers' Track at the RSA Conference, pp. 398-415, 2012.

G. Khachatryan and A. Jivanyan, “Efficient oblivious transfer protocols based on white-box cryptography’, (submitted for publication). see more in http://cse.aua.am/applied-cryptography-laboratory/.

V. Kolesnikov, A.-R. Sadeghi and T. Schneider, “From Dust to Dawn: Practically Efficient Two-Party Secure Function Evaluation Protocols and their Modular Design”, Cryptology ePrint Archive, Report 2010/079 (2010), https://eprint.iacr.org/2010/079.pdf.

J.R. Troncoso-Pastoriza, S. Katzenbeisser and M. Celik, “Privacy preserving error resilient DNA searching through oblivious automata”, In Proceedings of the 14th ACM conference on Computer and communications security, pp. 519–528, 2007.

K. Frikken, “Practical private DNA string searching and matching through efficient oblivious automata evaluation’, Data and Applications Security XXIII, pp. 81–94, 2009.

R. Gennaro, C. Hazay and J. Sorensen, “Text search protocols with simulation based security”, Public Key Cryptography–PKC 2010, pp. 332–350, 2010.

C. Hazay and T. Toft, “Computationally secure pattern matching in the presence of malicious adversaries”, Advances in Cryptology-ASIACRYPT 2010, pp. 195–212, 2010.

K. Thompson, “Programming Techniques: Regular expression search algorithm”, Communications of the ACM , vol. 11, no. 6, pp. 419–422, 1968.

S. Michael, Introduction to the Theory of Computation, PWS Publishing Company, 1997.

A. C. Yao, “Protocols for secure computations”, In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, Citeseer, pp. 160–164, 1982.

Y. Ishai, J. Kilian, K. Nissim and E. Petrank, “Extending oblivious transfers efficiently”, Advances in Cryptology-CRYPTO 2003, pp. 145–161, 2003.

O. Goldreich, Foundations of cryptography: Basic applications, Cambridge Univ Pr, 2004.

Downloads

Published

2021-12-10

How to Cite

Khachatryan, G. H. ., Hovsepyan, M. M. ., & Jivanyan, A. H. . (2021). Two-Party Regular Expression Matching Protocol without Asymmetric Cryptography Operations. Mathematical Problems of Computer Science, 45, 77–89. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/170