热门
an efficient certificateless aggregate signature with constant pairing computations
文献类型：期刊论文
| 作者 | Xiong Hu ; Guan Zhi ; Chen Zhong ; Li Fagen |
| 刊名 | INFORMATION SCIENCES
 |
| 出版日期 | 2013 |
| 卷号 | 219页码:225-235 |
| 关键词 | Message authentication Certificateless cryptography Aggregate signature |
| ISSN号 | 0020-0255 |
| 中文摘要 | 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. |
| 学科主题 | Computer Science |
| 收录类别 | SCI ; EI |
| 资助信息 | 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 |
| 语种 | 英语 |
| WOS记录号 | WOS:000310825500013 |
| 公开日期 | 2013-09-17 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/15042]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 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. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。