Institutional Repository
| an efficient certificateless aggregate signature with constant pairing computations | |
| Xiong Hu; Guan Zhi; Chen Zhong; Li Fagen | |
| 2013 | |
| Source | INFORMATION SCIENCES
 |
| ISSN | 0020-0255 |
| Volume | 219Pages:225-235 |
| English Abstract | An aggregate signature scheme enables an algorithm to aggregate n signatures of n distinct messages from n users into a single short signature. This primitive is useful in resource-constrained environment since they allow bandwidth and computational savings. Recently, in order to eliminate the use of certificates in certified public key cryptography and the key-escrow problem in identity-based cryptography, the notion of certificateless public key cryptography was introduced. In this paper, we present an efficient certificateless aggregate signature scheme with constant pairing computations. The security of the proposed scheme can be proved to be equivalent to the standard computational Diffie-Hellman problem in the random oracle with a tight reduction. Furthermore, our scheme does not require synchronization for aggregating randomness, which makes it more suitable for ad hoc networks. (C) 2012 Elsevier Inc. All rights reserved.; An aggregate signature scheme enables an algorithm to aggregate n signatures of n distinct messages from n users into a single short signature. This primitive is useful in resource-constrained environment since they allow bandwidth and computational savings. Recently, in order to eliminate the use of certificates in certified public key cryptography and the key-escrow problem in identity-based cryptography, the notion of certificateless public key cryptography was introduced. In this paper, we present an efficient certificateless aggregate signature scheme with constant pairing computations. The security of the proposed scheme can be proved to be equivalent to the standard computational Diffie-Hellman problem in the random oracle with a tight reduction. Furthermore, our scheme does not require synchronization for aggregating randomness, which makes it more suitable for ad hoc networks. (C) 2012 Elsevier Inc. All rights reserved. |
| Indexed Type | SCI ; EI |
| Keyword | Message Authentication Certificateless Cryptography Aggregate Signature |
| Department | Xiong Hu; Li Fagen Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 610054 Peoples R China. Xiong Hu; Guan Zhi; Chen Zhong Peking Univ Sch Elect Engn & Comp Sci Beijing 100871 Peoples R China. Xiong Hu; Li Fagen Chinese Acad Sci Inst Software State Key Lab Informat Secur Beijing 100190 Peoples R China. |
| Subject | Computer Science |
| Sponsorship | National Natural Science Foundation of China 61003230; China Postdoctoral Science Foundation 20100480130; Chongqing Key Lab of Computer Network and Communication Technology CY-CNCL-2010-01; State Key Laboratory of Information Security 01-02-4 |
| Language | 英语 |
| WOS ID | WOS:000310825500013 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15042 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Xiong Hu,Guan Zhi,Chen Zhong,et al. an efficient certificateless aggregate signature with constant pairing computations[J]. INFORMATION SCIENCES,2013,219:225-235. |
| APA | Xiong Hu,Guan Zhi,Chen Zhong,&Li Fagen.(2013).an efficient certificateless aggregate signature with constant pairing computations.INFORMATION SCIENCES,219,225-235. |
| MLA | Xiong Hu,et al."an efficient certificateless aggregate signature with constant pairing computations".INFORMATION SCIENCES 219(2013):225-235. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment