Welcome to the resource topic for 2006/158
An Efficient ID-based Proxy Signature Scheme from Pairings
Authors: Chunxiang Gu, Yuefei ZhuAbstract:
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.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .