基于Cocks身份密码体制的高效签密方案

彭长根; 张小玉; 丁红发; 杨善慧

doi:10.11959/j.issn.1000-436X.2020214

您当前的位置：

首页 >

文章列表页 >

基于Cocks身份密码体制的高效签密方案

学术论文 | 更新时间：2024-06-05

- 基于Cocks身份密码体制的高效签密方案
- Efficient signcryption scheme based on Cocks’ identity cryptosystem
- 通信学报 2020年41卷第12期页码：128-138
- 作者机构：
  
  1. 贵州大学数学与统计学院公共大数据国家重点实验室，贵州贵阳 550025
  2. 贵州大学计算机科学与技术学院，贵州贵阳 550025
  3. 贵州大学密码学与数据安全研究所，贵州贵阳 550025
  4. 贵州财经大学信息学院，贵州贵阳 550025
- 作者简介：
  
  [ "彭长根（1963- ），男，贵州锦屏人，博士，贵州大学教授、博士生导师，主要研究方向为隐私保护、密码学和大数据安全。 " ]
  [ "张小玉（1995- ），女，四川苍溪人，贵州大学硕士生，主要研究方向为密码学。" ]
  [ "丁红发（1988- ），男，河南南阳人，贵州大学在站博士后，主要研究方向为隐私保护和大数据安全。" ]
  [ "杨善慧（1994- ），女，贵州遵义人，贵州大学硕士生，主要研究方向为密码学。" ]
- 基金信息：
  
  国家自然科学基金资助项目(U1836205);国家自然科学基金资助项目(61662009);国家自然科学基金资助项目(61772008);贵州省科技计划基金资助项目([2018]3001);贵州省科技计划基金资助项目([2018]3007);贵州省科技计划基金资助项目([2017]3002);贵州省科技计划基金资助项目([2019]2004);贵州省科技计划基金资助项目([2018]2162);贵州省科技计划基金资助项目([2018]2159);贵州省科技计划基金资助项目([2020]5017);贵州省科技计划基金资助项目([2020]1Y265);贵州省高等学校创新人才团队基金资助项目([2013]09);“十三五”国家密码发展基金资助项目(MMJJ20170129)
- DOI：10.11959/j.issn.1000-436X.2020214
  中图分类号： TP30
- 网络首发：2020-12，
  
  纸质出版：2020-12-25
- 稿件说明：
移动端阅览
彭长根, 张小玉, 丁红发, 等. 基于Cocks身份密码体制的高效签密方案[J]. 通信学报, 2020,41(12):128-138.

Changgen PENG, Xiaoyu ZHANG, Hongfa DING, et al. Efficient signcryption scheme based on Cocks’ identity cryptosystem[J]. Journal on Communications, 2020, 41(12): 128-138.
彭长根, 张小玉, 丁红发, 等. 基于Cocks身份密码体制的高效签密方案[J]. 通信学报, 2020,41(12):128-138. DOI： 10.11959/j.issn.1000-436X.2020214.

Changgen PENG, Xiaoyu ZHANG, Hongfa DING, et al. Efficient signcryption scheme based on Cocks’ identity cryptosystem[J]. Journal on Communications, 2020, 41(12): 128-138. DOI： 10.11959/j.issn.1000-436X.2020214.

摘要

现有的基于身份签密方案多是基于双（多）线性对构造的，针对其复杂的对运算导致签密效率低下的问题，基于Cocks的身份密码体制提出了一种新的高效签密方案。首先，形式化所提方案的安全模型，给出了保密性和不可伪造性的定义；然后，利用二次剩余难解问题实现了所提方案的具体构造，进一步结合雅可比符号运算巧妙地在一个逻辑步骤内实现了签密算法设计；最后，在随机预言模型下，给出了所提方案满足保密性和不可伪造性的安全性证明。效率分析表明，相对于已有的基于身份签密的方案，所提方案较大幅度地提升了运算效率，同时具备基于身份密码的良好特性。

Abstract

Most of the existing identity-based signcryption schemes are based on bilinear or multilinear pairing operations construction.To solve the problem of low efficiency caused by complex pair operation

a new efficient signcryption scheme based on the identity cryptosystem of Cocks was proposed.Firstly

the security model of the proposed scheme was formalized

and the definition of confidentiality and unforgeability was given.Secondly

the quadratic residue problem was used to realize the concrete construction of the proposed scheme

and the signature algorithm was designed in a logical step by combining Jacobi symbol operation.Finally

