An Efficient ID-Based Proxy Signature Scheme from Pairings

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.

• Type: Conference
• Year: 2007
• Where: CISC
• Authors: Chunxiang Gu, Yuefei Zhu
• Keywords: Bilinear Pairings, CISC 2007, Cryptology, Diffie-Hellman Inverse Problem, Proxy Signature Scheme