Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015 (2015), Article ID 314621, 7 pages
http://dx.doi.org/10.1155/2015/314621
Research Article

A Novel Model for Lattice-Based Authorized Searchable Encryption with Special Keyword

1School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China
2Department of Mathematics, Qiongzhou University, Hainan 572000, China

Received 25 December 2014; Accepted 26 January 2015

Academic Editor: Chin-Chia Wu

Copyright © 2015 Fugeng Zeng and Chunxiang Xu. 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. P. Mell and T. Grance, “The NIST definition of cloud computing,” National Institute of Standards and Technology, vol. 53, no. 6, 2009. View at Google Scholar
  2. 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
  3. 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
  4. 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
  5. R. Ostrovsky, A. Sahai, and B. Waters, “Attribute-based encryption with non-monotonic access structures,” in Proceedings of the 14th ACM Conference on Computer and Communications Security (CCS '07), pp. 195–203, November 2007. View at Publisher · View at Google Scholar · View at Scopus
  6. L. Cheung and C. Newport, “Provably secure ciphertext policy ABE,” in Proceedings of the 14th ACM Conference on Computer and Communications Security (CCS '07), pp. 456–465, November 2007. View at Publisher · View at Google Scholar · View at Scopus
  7. B. Waters, “Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization,” in Public Key Cryptography—PKC 2011, D. Catalano, N. Fazio, R. Gennaro, and A. Nicolosi, Eds., vol. 6571 of Lecture Notes in Computer Science, pp. 53–70, Springer, Berlin, Germany, 2011. View at Publisher · View at Google Scholar
  8. J. Zhang and Z. Zhang, “A ciphertext policy attribute-based encryption scheme without pairings,” in Information Security and Cryptology, vol. 7537 of Lecture Notes in Computer Science, pp. 324–340, Springer, Berlin, Germany, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  9. X. Boyen, “Attribute-based functional encryption on lattices,” in Theory of Cryptography: 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3–6, 2013. Proceedings, vol. 7785 of Lecture Notes in Computer Science, pp. 122–142, Springer, Berlin, Germany, 2013. View at Publisher · View at Google Scholar
  10. 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
  11. J. Lai, X. Zhou, R. H. Deng, Y. Li, and K. Chen, “Expressive search on encrypted data,” in Proceedings of the 8th ACM SIGSAC Symposium on Information, Computer and Communications Security (ASIA CCS '13), pp. 243–252, May 2013. View at Publisher · View at Google Scholar · View at Scopus
  12. A. Lewko, T. Okamoto, A. Sahai, K. Takashima, and B. Waters, “Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption,” in Advances in Cryptology—EUROCRYPT 2010, H. Gilbert, Ed., vol. 6110 of Lecture Notes in Computer Science, pp. 62–91, Springer, Heidelberg, Germany, 2010. View at Publisher · View at Google Scholar
  13. 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
  14. Z. Lv, H. Cheng, M. Zhang, and D. Feng, “Expressive and secure searchable encryption in the public key setting,” in Information Security, Lecture Notes in Computer Science, pp. 364–376, Springer, Berlin, Germany, 2014. View at Publisher · View at Google Scholar
  15. C. Wang, W. Li, Y. Li et al., “A ciphertext-policy attribute-based encryption scheme supporting keyword search function,” in Cyberspace Safety and Security, pp. 377–386, Springer, Berlin, Germany, 2013. View at Google Scholar
  16. M. Chuah and W. Hu, “Privacy-aware bedtree based solution for fuzzy multi-keyword search over encrypted data,” in Proceedings of the 31st International Conference on Distributed Computing Systems Workshops (ICDCSW '11), pp. 273–281, June 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. T. Nishide, K. Yoneyama, and K. Ohta, “Attribute-based encryption with partially hidden encryptor-specified access structures,” in Applied Cryptography and Network Security, vol. 5037 of Lecture Notes in Computer Science, pp. 111–129, Springer, Berlin, Germany, 2008. View at Google Scholar
  18. J. Alwen and C. Peikert, “Generating shorter bases for hard random lattices,” in Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS '09), pp. 75–86, Freiburg, Germany, 2009.
  19. C. Gentry, C. Peikert, and V. Vaikuntanathan, “Trapdoors for hard lattices and new cryptographic constructions,” in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC '08), R. E. Ladner and C. Dwork, Eds., pp. 197–206, ACM, 2008.
  20. O. Regev, “On lattices, learning with errors, random linear codes, and cryptography,” in Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC ’05), pp. 84–93, ACM, Baltimore, Md, USA, May 2005. View at Publisher · View at Google Scholar