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

短公钥的可证明安全基于身份数字签名算法
引用本文:王之怡,刘铁,康立,谢静,雷刚.短公钥的可证明安全基于身份数字签名算法[J].计算机科学,2011,38(3):136-139.
作者姓名:王之怡  刘铁  康立  谢静  雷刚
作者单位:1. 西南财经大学经济信息工程学院,成都,610074
2. IBM中国研究院,北京,100193
基金项目:本文受国家自然科学基金青年项目“电子商务协议交易相关安全属性的形式化验证”(60903201)资助。
摘    要:在标准模型下的适应性选择消息不可伪造攻击(UCMA)安全模型中,Paterson和Schuldt(PS)构造了双线性映射群中基于计算DH难题的基于身份数字签名算法。PS算法直接利用两组独立的Watcrs身份处理函数去分别处理用户身份和签名消息,因此算法中公钥参数数量很大。新算法提出一种改进的参数选择方法以大大减少公钥参数数量,且能在标准模型下得到安全证明。

关 键 词:基于身份的数字签名,标准模型,短的公钥参数

Short Public Key Provable Security Identity-based Signature Scheme
WANG Zhi-yi,LIU Tie,KANG Li,XIE Jing,LEI Gang.Short Public Key Provable Security Identity-based Signature Scheme[J].Computer Science,2011,38(3):136-139.
Authors:WANG Zhi-yi  LIU Tie  KANG Li  XIE Jing  LEI Gang
Affiliation:(School of Economics Information Engineering,Southwestern University of Finance & Economics,Chengdu 610074,China) (IBM Research-China,Beijing 100193,China)
Abstract:In the standard model an UCMA security IBS scheme was proposed by Peterson and Schuldt, which was based on computational Diffie-Hellman problem in bilinear pairing group. Two independent Waters' identity hash functions were directly employed to treat the user's identity and the signature message, respectively, so PS's IBS scheme had a great number of public keys. An improved parameters selecting method was proposed in the new scheme, which only needs a small number of public keys,and the new scheme can be proved security in the standard model.
Keywords:Identity-based signature  Standard model  Short public key
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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