| Identity-based signature scheme based on quadratic residues |
| |
| 作者单位： | CHAI ZhenChuan（Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China） ;CAO ZhenFu（Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China） ;DONG XiaoLei（Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China） ; |
| |
| 基金项目： | 国家自然科学基金;国家高技术研究发展计划(863计划) |
| |
| 摘 要： | Identity-based(ID-based)cryptography has drawn great concerns in recent years,and most of ID-based schemes are constructed from bilinear parings.Therefore,ID-based scheme without pairing is of great interest in the field of cryptography.Up to now, there still remains a challenge to construct ID-based signature scheme from quadratic residues.Thus,we aim to meet this challenge by proposing a concrete scheme.In this paper,we first introduce the technique of how to calculate a 2lth root of a quadratic residue,and then give a concrete ID-based signature scheme using such technique. We also prove that our scheme is chosen message and ID secure in the random oracle model,assuming the hardness of factoring.
|
| 收稿时间： | 2006-07-08 |
| 修稿时间： | 2007-03-13 |
Identity-based signature scheme based on quadratic residues |
| |
| Chai ZhenChuan,Cao ZhenFu,Dong XiaoLei. Identity-based signature scheme based on quadratic residues[J]. Science in China(Information Sciences), 2007, 50(3): 373-380. DOI: 10.1007/s11432-007-0038-1 |
| |
| Authors: | Chai ZhenChuan Cao ZhenFu Dong XiaoLei |
| |
| Affiliation: | Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China |
| |
| Abstract: | Identity-based(ID-based)cryptography has drawn great concerns in recent years,and most of ID-based schemes are constructed from bilinear parings.Therefore,ID-based scheme without pairing is of great interest in the field of cryptography.Up to now, there still remains a challenge to construct ID-based signature scheme from quadratic residues.Thus,we aim to meet this challenge by proposing a concrete scheme.In this paper,we first introduce the technique of how to calculate a 2lth root of a quadratic residue,and then give a concrete ID-based signature scheme using such technique. We also prove that our scheme is chosen message and ID secure in the random oracle model,assuming the hardness of factoring. |
| |
| Keywords: | ID-based signature quadratic residue factoring random oracle proven security |
| 本文献已被 万方数据 SpringerLink 等数据库收录！ |
|
