New Provably Secure Signature Scheme

Acta Scientiarum Naturalium Universitatis Pekinensis

Previous Articles Next Articles

New Provably Secure Signature Scheme

HAN Song¹, WANG Jie¹, GAO Li²

Department of Mathematics, Peking University, Beijing, 100871；²College of Applied Sciences, Beijing University of Technology, Beijing, 100022

Received:2002-09-09 Online:2003-09-20 Published:2003-09-20

一种新的可证明安全的数字签名方案

韩嵩¹, 王杰¹, 高立²

¹北京大学数学科学学院，北京，100871；²北京工业大学数理学院，北京，100022

Abstract

Abstract: A new mathematical problem-Decisional Relevant-RSA problem was introduced to construct a new signature scheme. It is simple and secure against adaptive chosen-message attacks. In addition its security proof is in the standard model.

Key words: RSA-problem, decisional relevant-RSA problem, secure signatures

摘要： 利用了一个密码学上新的数学问题，构造了一个新的数字签名方案，并且证明了该方案是安全的。

关键词: RSA问题, 决定性相关的RSA问题, 安全的签名

CLC Number:

O157.2

HAN Song,WANG Jie,GAO Li. New Provably Secure Signature Scheme[J]. Acta Scientiarum Naturalium Universitatis Pekinensis.

韩嵩, 王杰, 高立. 一种新的可证明安全的数字签名方案[J]. 北京大学学报（自然科学版）.

[1]	XIONG Guohua. Difference Sets with Classical Parameters and Bent Functions [J]. Acta Scientiarum Naturalium Universitatis Pekinensis, 2003, 39(1): 14-16.
[2]	XIONG Guohua. A New Way of Constructing Hadamard Difference Sets [J]. Acta Scientiarum Naturalium Universitatis Pekinensis, 2002, 38(3): 315-317.

New Provably Secure Signature Scheme

一种新的可证明安全的数字签名方案

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 2

Recommended Articles

Metrics