A new certificateless aggregate signature scheme

被引:170
作者
Zhang, Lei [1 ,2 ]
Zhang, Futai [1 ]
机构
[1] Nanjing Normal Univ, Coll Math & Comp Sci, Nanjing 210097, Jiangsu, Peoples R China
[2] Univ Rovira & Virgili, Dept Comp Engn & Math, E-43007 Tarragona, Catalonia, Spain
关键词
Certificateless cryptography; Aggregate signature; Certificateless aggregate signature; Computational Diffie-Hellman problem; Random oracle model; FAIR EXCHANGE PROTOCOL; GENERIC CONSTRUCTION; PAIRINGS; SECURITY;
D O I
10.1016/j.comcom.2008.12.042
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Aggregate signatures are useful in special areas where the signatures on many different messages generated by many different users need to be compressed. In this paper, we study aggregate signatures in certificateless public key settings. We first present the notion and security model of certificateless aggregate signature schemes. Then we give an efficient certificateless aggregate signature scheme. Our scheme is existentially unforgeable under adaptive chosen-message attacks assuming the computational Diffie-Hellman problem is hard. Crown Copyright (C) 2009 Published by Elsevier B.V. All rights reserved.
引用
收藏
页码:1079 / 1085
页数:7
相关论文
共 24 条
[1]  
Al-Riyami SS, 2003, LECT NOTES COMPUT SC, V2894, P452
[2]  
Bellare P., 1993, P 1 ACM C COMP COMM, P62, DOI DOI 10.1145/168588.168596
[3]  
Boneh D, 2003, LECT NOTES COMPUT SC, V2656, P416
[4]  
CHENG X, 2006, J ELECT, V23, P569
[5]  
CHEON J, NEW ID BASED SIGNATU
[6]  
Choi KY, 2007, LECT NOTES COMPUT SC, V4521, P443
[7]  
DU H, EFFICIENT PROVABLY S
[8]  
Gentry C, 2006, LECT NOTES COMPUT SC, V3958, P257
[9]   Two certificateless aggregate signatures from bilinear maps [J].
Gong, Zheng ;
Long, Yu ;
Hong, Xuan ;
Chen, Kefei .
SNPD 2007: EIGHTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING, AND PARALLEL/DISTRIBUTED COMPUTING, VOL 3, PROCEEDINGS, 2007, :188-+
[10]  
Hu BC, 2006, LECT NOTES COMPUT SC, V4058, P235