计算机工程与应用Issue(19)：74-77,164,5.DOI:10.3778/j.issn.1002-8331.1211-0129
可证明安全的有向传递签名方案
Provably secure directed transitive signature
摘要
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.关键词
无向传递签名/有向传递签名/随机预言模型/离散对数困难问题Key words
undirected transitive signature/directed transitive signature/random oracle model/discrete logarithm difficulty problem分类
信息技术与安全科学引用本文复制引用
张亦辰,蒋勇,李继国..可证明安全的有向传递签名方案[J].计算机工程与应用,2014,(19):74-77,164,5.基金项目
国家自然科学基金（No.61272542，No.61103183，No.61103184）；中国博士后基金（No.20100471373）；中央高校基本科研业务费专项资金（No.2009B21114，No.2010B07114）；江苏省“六大人才高峰”项目（No.2009182）；河海大学新世纪优秀人才计划。 （）
