Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014 (2014), Article ID 153791, 16 pages
http://dx.doi.org/10.1155/2014/153791
Research Article

A Layered Searchable Encryption Scheme with Functional Components Independent of Encryption Methods

School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731, China

Received 18 October 2013; Accepted 8 January 2014; Published 25 February 2014

Academic Editors: H.-E. Tseng and G. Wei

Copyright © 2014 Guangchun Luo et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. H. Takabi, J. B. D. Joshi, and G.-J. Ahn, “Security and privacy challenges in cloud computing environments,” IEEE Security and Privacy, vol. 8, no. 6, pp. 24–31, 2010. View at Publisher · View at Google Scholar · View at Scopus
  2. D. Boneh and B. Waters, “Conjunctive, subset, and range queries on encrypted data,” in Theory of Cryptography, pp. 535–554, Springer, 2007. View at Google Scholar
  3. J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, and W. Lou, “Fuzzy keyword search over encrypted data in cloud computing,” in Proceeding of the Fuzzy Keyword Search over Encrypted Data in Cloud Computing (IEEE INFOCOM '10), Institute of Electrical and Electronics Engineers, March 2010. View at Publisher · View at Google Scholar · View at Scopus
  4. A. Swaminathan, Y. Mao, G.-M. Su et al., “Confidentiality-preserving rank-ordered search,” in Proceedings of the ACM Workshop on Storage Security and Survivability (StorageSS '07), pp. 7–12, Association for Computing Machinery, October 2007. View at Publisher · View at Google Scholar · View at Scopus
  5. D. J. Abadi, D. Carney, U. Çetintemel et al., “Aurora: a new model and architecture for data stream management,” VLDB Journal, vol. 12, no. 2, pp. 120–139, 2003. View at Publisher · View at Google Scholar · View at Scopus
  6. D. X. Song, D. Wagner, and A. Perrig, “Practical techniques for searches on encrypted data,” in Proceedings of the IEEE Symposium on Security and Privacy, pp. 44–55, May 2000. View at Scopus
  7. E. J. Goh, “Secure indexes,” Tech. Rep., IACR ePrint Cryptography Archive, 2003. View at Google Scholar
  8. R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: improved definitions and efficient constructions,” in Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS '06), pp. 79–88, November 2006. View at Publisher · View at Google Scholar · View at Scopus
  9. M. Chase and S. Kamara, “Structured encryption and controlled disclosure,” in Proceedings of the 16th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT '10), pp. 577–594, Springer, 2010.
  10. S. Kamara, C. Papamanthou, and T. Roeder, “Cs2: a searchable cryptographic cloud storage system,” Tech. Rep. MSR-TR-2011-58, Microsoft Research.
  11. D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G. Persiano, “Public key encryption with keyword search,” in Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT '04), pp. 506–522, Springer, 2004.
  12. M. Abdalla, M. Bellare, D. Catalano et al., “Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions,” Journal of Cryptology, vol. 21, no. 3, pp. 350–391, 2008. View at Publisher · View at Google Scholar · View at Scopus
  13. N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, “Privacy-preserving multi-keyword ranked search over encrypted cloud data,” in Proceedings of the IEEE International Conference on Computer Communications (IEEE INFOCOM '11), pp. 829–837, Institute of Electrical and Electronics Engineers, 2011.
  14. C. Wang, N. Cao, J. Li, K. Ren, and W. Lou, “Secure ranked keyword search over encrypted cloud data,” in Proceedings of the 30th IEEE International Conference on Distributed Computing Systems (ICDCS '10), pp. 253–262, June 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. P. Golle, J. Staddon, and B. Waters, “Secure conjunctive keyword search over encrypted data,” in Proceedings of the 2nd International Conference (ACNS '04), pp. 31–45, Springer, 2004.
  16. C. Bosch, R. Brinkman, P. Hartel, and W. Jonker, “Conjunctive wildcard search over encrypted data,” in Proceedings of the 8th VLDB Workshop on Secure Data Management, pp. 114–127, Springer, 2011.
  17. J. Bringer and H. Chabanne, “Embedding edit distance to allow private keyword search in cloud computing,” in Proceedings of the 8th FTRA International Conference on Secure and Trust Computing, Data Management, and Application, pp. 105–113, Springer, 2011.
  18. W. Cong, R. Kui, Y. Shucheng, and K. M. R. Urs, “Achieving usable and privacy-assured similarity search over outsourced cloud data,” in Proceedings of the IEEE Conference on Computer Communications (INFOCOM '12), pp. 451–459, 2012.
  19. M. Kuzu, M. S. Islam, and M. Kantarcioglu, “Efficient similarity search over encrypted data,” in Proceedings of the IEEE 28th International Conference on Data Engineering (ICDE '12), pp. 1156–1167, 2012.
  20. S. Zittrower and C. C. Zou, “Encrypted phrase searching in the cloud,” in Proceedings of the IEEE Conference and Exhibition Global Telecommunications Conference (GLOBECOM '12), pp. 764–770, 2012.
  21. Y. Tang, D. Gu, N. Ding, and H. Lu, “Phrase search over encrypted data with symmetric encryption scheme,” in Proceedings of the 32nd International Conference on Distributed Computing Systems Workshops (ICDCSW '12), pp. 471–480, 2012.
  22. D. Boneh, E. Kushilevitz, R. Ostrovsky, and W. E. Skeith III, “Public key encryption that allows pir queries,” in Proceeding of the 27th Annual International Cryptology Conference (CRYPTO '07), pp. 50–67, Springer, 2007.
  23. E. Shi, J. Bethencourt, T.-H. H. Chan, D. Song, and A. Perrig, “Multi-dimensional range query over encrypted data,” in Proceedings of the IEEE Symposium on Security and Privacy (SP '07), pp. 350–364, May 2007. View at Publisher · View at Google Scholar · View at Scopus
  24. R. Rivest, The Md5 Message-Digest Algorithm, Internet Request For Comments, 1992.
  25. C. Wang, N. Cao, K. Ren, and W. Lou, “Enabling secure and efficient ranked keyword search over outsourced cloud data,” IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 8, pp. 1467–1479, 2012. View at Google Scholar
  26. S. Sedghi, P. Van Liesdonk, S. Nikova, P. Hartel, and W. Jonker, “Searching keywords with wildcards on encrypted data,” in Security and Cryptography For Networks, pp. 138–153, Springer, 2010. View at Google Scholar
  27. A. Boldyreva, N. Chenette, Y. Lee, and A. Oneill, “Order-preserving symmetric encryption,” in Advances in Cryptology (EUROCRYPT '09), pp. 224–241, Springer, 2009.
  28. R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, “Order preserving encryption for numeric data,” in Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD '04), pp. 563–574, June 2004. View at Scopus
  29. A. Boldyreva, N. Chenette, and A. O'Neill, “Order-preserving encryption revisited: improved security analysis and alternative solutions,” in Proceedings of the Advances in Cryptology (CRYPTO '11), pp. 578–595, Springer, 2011.
  30. M. L. Fredman, E. Szemeredi, and J. Komlos, “Storing a sparse table with o(1) worst case access time,” Journal of the ACM, vol. 31, no. 3, pp. 538–544, 1984. View at Publisher · View at Google Scholar · View at Scopus
  31. B. H. Bloom, “Space/time trade-offs in hash coding with allowable errors,” Communications of the ACM, vol. 13, no. 7, pp. 422–426, 1970. View at Publisher · View at Google Scholar · View at Scopus
  32. H. Hacigümüş, B. Iyer, C. Li, and S. Mehrotra, “Executing SQL over encrypted data in the database-service-provider model,” in Proceedings of the ACM SIGMOD International Conference on Managment of Data (ACM SIGMOD '02), pp. 216–227, June 2002. View at Scopus
  33. B. Hore, S. Mehrotra, and G. Tsudik, “A privacy-preserving index for range queries,” in Proceedings of the Thirtieth international conference on Very large data bases, pp. 720–731, VLDB Endowment, 2004.
  34. H. E. Williams, J. Zobel, and P. Anderson, “What's next? index structures for efficient phrase querying,” in Australasian Database Conference, pp. 141–152, 1999. View at Google Scholar
  35. C. Gutwin, G. Paynter, I. Witten, C. Nevill-Manning, and E. Frank, “Improving browsing in digital libraries with keyphrase indexes,” Decision Support Systems, vol. 27, no. 1, pp. 81–104, 1999. View at Publisher · View at Google Scholar · View at Scopus
  36. V. Levenstein, “Binary codes capable of correcting spurious insertions and deletions of ones,” Problems of Information Transmission, vol. 1, no. 1, pp. 8–17, 1965. View at Google Scholar