Table of Contents Author Guidelines Submit a Manuscript
Security and Communication Networks
Volume 2017 (2017), Article ID 6435138, 16 pages
https://doi.org/10.1155/2017/6435138
Research Article

Multiuser Searchable Encryption with Token Freshness Verification

1Sarvajanik College of Engineering and Technology, Surat, Gujarat, India
2Sardar Vallabhbhai National Institute of Technology, Surat, Gujarat, India

Correspondence should be addressed to Dhruti Sharma; moc.liamg@77iturhdamrahs

Received 2 May 2017; Revised 25 September 2017; Accepted 25 October 2017; Published 26 November 2017

Academic Editor: Sherali Zeadally

Copyright © 2017 Dhruti Sharma and Devesh C. Jinwala. 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. M. Abdalla, M. Bellare, D. Catalano et al., “Searchable encryption revisited: consistency properties, relation to anonymous {IBE}, and extensions,” in Advances in cryptology---{CRYPTO} 2005, vol. 3621 of Lecture Notes in Comput. Sci., pp. 205–222, Springer, Berlin, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  2. S. Shin and K. Kobara, “Towards secure cloud storage,” Demo for CloudCom 2010, vol. 2, p. 8, 2010. View at Google Scholar
  3. G. Brunette, R. Mogull, and et al., “Security guidance for critical areas of focus in cloud computing v2. 1,” Cloud Security Alliance, pp. 1–76, 2009. View at Google Scholar
  4. D. X. Song, D. Wagner, and A. Perrig, “Practical techniques for searches on encrypted data,” in Proceedings of the in Security and Privacy, 2000 SP2000 IEEE Symposiumon. 1em plus 0.5em minus 0.4em IEEE, pp. 44–55, 2000.
  5. E.-J. Goh, “Secure indexes,” IACR Cryptology ePrint Archive, vol. 2003, p. 216, 2003. View at Google Scholar
  6. D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, “Public key encryption with keyword search,” in Advances in Cryptology—EUROCRYPT 2004, vol. 3027 of Lecture Notes in Computer Science, pp. 506–522, Springer, Berlin, Germany, 2004. View at Publisher · View at Google Scholar
  7. J. Baek, R. Safavi-Naini, and W. Susilo, “Public key encryption with keyword search revisited,” in Proceedings in Computational Science and Its Applications–ICCSA International Conference, Part I 2008. 1em plus 0.5em minus 0.4em, vol. 30, pp. 1249–1259, Springer, Perugia, Italy, 2008.
  8. D. J. Park, K. Kim, and P. J. Lee, “Public Key Encryption with Conjunctive Field Keyword Search,” in Information Security Applications, vol. 3325 of Lecture Notes in Computer Science, pp. 73–86, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005. View at Publisher · View at Google Scholar
  9. Y. H. Hwang and P. J. Lee, “Public key encryption with conjunctive keyword search and its extension to a multi-user system,” in Pairing-based cryptography---Pairing 2007, vol. 4575 of Lecture Notes in Comput. Sci., pp. 2–22, Springer, Berlin, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  10. P. Wang, H. Wang, and J. Pieprzyk, “Common secure index for conjunctive keyword-based retrieval over encrypted data,” Secure Data Management, pp. 108–123, 2007. View at Google Scholar
  11. P. Wang, H. Wang, and J. Pieprzyk, “Threshold privacy preserving keyword searches,” in Proceedings of the International Conference on Current Trends in Theory and Practice of Computer Science. 1em plus 0.5em minus 0.4em , 2008, pp. 646–658, pp. 646–658, Springer, 2008.
  12. P. Wang, H. Wang, and J. Pieprzyk, “An Efficient Scheme of Common Secure Indices for Conjunctive Keyword-Based Retrieval on Encrypted Data,” in Information Security Applications, vol. 5379, pp. 145–159, Springer, Berlin, Heidelberg, 2009. View at Publisher · View at Google Scholar
  13. P. Wang, H. Wang, and J. Pieprzyk, “Keyword Field-Free Conjunctive Keyword Searches on Encrypted Data and Extension for Dynamic Groups,” in Cryptology and Network Security, vol. 5339, pp. 178–195, Springer, Berlin, Heidelberg, 2008. View at Publisher · View at Google Scholar
  14. F. Bao, R. H. Deng, X. Ding, and Y. Yang, “Private query on encrypted data in multi-user settings,” in Information security practice and experience, vol. 4991 of Lecture Notes in Comput. Sci., pp. 71–85, Springer, Berlin, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  15. J. Li and X. Chen, “Efficient multi-user keyword search over encrypted data in cloud computing,” Computing and Informatics, vol. 32, no. 4, pp. 723–738, 2013. View at Google Scholar
  16. H. Huang, J. Du, H. Wang, and R. Wang, “A multi-keyword multi-user searchable encryption scheme based on cloud storage,” in Proceedings of the Joint 15th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, 10th IEEE International Conference on Big Data Science and Engineering and 14th IEEE International Symposium on Parallel and Distributed Processing with Applications, IEEE TrustCom/BigDataSE/ISPA 2016, pp. 1937–1943, August 2016. View at Publisher · View at Google Scholar · View at Scopus
  17. A. Kiayias, O. Oksuz, A. Russell, Q. Tang, and B. Wang, in Proceedings of the European Symposium on Research in Computer Security. 1em plus 0.5em minus 0.4em, pp. 173–195, Springer, 2016.
  18. Y. Zhang, L. Liu, and S. Wang, “Multi-User and Keyword-Based Searchable Encryption Scheme,” in Proceedings of the 2016 12th International Conference on Computational Intelligence and Security (CIS), pp. 223–227, Wuxi, China, December 2016. View at Publisher · View at Google Scholar
  19. S. Wang, X. Zhang, and Y. Zhang, “Efficiently multi-user searchable encryption scheme with attribute revocation and grant for cloud storage,” PLoS ONE, vol. 11, no. 11, Article ID e0167157, 2016. View at Publisher · View at Google Scholar · View at Scopus
  20. J. Ye, J. Wang, J. Zhao, J. Shen, and K.-C. Li, “Fine-grained searchable encryption in multi-user setting,” Soft Computing, pp. 1–12, 2016. View at Publisher · View at Google Scholar · View at Scopus
  21. B. Zhang and F. Zhang, “An efficient public key encryption with conjunctive-subset keywords search,” Journal of Network and Computer Applications, vol. 34, no. 1, pp. 262–267, 2011. View at Publisher · View at Google Scholar · View at Scopus
  22. M. Ding, F. Gao, Z. Jin, and H. Zhang, “An efficient public key encryption with conjunctive keyword search scheme based on pairings,” Proceedings in 2012 3rd IEEE International Conference on Network Infrastructure and Digital Content. 1em plus 0.5em minus 0.4em IEEE, pp. 526–530, 2012. View at Google Scholar
  23. Z. Chen, C. Wu, and D. Wang, “Conjunctive keywords searchable encryption with efficient pairing, constant ciphertext and short trapdoor,” PAISI, pp. 176–189, 2012. View at Publisher · View at Google Scholar · View at Scopus
  24. Y.-C. Chang and M. Mitzenmacher, “Privacy Preserving Keyword Searches on Remote Encrypted Data,” in Applied Cryptography and Network Security. 1em plus 0.5em minus 0.4em, vol. 3531, pp. 442–455, Springer, Berlin, Heidelberg, 2005. View at Publisher · View at Google Scholar
  25. R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: improved definitions and efficient constructions,” Journal of Computer Security, vol. 19, no. 5, pp. 895–934, 2011. View at Publisher · View at Google Scholar · View at Scopus
  26. P. Golle, J. Staddon, and B. Waters, “Secure conjunctive keyword search over encrypted data,” in Applied Cryptography and Network Security: Second International Conference, ACNS 2004, Yellow Mountain, China, June 8–11, 2004. Proceedings, vol. 3089 of Lecture Notes in Computer Science, pp. 31–45, Springer, Berlin, Germany, 2004. View at Publisher · View at Google Scholar
  27. L. Ballard, S. Kamara, and F. Monrose, “Achieving efficient conjunctive keyword searches over encrypted data,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface, vol. 3783, pp. 414–426, 2005. View at Publisher · View at Google Scholar · View at Scopus
  28. J. W. Byun, D. H. Lee, and J. Lim, “Efficient Conjunctive Keyword Search on Encrypted Data Storage System,” in Public Key Infrastructure. 1em plus 0.5em minus 0.4em, vol. 4043, pp. 184–196, Springer, Berlin, Heidelberg, 2006. View at Publisher · View at Google Scholar
  29. D. Boneh and B. Waters, “Conjunctive, subset, and range queries on encrypted data,” in Theory of Cryptography Conference: TCC 2007. 1em plus 0.5em minus 0.4em, pp. 535–554, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar
  30. M.-S. Hwang, S.-T. Hsu, and C.-C. Lee, “A new public key encryption with conjunctive field keyword search scheme,” Information Technology and Control, vol. 43, no. 3, pp. 277–288, 2014. View at Publisher · View at Google Scholar · View at Scopus
  31. H. S. Rhee, J. H. Park, W. Susilo, and D. H. Lee, “Trapdoor security in a searchable public-key encryption scheme with a designated tester,” The Journal of Systems and Software, vol. 83, no. 5, pp. 763–771, 2010. View at Publisher · View at Google Scholar · View at Scopus
  32. Y. Zhao, H. Ma, X. Chen, Q. Tang, and H. Zhu, “A new trapdoor-indistinguishable public key encryption with keyword search,” Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications, vol. 3, no. 1-2, pp. 72–81, 2012. View at Google Scholar · View at Scopus
  33. Y. Miao, J. Ma, F. Wei, Z. Liu, X. A. Wang, and C. Lu, “VCSE: Verifiable conjunctive keywords search over encrypted data without secure-channel,” Peer-to-Peer Networking and Applications, vol. 10, no. 4, pp. 995–1007, 2017. View at Publisher · View at Google Scholar · View at Scopus
  34. N. Haller, “The S/KEY One-Time Password System,” RFC Editor RFC1760, 1995. View at Publisher · View at Google Scholar
  35. D. Boneh and M. Franklin, “Identity-based encryption from the Weil pairing,” in Advances in Cryptology—CRYPTO 2001, vol. 2139 of Lecture Notes in Computer Science, pp. 213–229, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  36. A. Shamir, “Identity-based cryptosystems and signature schemes,” in Advances in Cryptology: Proceedings of (CRYPTO '84), vol. 196 of Lecture Notes in Computer Science, pp. 47–53, Springer, Berlin, Germany, 1985. View at Publisher · View at Google Scholar · View at MathSciNet
  37. J. Bethencourt, A. Sahai, and B. Waters, “Ciphertext-policy attribute-based encryption,” in Proceedings of the IEEE Symposium on Security and Privacy (SP '07), pp. 321–334, May 2007. View at Publisher · View at Google Scholar · View at Scopus
  38. V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-based encryption for fine-grained access control of encrypted data,” in Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS '06), pp. 89–98, November 2006. View at Publisher · View at Google Scholar · View at Scopus
  39. A. Sahai and B. Waters, “Fuzzy identity-based encryption,” in Advances in Cryptology – EUROCRYPT 2005, vol. 3494 of Lecture Notes in Computer Science, pp. 457–473, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  40. J. Katz, A. Sahai, and B. Waters, “Predicate encryption supporting disjunctions, polynomial equations, and inner products,” in Advances in Cryptology—EUROCRYPT 2008, vol. 4965 of Lecture Notes in Computer Science, pp. 146–162, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  41. C.-C. Lee, S.-T. Hsu, and M.-S. Hwang, “A study of conjunctive keyword searchable schemes,” IJ Network Security, vol. 15, no. 5, pp. 321–330, 2013. View at Google Scholar
  42. A. de Caro and V. Iovino, “jPBC: Java pairing based cryptography,” in Proceedings of the 16th IEEE Symposium on Computers and Communications (ISCC '11), pp. 850–855, July 2011. View at Publisher · View at Google Scholar · View at Scopus