An Efficient ID-Based Proxy Signature Scheme from Pairings

Authors:
Chunxiang Gu;Yuefei Zhu
Affiliations:
Network Engineering Department, Zhengzhou Information Science and Technology Institute, Zhengzhou, P.R. China 450002;Network Engineering Department, Zhengzhou Information Science and Technology Institute, Zhengzhou, P.R. China 450002
Venue:
Information Security and Cryptology
Year:
2007

Citing 12
Cited 3

Identity-based cryptosystems and signature schemes

Proceedings of CRYPTO 84 on Advances in cryptology
Proxy signatures for delegating signing operation

CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Efficient Scalar Multiplications on Elliptic Curves without Repeated Doublings and Their Practical Performance

ACISP '00 Proceedings of the 5th Australasian Conference on Information Security and Privacy
Proxy signatures, Revisited

ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Efficient Identity Based Signature Schemes Based on Pairings

SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Efficient Algorithms for Pairing-Based Cryptosystems

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
ID-Based Blind Signature and Ring Signature from Pairings

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
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
Efficient ID-based blind signature and proxy signature from bilinear pairings

ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
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

An ID-based proxy multi signature scheme without bilinear pairings

InfoSecHiComNet'11 Proceedings of the First international conference on Security aspects in information technology
Identity-Based signcryption from identity-based cryptography

WISA'11 Proceedings of the 12th international conference on Information Security Applications
Software Service Signature (S3) for authentication in cloud computing

Cluster Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new ID-based proxy signature scheme based on the bilinear pairings. The number of paring operation involved in the verification procedure of our scheme is only one, so our scheme is more efficient comparatively. The new scheme can be proved secure with the hardness assumption of the k-Bilinear Diffie-Hellman Inverse problem, in the random oracle model.