Semantic search over encrypted data

2013 20th International Conference on Telecommunications, ICT 2013

Volumn , Issue , 2013, Pages

  Moataz, Tarik ^a   Shikfa, Abdullatif ^b   Cuppens Boulahia, Nora ^a   Cuppens, Frédéric ^a  

^a ECOLE DES MINES DE NANTES   (France)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INFORMATION TECHNOLOGY; SECURITY OF DATA; SEMANTICS;

CURRENT CONSTRUCTION; ENCRYPTED DATA; OUTSOURCED DATUM; SEARCHABLE ENCRYPTIONS; SEARCHING CAPABILITY; SEMANTIC SEARCH; STATE OF THE ART; STEMMING ALGORITHMS;

CRYPTOGRAPHY;

EID: 84898945995     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTEL.2013.6632121     Document Type: Conference Paper

References (22)

1. M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi. Searchable encryption revisited: Consistency properties, relation to anonymous ibe, and extensions. J. Cryptology, 21(3):350-391, 2008.
2. M. Bellare, A. Boldyreva, and A. O'Neill. Deterministic and efficiently searchable encryption. CRYPTO, pages 535-552, 2007.
3. D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G. Persiano. Public key encryption with keyword search. EUROCRYPT, pages 506-522, 2004.
4. D. Boneh and B. Waters. Conjunctive, subset, and range queries on encrypted data. TCC, pages 535-554, 2007.
5. Y.-C. Chang and M. Mitzenmacher. Privacy preserving keyword searches on remote encrypted data. ACNS, pages 442-455, 2005.
6. L. Chmielewski and J.-H. Hoepman. Fuzzy private matching (extended abstract). pages 327-334, 2008.
7. R. Curtmola, J. A. Garay, S. Kamara, and R. Ostrovsky. Searchable symmetric encryption: Improved definitions and efficient constructions. Journal of Computer Security, 19(5):895-934, 2011.
8. M. J. Freedman, K. Nissim, and B. Pinkas. Efficient private matching and set intersection. pages 1-19, 2004.
9. E.-J. Goh. Secure indexes. IACR Cryptology ePrint Archive, 2003:216, 2003.
10. P. Golle, J. Staddon, and B. R. Waters. Secure conjunctive keyword search over encrypted data. ACNS, pages 31-45, 2004.
11. J. B. Lovins. Development of a stemming algorithm. Mechanical Translation and Computational Linguistics, 11:22-31, 1968.
12. P. Majumder, M. Mitra, S. K. Parui, G. Kole, P. Mitra, and K. Datta. Yass: Yet another suffix stripper. ACM Trans. Inf. Syst., 25(4), 2007.
13. J. Mayfield and P. McNamee. Single n-gram stemming. pages 415-416, 2003.
14. M. Melucci and N. Orio. A novel method for stemmer generation based on hidden markov models. pages 131-138, 2003.
15. L. F. Michael, K. Janos, and S. Endre. Storing a sparse table with 0(1) worst case access time. J. ACM, 31(3), 1984.
16. F. Peng, N. Ahmed, X. Li, and Y. Lu. Context sensitive stemming for web search. pages 639-646, 2007.
17. S. E. Robertson, C. J. van Rijsbergen, and M. F. Porter. Probabilistic models of indexing and searching. pages 35-56, 1980.
18. E. Shi, J. Bethencourt, H. T.-H. Chan, D. X. Song, and A. Perrig. Multidimensional range query over encrypted data. IEEE Symposium on Security and Privacy, pages 350-364, 2007.
19. D. X. Song, D. Wagner, and A. Perrig. Practical techniques for searches on encrypted data. IEEE Symposium on Security and Privacy, pages 44-55, 2000.
20. P. Wang, H. Wang, and J. Pieprzyk. Keyword field-free conjunctive keyword searches on encrypted data and extension for dynamic groups. CANS, pages 178-195, 2008.
21. J. Xu and W. B. Croft. Corpus-based stemming using cooccurrence of word cariants. ACM Trans. Inf. Syst., 16(1):61-81, 1998.
22. Q. Ye, R. Steinfeld, J. Pieprzyk, and H. Wang. Efficient fuzzy matching and intersection on private datasets. pages 211-228, 2009.