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

Public Key Encryption with Keyword Search from Lattices in Multiuser Environments

Department of Computer Science, Jinan University, Guangzhou 510632, China

Received 30 May 2016; Accepted 17 October 2016

Academic Editor: Nazrul Islam

Copyright © 2016 Daini Wu 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. D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, “Public key encryption with keyword search,” in International Conference on the Theory and Applications of Cryptographic Techniques EUROCRYPT 2004: Advances in Cryptology—EUROCRYPT 2004, vol. 3027 of Lecture Notes in Computer Science, pp. 506–522, Springer, Berlin, Germany, 2004. View at Google Scholar
  2. B. R. Waters, D. Balfanz, G. Durfee, and D. K. Smetters, “Building an encrypted and searchable audit log,” in Proceedings of the NDSS Symposium, vol. 4, pp. 5–6, February 2004.
  3. 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
  4. 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, V. Shoup, Ed., vol. 3621 of Lecture Notes in Computer Science, pp. 205–222, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar
  5. D. Boneh and B. Waters, “Conjunctive, subset, and range queries on encrypted data,” in Theory of Cryptography Conference: TCC 2007: Theory of Cryptography, vol. 4392 of Lecture Notes in Computer Science, pp. 535–554, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar
  6. J. Baek, R. Safavi-Naini, and W. Susilo, “Public key encryption with keyword search revisited,” in Computational Science and Its Applications—ICCSA 2008: International Conference, Perugia, Italy, June 30– July 3, 2008, Proceedings, Part I, vol. 5072 of Lecture Notes in Computer Science, pp. 1249–1259, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar
  7. J. Camenisch, M. Kohlweiss, A. Rial, and C. Sheedy, “Blind and anonymous identity-based encryption and authorised private searches on public key encrypted data,” in Public Key Cryptography-PKC 2009, pp. 196–214, Springer, Berlin, Germany, 2009. View at Google Scholar
  8. N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, “Privacy-preserving multi-keyword ranked search over encrypted cloud data,” IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 1, pp. 222–233, 2014. View at Publisher · View at Google Scholar · View at Scopus
  9. P. W. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” in Proceedings of the 35th Annual Symposium on Foundations of Computer Science (SFCS '94), pp. 124–134, IEEE, 1994. View at Publisher · View at Google Scholar
  10. M. Ajtai, “Generating hard instances of lattice problems,” in Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC '96), pp. 99–108, Philadelphia, Pa, USA, May 1996. View at Publisher · View at Google Scholar
  11. S. D. Gordon, J. Katz, and V. Vaikuntanathan, “A group signature scheme from lattice assumptions,” in Advances in Cryptology—ASIACRYPT 2010, vol. 6477, pp. 395–412, Springer, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. A. Langlois, S. Ling, K. Nguyen, and H. Wang, “Lattice-based group signature scheme with verifier-local revocation,” in Public-Key Cryptography—PKC 2014, H. Krawczyk, Ed., vol. 8383 of Lecture Notes in Computer Science, pp. 345–361, Springer, Berlin, Germany, 2014. View at Publisher · View at Google Scholar
  13. S. Agrawal, D. Boneh, and X. Boyen, “Efficient lattice (H)IBE in the standard model,” in Advances in Cryptology—EUROCRYPT 2010, vol. 6110, pp. 553–572, Springer, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. S. Agrawal, D. Boneh, and X. Boyen, “Lattice basis delegation in fixed dimension and shorter-cipher text hierarchical ibe,” in Annual Cryptology Conference: CRYPTO 2010: Advances in Cryptology—CRYPTO 2010, vol. 6223 of Lecture Notes in Computer Science, pp. 98–115, Springer, Berlin, Germany, 2010. View at Google Scholar
  15. X. Li, B. Yang, Y. Guo, and W. Sun, “Provably secure group based broadcast encryption on lattice,” Journal of Information and Computational Science, vol. 8, no. 2, pp. 179–193, 2011. View at Google Scholar
  16. A. Georgescu, “Anonymous lattice-based broadcast encryption,” in Information and Communication Technology, pp. 353–362, Springer, Berlin, Germany, 2013. View at Google Scholar
  17. Y. Wang, “Lattice ciphertext policy attribute-based encryption in the standard model,” International Journal of Network Security, vol. 16, no. 6, pp. 444–451, 2014. View at Google Scholar · View at Scopus
  18. C. Gentry, “Fully homomorphic encryption using ideal lattices,” in Proceedings of the 41th Annual ACM Symposium on Theory of Computing (STOC '09), pp. 169–178, ACM, 2009. View at Publisher · View at Google Scholar
  19. C. Gentry, “Toward basing fully homomorphic encryption on worst-case hardness,” in Annual Cryptology Conference: CRYPTO 2010: Advances in Cryptology—CRYPTO 2010, vol. 6223 of Lecture Notes in Computer Science, pp. 116–137, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar
  20. C. Gu, Y. Guang, Y. Zhu, and Y. Zheng, “Public key encryption with keyword search from lattices,” International Journal of Information Technology, vol. 19, no. 1, 2013. View at Google Scholar
  21. C. Hou, F. Liu, H. Bai, and L. Ren, “Public-key encryption with keyword search from lattice,” in Proceedings of the 8th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC '13), pp. 336–339, IEEE, Compiegne, France, October 2013. View at Publisher · View at Google Scholar · View at Scopus
  22. J. Alwen and C. Peikert, “Generating shorter bases for hard random lattices,” Theory of Computing Systems, vol. 48, no. 3, pp. 535–553, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. C. Gentry, C. Peikert, and V. Vaikuntanathan, “Trapdoors for hard lattices and new cryptographic constructions,” in Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC '08), pp. 197–206, Victoria, Canada, May 2008. View at Publisher · View at Google Scholar
  24. C.-K. Chu, J. Weng, S. S. M. Chow, J. Zhou, and R. H. Deng, “Conditional proxy broadcast re-encryption,” in Information Security and Privacy, C. Boyd and J. G. Nieto, Eds., vol. 5594 of Lecture Notes in Computer Science, pp. 327–342, Springer, Berlin, Germany, 2009. View at Publisher · View at Google Scholar