Two Certificateless Aggregate Signatures From Bilinear Maps

Authors:
Zheng Gong;Yu Long;Xuan Hong;Kefei Chen
Affiliations:
Shanghai Jiaotong University, China/ Graduate School of Chinese Academy of Sciences, China;Shanghai Jiaotong University, China;Shanghai Jiaotong University, China;Shanghai Jiaotong University, China
Venue:
SNPD '07 Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03
Year:
2007

Citing 0
Cited 6

A new certificateless aggregate signature scheme

Computer Communications
Novel Efficient Certificateless Aggregate Signatures

AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
ASIC: Aggregate signatures and certificates verification scheme for vehicular networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Efficient many-to-one authentication with certificateless aggregate signatures

Computer Networks: The International Journal of Computer and Telecommunications Networking
An efficient certificateless aggregate signature with constant pairing computations

Information Sciences: an International Journal
Insecurity of an efficient certificateless aggregate signature with constant pairing computations

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose two certificateless aggregate signature schemes, which are the first aggregate signature schemes in the CL-PKC. The first scheme CAS -1 reduces the costs of communication and signer-side computation but loses on storage, while CAS - 2 minimizes the storage but sacrifices the communication. We can choose one of the above schemes by the consideration of the implementation requirement. Our schemes do not need the public key certificate anymore and achieve the trust level 3, the same level with traditional PKI. Both of the schemes are proven secure in the random oracle model(ROM) by assuming the intractability of the computational Diffie-Hellman(CDH) problem over groups with bilinear maps.