Symmetric Searchable Encryption for Exact Pattern Matching using Directed Acyclic Word Graphs

Rolf Haynberg, Jochen Rill, Dirk Achenbach, Jörn Müller-Quade

Abstract

Searchable Encryption schemes allow searching within encrypted data without prior decryption. Various index-based schemes have been proposed in the past, which are only adequate for certain use cases. There is a lack of schemes with exact pattern matching capabilities. We introduce Symmetric Searchable Encryption for Exact Pattern Matching, a new class of searchable encryption schemes. To this end, we define the XPM-SSE primitive and two privacy notions for the new primitive. Our own construction, SEDAWG, is a XPM-SSE scheme which uses Directed Acyclic Word Graphs. We discuss and prove its properties.

References

  1. Abdalla, M., Bellare, M., Catalano, D., Kiltz, E., Kohno, T., Lange, T., Malone-Lee, J., Neven, G., Paillier, P., and Shi, H. (2008). Searchable encryption revisited: Consistency properties, relation to anonymous ibe, and extensions. Journal of Cryptology, 21:350-391.
  2. Baeza-Yates, R. and Gonnet, G. H. (1992). A new approach to text searching. Commun. ACM, 35(10):74-82.
  3. Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M. T., and Seiferas, J. (1985). The smallest automaton recognizing the subwords of a text. Theoretical Computer Science, 40:31 - 55. Eleventh International Colloquium on Automata, Languages and Programming.
  4. Blumer, A., Blumer, J., Haussler, D., McConnell, R., and Ehrenfeucht, A. (1987). Complete inverted files for efficient text retrieval and analysis. J. ACM, 34(3):578- 595.
  5. Boyer, R. S. and Moore, J. S. (1977). A fast string searching algorithm. Commun. ACM, 20(10):762-772.
  6. Chang, Y.-C. and Mitzenmacher, M. (2005). Privacy preserving keyword searches on remote encrypted data. In Ioannidis, J., Keromytis, A., and Yung, M., editors, Applied Cryptography and Network Security, volume 3531 of Lecture Notes in Computer Science, pages 442-455. Springer Berlin / Heidelberg.
  7. Chor, B., Kushilevitz, E., Goldreich, O., and Sudan, M. (1998). Private information retrieval. J. ACM, 45(6):965-981.
  8. Crochemore, M. and Vérin, R. (1997). On compact directed acyclic word graphs. In Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht, pages 192-211, London, UK. Springer-Verlag.
  9. Curtmola, R., Garay, J., Kamara, S., and Ostrovsky, R. (2006). Searchable symmetric encryption: Improved definitions and efficient constructions. In CCS 7806: Proceedings of the 13th ACM conference on Computer and communications security, pages 79-88, New York, NY, USA. ACM.
  10. Di Crescenzo, G., Malkin, T., and Ostrovsky, R. (2000). Single database private information retrieval implies oblivious transfer. In Preneel, B., editor, Advances in Cryptology EUROCRYPT 2000, volume 1807 of Lecture Notes in Computer Science, pages 122-138. Springer Berlin / Heidelberg.
  11. Goh, E.-J. (2003). Secure indexes. http://eprint.iacr.org/2003/216/.
  12. Goldreich, O. and Ostrovsky, R. (1996). Software protection and simulation on oblivious rams. J. ACM, 43(3):431-473.
  13. Golle, P., Staddon, J., and Waters, B. (2004). Secure conjunctive keyword search over encrypted data.
  14. Karp, R. M. and Rabin, M. O. (1987). Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development, 31(2):249 -260.
  15. Kenan, K. (2005). Cryptography in the Database : The Last Line of Defense. Addison-Wesley, Upper Saddle River, NJ.
  16. Knuth, D. E., James H. Morris, J., and Pratt, V. R. (1977). Fast pattern matching in strings. SIAM Journal on Computing, 6(2):323-350.
  17. Kushilevitz, E. and Ostrovsky, R. (1997). Replication is not needed: Single database, computationally-private information retrieval. In FOCS 7897: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, page 364, Washington, DC, USA. IEEE Computer Society.
  18. Manber, U. and Myers, G. (1990). Suffix arrays: A new method for on-line string searches. In SODA 7890: Proceedings of the first annual ACM-SIAM symposium on discrete algorithms, pages 319-327, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics.
  19. Song, D. X., Wagner, D., and Perrig, A. (2000). Practical techniques for searches on encrypted data. IEEE Symposium on Security and Privacy, pages 44-55. http://citeseer.nj.nec.com/song00practical.html.
  20. Ukkonen, E. (1995). On-line construction of suffix trees. Algorithmica, 14(3):249-260.
Download


Paper Citation


in Harvard Style

Haynberg R., Rill J., Achenbach D. and Müller-Quade J. (2013). Symmetric Searchable Encryption for Exact Pattern Matching using Directed Acyclic Word Graphs . In Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013) ISBN 978-989-8565-73-0, pages 403-410. DOI: 10.5220/0004530004030410


in Bibtex Style

@conference{secrypt13,
author={Rolf Haynberg and Jochen Rill and Dirk Achenbach and Jörn Müller-Quade},
title={Symmetric Searchable Encryption for Exact Pattern Matching using Directed Acyclic Word Graphs},
booktitle={Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013)},
year={2013},
pages={403-410},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004530004030410},
isbn={978-989-8565-73-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013)
TI - Symmetric Searchable Encryption for Exact Pattern Matching using Directed Acyclic Word Graphs
SN - 978-989-8565-73-0
AU - Haynberg R.
AU - Rill J.
AU - Achenbach D.
AU - Müller-Quade J.
PY - 2013
SP - 403
EP - 410
DO - 10.5220/0004530004030410