the security proofed that the scheme satisfied the confidentiality and unforgeability was given under the random prediction model.The efficiency analysis shows that compared with the existing identity-based signcryption scheme

the proposed scheme greatly improves the computing efficiency and has good characteristics of identity-based cryptosystem.

关键词

Keywords

references

ZHENG Y , IMAI H . How to construct efficient signcryption schemes on elliptic curves [J ] . Information Processing Letters , 1998 , 68 ( 5 ): 227 - 233 .

MALON-LEE J . Identity-based signcryption [J ] . IACR Cryptology ePrint Archive , 2002 : 98 .

冯登国 , 徐静 , 兰晓 . 5G 移动通信网络安全研究 [J ] . 软件学报 , 2018 , 29 ( 6 ): 1813 - 1825 .

FENG D G , XU J , LAN X . Study on 5G mobile communication network security [J ] . Journal of Software , 2018 , 29 ( 6 ): 1813 - 1825 .

ZHENG Y , . Digital signcryption or how to achieve cost (signature ＆encryption) << cost (signature) + cost (encryption) [C ] // International Cryptology Conference . Berlin:Springer , 1997 : 165 - 179 .

SHIN J , LEE K , SHIM K , et al . New DSA-verifiable signcryption schemes [C ] // International Conference on Information Security and Cryptology . Berlin:Springer , 2002 : 35 - 47 .

YU H , YANG B . Pairing-free and secure certificateless signcryption scheme [J ] . The Computer Journal , 2017 , 60 ( 8 ): 1187 - 1196 .

REZAEIBAGHA F , MU Y , ZHANG S , et al . Provably secure (broadcast) homomorphic signcryption [J ] . International Journal of Foundations of Computer Science , 2019 , 30 ( 4 ): 511 - 529 .

LIBERT B , QUISQUATER J . A new identity based signcryption scheme from pairings [C ] // IEEE Information Theory Workshop . Piscataway:IEEE Press , 2003 : 155 - 158 .

WANG H , LIU Z , LIU Z , et al . Identity-based aggregate signcryption in the standard model from multilinear maps [J ] . Frontiers of Computer Science in China , 2016 , 10 ( 4 ): 741 - 754 .

REDDI S , BORRA S . Identity-based signcryption groupkey agreement protocol using bilinear pairing [J ] . Informatica (Iithuanian Academy of Sciences) , 2017 , 41 ( 1 ): 31 - 37 .

ZHOU C , ZHANG Y , WANG L . A provable secure identity-based generalized proxy signcryption scheme [J ] . International Journal of Network Security , 2018 , 20 ( 6 ): 1183 - 1193 .

ZHOU Y , YANG B , ZHANG W , et al . Provably secure and efficient leakage-resilient certificateless signcryption scheme without bilinear pairing [J ] . Discrete Applied Mathematics , 2016 , 204 : 185 - 202 .

ZHOU C , ZHAO Z , ZHOU W , et al . Certificateless key-insulated generalized signcryption scheme without bilinear pairings [J ] . Security and Communication Networks , 2017 , 2017 : 1 - 17 .

ISLAM S K , KHAN M K , ALKHOURI A M , et al . Anonymous and provably secure certificateless multireceiver encryption without bilinear pairing [J ] . Security and Communication Networks , 2015 , 8 ( 13 ): 2214 - 2231 .

KARATI A , BISWAS G P . A practical identity based signcryption scheme from bilinear pairing [C ] // International Conference on Advances in Computing . Piscataway:IEEE Press , 2016 : 832 - 836 .

GUO H , DENG L . Certificateless ring signcryption scheme from pairings [J ] . International Journal of Network Security , 2020 , 22 ( 1 ): 102 - 111 .

HE D , WANG H , WANG L , et al . Efficient certificateless anonymous multi-receiver encryption scheme for mobile devices [J ] . Soft Computing , 2017 , 21 ( 22 ): 6801 - 6810 .

COCKS C , . An identity based encryption scheme based on quadratic residues [C ] // IMA International Conference on Cryptography and Coding . Berlin:Springer , 2001 : 360 - 363 .

CLEAR M , HUGHES A , TEWARI H , et al . Homomorphic encryption with access policies:characterization and new constructions [C ] // International Conference on Cryptology in Africa . Berlin:Springer , 2013 : 61 - 87 .

浏览量

757

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

公平可验证的多用户同态代理重加密方案

后量子基于验证元的三方口令认证密钥交换协议

基于无证书签密的车联社会网络安全通信机制

基于RLWE的可证明安全无陷门签密方案

基于编码的多接收方广义签密方案