论文信息 - A New ID-based Aggregate Signature with Constant Pairing Operations

A New ID-based Aggregate Signature with Constant Pairing Operations

Given signatures on distinct messages from n distinct users, aggregate signature scheme is possible to aggregate all these signature into a single short signature. In this paper, we propose an identity-based aggregate signature scheme which requires constant pairing operations in the verification. We prove that the proposed signature scheme is secure against existential forgery under adaptively chosen message and ID attack in the random oracle model assuming the intractability of the computational Diffie-Hellman problem.

Xuefeng Zheng | Hua Sun | Yike Yu

[1] Kenneth G. Paterson,et al. ID-based Signatures from Pairings on Elliptic Curves , 2002, IACR Cryptol. ePrint Arch..

[2] Javier Herranz,et al. Deterministic Identity-Based Signatures for Partial Aggregation , 2006, Comput. J..

[3] Jung Hee Cheon,et al. An Identity-Based Signature from Gap Diffie-Hellman Groups , 2003, Public Key Cryptography.

[4] Adi Shamir,et al. Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.

[5] Jung Hee Cheon,et al. A New ID-based Signature with Batch Verification , 2004, IACR Cryptol. ePrint Arch..

[6] Florian Hess,et al. Efficient Identity Based Signature Schemes Based on Pairings , 2002, Selected Areas in Cryptography.

[7] Hovav Shacham,et al. Aggregate and Verifiably Encrypted Signatures from Bilinear Maps , 2003, EUROCRYPT.

[8] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.

[9] Craig Gentry,et al. Identity-Based Aggregate Signatures , 2006, Public Key Cryptography.

[10] Kenneth G. Paterson,et al. Efficient Identity-Based Signatures Secure in the Standard Model , 2006, ACISP.