收稿日期: 2016-10-02
修回日期: 2016-12-05
网络出版日期: 2017-09-30
基金资助
国家自然科学基金（No.61272492，No.61572521）资助
Low Overhead Broadcast Encryption with Personalized Message Based on Multilinear Maps
Received date: 2016-10-02
Revised date: 2016-12-05
Online published: 2017-09-30
吕立群, 杨晓元, 汪晶晶, 程璐 . 基于多线性映射的低开销BEPM方案[J]. 应用科学学报, 2017 , 35(5) : 626 -633 . DOI: 10.3969/j.issn.0255-8297.2017.05.008
Current schemes of broadcast encryption with personalized message (BEPM) require exceedingly large parameters. To deal with the problem, a low-overhead BEPM scheme is constructed by comprehensively using broadcast encryption, key encapsulation, and characteristics of multilinear maps. The ciphertext and private key size of each user are constant, and the public key size is only in the order of O(lb N). The proposed scheme is also fully collusion resistant and can achieve chosen plaintext completely in the standard model. The scheme is safe and effective, and widely applicable in many felds such as pay TV.
Key words： broadcast encryption; multilinear map; low-overhead
[1] Fiat A, Naor M. Broadcast encryption[C]//Annual International Cryptology Conference. Berlin Heidelberg:Springer, 1993:480-491.
[2] Zou X, Xiang J. Dynamic broadcast encryption scheme with revoking user[J]. Wuhan University Journal of Natural Sciences, 2013, 18(6):499-503.
[3] Ohtake G, Hanaoka G, Ogawa K. Efcient broadcast encryption with personalized messages[C]//International Conference on Provable Security. Berlin Heidelberg:Springer, 2010:214-228.
[4] Yoshimura T. Conditional access system for digital broadcasting in Japan[J]. Proceedings of the IEEE, 2006, 94(1):318-322.
[5] Dodis Y, Fazio N. Public key broadcast encryption for stateless receivers[C]//ACM Workshop on Digital Rights Management. Berlin Heidelberg:Springer, 2002:61-80.
[6] Dodis Y, Fazio N. Public key trace and revoke scheme secure against adaptive chosen ciphertext attack[J]. Lecture Notes in Computer Science, 2003, 2567:100-115.
[7] Goodrich M T, Sun J Z, Tamassia R. Efcient tree-based revocation in groups of low-state devices[C]//Annual International Cryptology Conference. Berlin Heidelberg:Springer, 2004:511-527.
[8] Halevy D, Shamir A. The LSD broadcast encryption scheme[J]. Lecture Notes in Computer Science, 2002, 2442:47-60.
[9] Boneh D, Gentry C, Waters B. Collusion resistant broadcast encryption with short ciphertexts and private keys[C]//Annual International Cryptology Conference. Berlin Heidelberg:Springer, 2005:258-275.
[10] Boneh D, Waters B, Zhandry M. Low overhead broadcast encryption from multilinear maps[C]//International Cryptology Conference. Berlin Heidelberg:Springer, 2014:206-223.
[11] Delerablée C. Identity-based broadcast encryption with constant size ciphertexts and private keys[C]//International Conference on the Theory and Application of Cryptology and Information Security. Berlin Heidelberg:Springer, 2007:200-215.
[12] Ren Y, Wang S, Zhang X. Non-interactive dynamic identity-based broadcast encryption without random oracles[C]//International Conference on Information and Communications Security. Berlin Heidelberg:Springer, 2012:479-487.
[13] Park S, Lee K, Lee D H. New constructions of revocable identity-based encryption from multilinear maps[J]. IEEE Transactions on Information Forensics and Security, 2015, 10(8):1564-1577.
[14] Xu K, Liao Y, Qiao L, Liu Z, Yang X. An identity-based (IDB) broadcast encryption scheme with personalized messages (BEPM)[J]. PloS one, 2015, 10(12):e0143975.
/
| 〈 |
|
〉 |
