Pattern matching algorithms for encrypted non-static texts Online publication date: Sun, 19-Mar-2017
by Nan Li; Dequan Chen; Meng Zhang
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 12, No. 1, 2017
Abstract: We consider the problem of pattern matching on encrypted texts. In this problem, users transfer the encrypted text and patterns to a third party, and the third party searches for all the occurrences of the patterns in the encrypted text; the matching results are encrypted such that only some specified users can read. The third party cannot access all the plain texts including the pattern, the text, and the matching result. In our problem, the texts and patterns are not static, and the pre-processing on the text is the encryption, not including building the index and others; any pre-processing on the patterns is allowed. We present pattern matching algorithms for ciphertexts of the fully homomorphic encryption. The time for decrypting the matching results is shorter than that of decrypting-then-matching of the ciphertext. We implement the pattern matching algorithms using HElib library. Several experiments are conducted to test the performance of the algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook