【作者】 马春光； 武朋； 杨义先； 顾国昌；

【Author】 Ma Chunguang, Wu Peng, Yang Yixian, Gu Guochangeng (College of Computer Science and Technology, Harbin Engineering University, Harbin 150001) (Information Security Center, Beijing Univ. of Posts and Telecom., Beijing 100876)

【机构】 哈尔滨工程大学计算机科学与技术学院； 北京邮电大学信息安全中心；

【摘要】 可传递签名是近年密码学中的一个新概念,它在信息安全、网络安全以及电子商务安全中都有积极的潜在应用。在不损失原有方案安全性的前提下,本文给出了一种将有状态可传递签名转化为无状态可传送签名的新方法。使用此方法,分别给出了基于因式分解问题和one-more-RSA逆问题的无状态可传递签名方案。在相应的密码学假设下,借助ROM模型,这两个方案对自适应选择消息攻击是不可伪造的。更多还原

【Abstract】 Transitive signature is a new notion introduced by Micali and Rivest in 2002, which is a useful tool for many potential applications in information security, network security, and e-commerce security. A new practical method is introduced to transform the stateful transitive signature schemes to stateless one without loss the security. As the instances, two concrete stateless transitive signature schemes are presented based on the assumption of the hardness of factoring, one-more-RSA-inversion problem, which are secure against the adaptive chosen-message attacks in random oracle model.更多还原