Email this article New Identity-based Broadcast Encryption with Constant Ciphertexts in the Standard Model
Abstract
How to build an efficient identity-based broadcast system with short ciphertexts is a main challenge at present. The existing constructions with constant size ciphertexts in the standard model are based on the non-standard cryptography assumption. In addition, these constructions cannot solve the trade-off between the private keys and ciphertexts. Hence these methods lead to schemes that are somewhat inefficient in the real world. To overcome these shortcomings, two schemes are introduced at first. The initial construction has constant size ciphertexts and O(|S|)-size private keys(where S
denotes the set of receivers). Then the second scheme achieves constant size ciphertexts and constant size private keys which solve the trade-off between the private keys and ciphertexts. Furthermore, their security rests on the hardness of the decision Diffie-Hellman Exponent problem instead of other strong assumptions. However, both schemes only achieve a weak security-selective-identity security. Finally,
two helpful constructions are proposed. They are constructed in the standard model and achieve full security which is stronger than selective-identity security.
Keywords
References
A. Fiat and M. Naor. “Broadcast encryption”. In: Douglas R. Stinson, eds. Crypto. Lecture Notes in Computer Science, volume 773, Berlin: Springer-Verlag, 1993, pp. 480-491.
Y. Dodis and N. Fazio. “Public key broadcast encryption for stateless receivers”. In: Feigenbaum J., eds. ACM Workshop on Digital Rights Management, Lecture Notes in Computer Science, volume 2696, Berlin: Springer-Verlag, 2002, pp. 61-80.
Y. Dodis and N. Fazio. “Public key broadcast encryption secure against adaptive chosen ciphertext attack”. In: Desmedt Y., eds. Public Key Cryptography, Lecture Notes in Computer Science, volume 2567, Berlin: Springer-Verlag, 2003, pp. 100-115.
D. Boneh, C. Gentry and B. Waters, “Collusion resistant broadcast encryption with short ciphertexts and private keys”. In: Shoup V., eds. CRYPTO, Lecture Notes in Computer Science, volume 3621,Berlin: Springer-Verlag, 2005, pp. 258-275.
C. Delerablèe, P.Paillier and D. Pointcheval. “Fully collusion secure dynamic broadcast encryption with constant-size ciphertexts or decryption keys”. In: Tsuyoshi Takagi,et al., eds. Pairing-Based Cryptography, Lecture Notes in Computer Science, volume 4575, Berlin: Springer-Verlag, 2007, pp. 39-59.
A. Shamir. “Identity-based Cryptosystems and Signature Schemes”. In: Wagner D., eds., Crypto, Lecture Notes in Computer Science, volume 196, Berlin: Springer-Verlag, 1984, pp. 47-53.
D. Boneh, M. Franklin. “Identity Based Encryption from the Weil Pairing”. In: Joe Kilian,eds. CRYPTO, Lecture Notes in Computer Science, volume 2139, Berlin: Springer-Verlag, 2001, pp. 213-229.
D. Boneh, X. Boyen. “Efficient Selective-ID Identity Based Encryption without Random Oracles”. In: Christian Cachin,et al., eds. Eurocrypt, Lecture Notes in Computer Science, volume 3027, Berlin:Springer-Verlag, 2004, pp. 223-238.
B. Waters. “Efficient identity-based encryption without random oracles”. In R. Cramer, editor, Proceedings of Eurocrypt 2005, LNCS 3494, Berlin: Springer-Verlag, 2005.
D. Boneh, X. Boyen, and E. J. Goh. “Hierarchical Identity Based Encryption with Constant Size Ciphertext”. In: Cramer R.,eds. Eurocrypt, Lecture Notes in Computer Science, volume 3494, Berlin: Springer-Verlag, 2005, pp. 440-456.(Full version available on Cryptology ePrint Archive Report 2005/015)
S. Chatterjee and P. Sarkar. “New Constructions of Constant Size Ciphertext HIBE Without Random Oracle”. In M.S. Rhee and B. Lee (Eds.): ICISC, Lecture Notes in Computer Science, volume 4296, pp. 310–327, Berlin: Springer-Verlag, 2006.
C. Gentry. “Practical identity-based encryption without random oracles”. In:Serge Vaudenay,eds. EUROCRYPT, Lecture Notes in Computer Science, volume 4004, 2006, pp. 445-464.
Y. Mu, W. Susilo and Y. Lin et al. “Identity-Based Authenticated Broadcast Encryption and Distributed Authenticated Encryption”. In: Michael J. Maher, eds. ASIAN 2004, Lecture Notes in Computer Science, volume 3321, Berlin: Springer-Verlag, 2004, pp. 169- 181.
C. Delerablée. “Identity-Based Broadcast Encryption with Constant Size Ciphertexts and Private Keys”. In: Kaoru Kurosawa, eds. ASIACRYPT, Lecture Notes in Computer Science, volume 4833,Berlin: Springer-Verlag, 2007, pp. 200-215.
X. Du, Y. Wang and J. Ge. et al. “An ID-Based Broadcast Encryption Scheme for Key Distribution”. IEEE TRANSACTIONS ON BROADCASTING. Vol.51, Issue:2, 2005, pp. 264-266 .
http://dx.doi.org/10.1109/TBC.2005.847600
Y. L. Ren, D.W. Gu. “Fully CCA2 secure identity based broadcast encryption without random oracles”. Information Processing Letters. Vol. 109, 2009, pp. 527–533.
http://dx.doi.org/10.1016/j.ipl.2009.01.017
C. Gentry, B. Waters. “Adaptive Security in Broadcast Encryption Systems”. EUROCRYPT 2009, LNCS 5479, 2009, pp. 171–188.
B. Waters. Dual system encryption: realizing fully secure ibe and hibe under simple assumptions. In Advances in Cryptology - CRYPTO 2009, volume 5677 of LNCS, pages 619-636, Springer, 2009.(The full paper appeared Cryptology ePrint Archive Report 2009/385) A. Lewko and B. Waters. New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts. TCC 2010, LNCS 5978, pp. 455–479, Springer, 2010.
Full Text: PDF