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

可证明安全的有向传递签名方案
引用本文:张亦辰,蒋勇,李继国.可证明安全的有向传递签名方案[J].计算机工程与应用,2014(19):74-77,164.
作者姓名:张亦辰  蒋勇  李继国
作者单位:河海大学 计算机与信息学院,南京,211000
基金项目:国家自然科学基金(No.61272542,No.61103183,No.61103184);中国博士后基金(No.20100471373);中央高校基本科研业务费专项资金(No.2009B21114,No.2010B07114);江苏省“六大人才高峰”项目(No.2009182);河海大学新世纪优秀人才计划。
摘    要:2002年,Micali和Rivest首次提出了传递签名的概念,构造了第一个无向传递签名方案,并把构造有向传递签名方案作为公开问题。为了解决上述问题,提出了一个方向状态函数的概念,用于表示有向图节点之间的方向关系,使传递签名的明文空间扩展到任意的复杂有向图。结合节点签名范例,利用节点秘密值,构造了一个基于离散对数困难问题的有向传递签名方案,并在随机预言模型下证明了该方案在自适应选择消息攻击下是安全的。

关 键 词:无向传递签名  有向传递签名  随机预言模型  离散对数困难问题

Provably secure directed transitive signature
ZHANG Yichen,JIANG Yong,LI Jiguo.Provably secure directed transitive signature[J].Computer Engineering and Applications,2014(19):74-77,164.
Authors:ZHANG Yichen  JIANG Yong  LI Jiguo
Affiliation:(College of Computer and Information Engineering, Hohai University, Nanjing 211000, China)
Abstract:In 2002, Micali and Rivest firstly introduced the concept of transitive signature, constructed first undirected transfer signature scheme, and left construction of directed transitive signature scheme as open problems to be solved. In order to solve above problem, this paper presents the concept of direction state function which is used for pointing out the direction relationship between the nodes of the graph that makes transitive signature scheme for complex directed graph.Combined with the node certification paradigm, the paper proposes a directed transitive signature scheme based on discrete logarithm problem by using the secret of the node values. The proposed scheme is proved secure under adaptive chosen message attack in the random oracle model.
Keywords:undirected transitive signature  directed transitive signature  random oracle model  discrete logarithm difficulty problem
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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