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

Adaptive Security of Broadcast Encryption, Revisited

Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong University, Jinan, China

Correspondence should be addressed to Puwen Wei; nc.ude.uds@iewp and Mingqiang Wang; nc.ude.uds@gnaiqgnimgnaw

Received 21 February 2017; Accepted 27 April 2017; Published 3 July 2017

Academic Editor: Paolo D’Arco

Copyright © 2017 Bingxin Zhu 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. A. Fiat and M. Naor, “Broadcast encryption,” in Advances in Cryptology—(CRYPTO '93), D. R. Stinson, Ed., vol. 773 of Lecture Notes in Computer Science, pp. 480–491, Springer, Berlin, Germany, 1993. View at Google Scholar
  2. I. Kim and S. O. Hwang, “An optimal identity-based broadcast encryption scheme for wireless sensor networks,” IEICE Transactions on Communications, vol. E96-B, no. 3, pp. 891–895, 2013. View at Publisher · View at Google Scholar · View at Scopus
  3. D. Naor, M. Naor, and J. Lotspiech, “Revocation and tracing schemes for stateless receivers,” in Proceedings of the Advances in Cryptology—(CRYPTO '01), 21st Annual International Cryptology Conference, pp. 41–62, Springer, Berlin, Germany. View at Publisher · View at Google Scholar · View at MathSciNet
  4. D. Halevy and A. Shamir, “The LSD broadcast encryption scheme,” in Advances in Cryptology—(CRYPTO '02), M. Yung, Ed., vol. 2442 of Lecture Notes in Computer Science, pp. 47–60, Springer, Berlin, Germany, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  5. M. T. Goodrich, J. Z. Sun, and R. Tamassia, “Efficient tree-based revocation in groups of low-state devices,” in Advances in Cryptology—(CRYPTO '04), M. K. Franklin, Ed., vol. 3152 of Lecture Notes in Computer Science, pp. 511–527, Springer, Berlin, Germany, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  6. Y. Dodis and N. Fazio, “Public key broadcast encryption for stateless receivers,” in Security and Privacy in Digital Rights Management, ACM CCS-9 Workshop, J. Feigenbaum, Ed., vol. 2696 of Lecture Notes in Computer Science, pp. 61–80, Springer, Berlin, Germany, 2003. View at Publisher · View at Google Scholar
  7. D. Boneh, C. Gentry, and B. Waters, “Collusion resistant broadcast encryption with short ciphertexts and private keys,” in Advances in Cryptology—(CRYPTO '05), V. Shoup, Ed., vol. 3621 of Lecture Notes in Computer Science, pp. 258–275, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  8. C. Gentry and B. Waters, “Adaptive security in broadcast encryption systems (with short ciphertexts),” in Advances in Cryptology—(EUROCRYPT '09), A. Joux, Ed., vol. 5479 of Lecture Notes in Computer Science, pp. 171–188, Springer, Berlin, Germany, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  9. B. Waters, “Dual system encryption: realizing fully secure IBE and HIBE under simple assumptions,” in Advances in Cryptology—(CRYPTO '2009), S. Halevi, Ed., vol. 5677 of Lecture Notes in Computer Science, pp. 619–636, Springer, Berlin, Germany, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  10. D. Boneh, B. Waters, and M. Zhandry, “Low overhead broadcast encryption from multilinear maps,” in Advances in Cryptology—(CRYPTO '14), J. A. Garay and R. Gennaro, Eds., vol. 8616 of Lecture Notes in Computer Science, pp. 206–223, Springer, Berlin, Germany, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  11. D. Boneh and B. Waters, “A fully collusion resistant broadcast, trace, and revoke system,” in Proceedings of CCS 2006: 13th ACM Conference on Computer and Communications Security, pp. 211–220, Alexandria, Virginia, USA, November 2006. View at Publisher · View at Google Scholar · View at Scopus
  12. J. H. Han, J. H. Park, and D. H. Lee, “Transmission-efficient broadcast encryption scheme with personalized messages,” IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E96-A, no. 4, pp. 796–806, 2013. View at Publisher · View at Google Scholar · View at Scopus
  13. M. Zhang, B. Yang, Z. Chen, and T. Takagi, “Efficient and adaptively secure broadcast encryption systems,” Security and Communication Networks, vol. 6, no. 8, pp. 1044–1052, 2013. View at Publisher · View at Google Scholar · View at Scopus
  14. J. Kim, W. Susilo, M. H. Au, and J. Seberry, “Adaptively secure identity-based broadcast encryption with a constant-sized ciphertext,” IEEE Transactions on Information Forensics and Security, vol. 10, no. 3, pp. 679–693, 2015. View at Publisher · View at Google Scholar · View at Scopus
  15. S. H. Islam, M. K. Khan, and A. M. Al-Khouri, “Anonymous and provably secure certificateless multireceiver encryption without bilinear pairing,” Security and Communication Networks, vol. 8, no. 13, pp. 2214–2231, 2015. View at Publisher · View at Google Scholar · View at Scopus
  16. H. Wee, “Déjà Q: Encoreé un petit IBE,” in Theory of Cryptography—13th International Conference, TCC 2016-A, E. Kushilevitz and T. Malkin, Eds., vol. 9563 of Lecture Notes in Computer Science, pp. 237–258, Springer, Berlin, Germany, 2016. View at Publisher · View at Google Scholar
  17. M. Bellare, A. Boldyreva, and S. Micali, “Public-key encryption in a multi-user setting: security proofs and improvements,” in Advances in Cryptology—(EUROCRYPT '2000), B. Preneel, Ed., vol. 1807 of Lecture Notes in Computer Science, pp. 259–274, Springer, Berlin, Germany, 2000. View at Publisher · View at Google Scholar
  18. D. Hofheinz and T. Jager, “Tightly secure signatures and public-key encryption,” Designs, Codes and Cryptography. An International Journal, vol. 80, no. 1, pp. 29–61, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. D. Hofheinz, J. Koch, and C. Striecks, “Identity-based encryption with (almost) tight security in the multi-instance, multi-ciphertext setting,” in Public-key cryptography—(PKC '15), J. Katz, Ed., vol. 9020 of Lecture Notes in Computer Science, pp. 799–822, Springer, Berlin, Germany, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  20. J. Chen and H. Wee, “Fully, (almost) tightly secure IBE and dual system groups,” in Advances in Cryptology—(CRYPTO '13), R. Canetti and J. A. Garay, Eds., vol. 8043 of Lecture Notes in Computer Science, pp. 435–460, Springer, Berlin, Germany, 2013. View at Publisher · View at Google Scholar · View at MathSciNet