一種可證安全的異構(gòu)聚合簽密方案

牛淑芬; 牛靈; 王彩芬; 杜小妮

doi:10.11999/JEIT160829

一種可證安全的異構(gòu)聚合簽密方案

doi: 10.11999/JEIT160829 cstr: 32379.14.JEIT160829

基金項目:

國家自然科學(xué)基金(61562077, 61462077, 61662071)，西北師范大學(xué)青年教師科研提升計劃(NWNU-LKQN-13-12)

計量
- 文章訪問數(shù): 1254
- HTML全文瀏覽量: 187
- PDF下載量: 278
- 被引次數(shù): 0
出版歷程
- 收稿日期: 2016-08-15
- 修回日期: 2017-01-13
- 刊出日期: 2017-05-19

A Provable Aggregate Signcryption for Heterogeneous Systems

Funds:

The National Natural Science Foundation of China (61562077, 61462077, 61662071), The Young Teachers Scientific Research Ability Promotion Program of Northwest Normal University (NWNU-LKQN-13-12)

摘要

摘要: 異構(gòu)簽密可實現(xiàn)不同安全域之間數(shù)據(jù)通信的機密性、認(rèn)證性和不可偽造性。分析現(xiàn)有的異構(gòu)簽密方案，發(fā)現(xiàn)它們僅是針對單個消息而設(shè)計的，計算效率普遍較低，不適合大數(shù)據(jù)環(huán)境下的網(wǎng)絡(luò)通信系統(tǒng)。該文提出一個異構(gòu)的聚合簽密方案，該方案不但可以實現(xiàn)單個消息的簽密驗證，而且可以實現(xiàn)多個消息的聚合驗證，并且驗證需要的雙線性對個數(shù)固定，與所簽密消息的個數(shù)無關(guān)。同時，在隨機預(yù)言模型下，證明了方案的機密性和不可偽造性分別基于q雙線性Diffie-Hellman逆問題和離散對數(shù)問題。數(shù)值結(jié)果表明，該方案與現(xiàn)有方案相比在計算效率和傳輸效率上有著極大的提高。
- 聚合簽密 /
- 異構(gòu)系統(tǒng) /
- 雙線性Diffie-Hellman逆問題 /
- 離散對數(shù)問題
Abstract: Heterogeneous signcryption can ensure the confidentiality, authentication and unforgeability of information transmission of cross cryptograph environment. Through analyzing some existing heterogeneous signcryption schemes, it is found that they can only be applicable to single message of signcryption. In order to improve the efficiency of computation and transmission in heterogeneous systems, a provable multi-message aggregate signcryption is proposed. In the new scheme, the pairing numbers are constant in verification phase, it not depends on the number of signcryption message. Moreover, based on the assumption of q-bilinear Diffie- Hellman inversion issue and Discrete logarithm, in the random oracle model, it is proved that the new scheme satisfies the properties of confidentiality and unforgeability. Furthermore, theoretical analysis and experimental results demonstrate that the computation overhead efficiency of the proposed scheme is better than the existing one.
- Aggregate signcryption /
- Heterogeneous systems /
- q-bilinear Diffie-Hellman inversion problem /
- Discrete logarithm problem

HTML全文

參考文獻(17)

ZHENG Yuliang. Digital signcryption or how to achieve cost(signature encryption)cost(signature) +cost (encryption)[C]. Proceedings of the Cryptology-CRYPTO, 1997, California, USA, 1997: 165-179. doi: 10.1007/ BFb0052234.

BAEK J, STEINFELD R, and ZHENG Yuliang. Formal proofs for the security of signcryption[C]. Proceedings of the Cryptology-PKC2002, Paris, France, 2002: 81-98. doi: 10. 1007/3-540-45664-3_6.

PANG Liaojun, GAO Lu, LI Huixian, et al. Anonymous multi-receiver ID-based signcryption scheme[J]. Iet Information Security, 2015, 9(3): 194-201. doi: 10.1049/ iet-ifs.2014.0360.

LI Fagen, ZHANG Hui, and TSUYOSHI T. Efficient signcryption for heterogeneous systems[J]. IEEE Systems Journal, 2013, 7(3): 420-429. doi: 10.1109/JSYST.2012. 2221897.

張雪, 冀會芳, 李光松, 等. 基于身份的跨信任域簽密方案[J]. 計算機科學(xué), 2015, 42(5): 165-168. doi: 10.11896/j.issn.1002- 137X.2015.5.033.

ZHANG Xue, JI Huifang, LI Guangsong, et al. Identity-based signcryption cross autonomous domains[J]. Computer Science, 2015, 42(5): 165-168. doi: 10.11896/j.issn.1002-137X. 2015.5.033.

ZHOU Yanwei, YANG Bo, and ZHANG Wenzheng. Provably secure and efficient leakage-resilient certificateless signcryption scheme without bilinear pairing[J]. Discrete Applied Mathematics, 2016, 204(C): 185-202. doi: 10.1016/ j.dam.2015.10.018.

LI Fagen, HAN Yanan, and JIN Chunhua. Practical signcryption for secure communication of wireless sensor networks[J]. Wireless Personal Communications, 2016, 89(4): 1391-1412. doi: 10.1007/s11277-016-3327-4.

SUN Yinxia and LI Hui. Efficient signcryption between TPKC and IDPKC and its multi-receiver construction[J]. Sciece China Information Sciences, 2010, 53(3): 557-566. doi: 10.1007/s11432-010-0061-5.

HUANG Qiong, WONG D S, and YANG Guomin. Heterogeneous signcryption with key privacy[J]. Computer Journal, 2011, 54(4): 525-536. doi: 10.1093/comjnl/bxq095.

張玉磊, 王歡, 李臣意, 等. 可證安全的緊致無證書聚合簽密方案[J]. 電子與信息學(xué)報, 2015, 37(12): 2838-2844. doi: 10.11999/JEIT150407.

ZHANG Yulei, WANG Huan, LI Chenyi, et al. Provable secure and compact certificateless aggregate signcryption scheme[J]. Journal of Electronics Information Technology, 2015, 37(12): 2838-2844. doi: 10.11999/JEIT150407.

WANG Hao, LIU Zhen, LIU Zhe, et al. Identity-based aggregate signcryption in the standard model from multilinear maps[J]. Frontiers of Computer Science, 2016, 10(4): 741-754. doi: 10.1007/s11704-015-5138-2.

HAN Yiliang and CHEN Fei. The multilinear maps based certificateless aggregate signcryption scheme[C]. IEEE International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, Xian, China, 2015: 92-99. doi: 10.1109/CyberC.2015.93.

ESLAMI Z and PAKNIAT N. Certificateless aggregate signcryption[J]. Journal of King Saud University-Computer and Information Sciences, 2014, 26(3): 276-286. doi: 10. 1016/j.jksuci.2014.03.006.

CHEN Juqin and REN Xiaoxi. A privacy protection scheme based on certificateless aggregate signcryption and masking random number in smart grid[C]. International Conference on Mechanical Materials and Manufacturing Engineering, Wuhan, China, 2016: 10-13. doi: 10.2991/mmme-16.2016.3.

DAVID P and JACQUES S. Security arguments for digital signatures and blind signatures[J]. Journal of Cryptology, 2000, 13(3): 361-396. doi: 10.1007=s001450010003.

相關(guān)文章

施引文獻

資源附件(0)

訪問統(tǒng)計