首页 | 本学科首页   官方微博 | 高级检索  
     

新的基于身份的代理重签密
引用本文:王会歌,王彩芬,曹浩,刘绍辉.新的基于身份的代理重签密[J].计算机应用,2011,31(11):2986-2989.
作者姓名:王会歌  王彩芬  曹浩  刘绍辉
作者单位:1. 安徽科技学院 理学院,安徽 凤阳 2331002. 西北师范大学 数学与信息科学学院,兰州 7300703. 哈尔滨工业大学 计算机科学与技术学院,哈尔滨 150001
基金项目:教育部科学技术研究重点项目,国家自然科学基金,教育部新教师基金,安徽省教育厅自然科学项目,安徽科技学院安徽省自然科学基金预研项目
摘    要:基于Chandrasekar等人提出的代理重加密签密方案(CHANDRASEKAR S, AMBIKA K, RANGAN P C. Signcryption with proxy re-encryption . http://eprint.iacr.org/2008/276),提出了一个新的基于身份代理重签密方案。该方案利用一个半可信代理人将一个基于身份的签密透明地转换为了另一个基于身份的签密,实现了签密的完全可转换:即同时实现了签密中保密功能和验证功能的转换,且签密的验证不需要明文信息的直接参与。在随机预言机模型下,基于计算性Bilinear Diffie-Hellman问题,证明了方案是IND-CCA2安全的。经效率和功能分析,结果表明该方案解决了Chandrasekar方案中验证功能未能转换的问题和签密的验证需要明文参与的问题。

关 键 词:基于身份密码体制    签密    代理重签密    随机预言机模型    双线性映射
收稿时间:2011-04-08
修稿时间:2011-06-24

New identity-based proxy re-signcryption
WANG Hui-ge,WANG Cai-fen,CAO Hao,LIU Shao-hui.New identity-based proxy re-signcryption[J].journal of Computer Applications,2011,31(11):2986-2989.
Authors:WANG Hui-ge  WANG Cai-fen  CAO Hao  LIU Shao-hui
Affiliation:1. College of Science, Anhui Science and Technology University, Fengyang Anhui 233100, China2. College of Mathematics and Information Science, Northwest Normal University, Lanzhou Gansu 730070, China3. School of Computer Science and Technology, Harbin Institute of Technology, Harbin Heilongjiang 150001, China
Abstract:A new identity-based proxy re-signcryption scheme was put forward on the basis of the signcryption with proxy re-encryption proposed by Chandrasekar S (CHANDRASEKAR S, AMBIKA K, RANGAN P C. Signcryption with proxy re-encryption . http://eprint.iacr.org/2008/276). The new scheme achieves a transparent conversion from one identity-based signcryption to another identity-based signcryption by using a semi-trusted proxy. And it realizes the complete conversion of signcryption, that is, it concurrently achieves the conversion of both confidentiality and verification. In the same time, it realizes the full public verifiability of the signcryption without the direct participation of the plaintext. Based on the Computation Bilinear Diffie-Hellman (CBDH) problem, it is proved to be IND-CCA2 secure in the Random Oracle Model (ROM). Through the analysis of its efficiency and function, the scheme resolves the problems of both failing to realize the conversion of the verification and the verifiability of signcryption needing the participation of plaintext in the scheme advanced by Chandrasekar S.
Keywords:identity-based cryptosystem                                                                                                                          signcryption                                                                                                                          proxy re-signcryption                                                                                                                          Random Oracle Model (ROM)                                                                                                                          bilinear map
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号