Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
Efficient Identity Based Signature Schemes Based on Pairings
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
An Identity-Based Signature from Gap Diffie-Hellman Groups
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Identity based proxy multi-signature
Journal of Systems and Software
Identity-based key agreement protocols from pairings
International Journal of Information Security
An Efficient ID-Based Proxy Signature Scheme from Pairings
Information Security and Cryptology
A secure identity-based proxy multi-signature scheme
Information Sciences: an International Journal
An Identity-Based Proxy Signature from Bilinear Pairings
ICIE '09 Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02
A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges
Information Sciences: an International Journal
Efficient and provably-secure identity-based signatures and signcryption from bilinear maps
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Provable security of ID-Based proxy signature schemes
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Identity-based proxy signature from pairings
ATC'07 Proceedings of the 4th international conference on Autonomic and Trusted Computing
| Hi-index | 0.00 |
As a variation of ordinary digital signature scheme, a proxy signature scheme enables a proxy signer to sign messages on behalf of the original signer. Proxy multi-signature is an extension of the basic proxy signature primitive, and permits two or more entities to delegate their signing capabilities to some other entity. Many identity-based proxy multi signature (IBPMS) schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately more than ten times of the scalar multiplication over elliptic curve group. In order to save the running time and the size of the signature, in this paper, we propose an IBPMS scheme without bilinear pairings. We also prove the security of our scheme against adaptive chosen message attack under random oracle model. With the running time being saved greatly, our scheme is more applicable than the previous related schemes for practical applications.