Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

CISC
2007
Springer

favoriteEmaildiscussreport

117views Cryptology» more CISC 2007»

An Efficient ID-Based Proxy Signature Scheme from Pairings

13 years 8 months ago

An Efficient ID-Based Proxy Signature Scheme from Pairings

Download eprint.iacr.org

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.

Chunxiang Gu, Yuefei Zhu

Real-time Traffic

Bilinear Pairings | CISC 2007 | Cryptology | Diffie-Hellman Inverse Problem | Proxy Signature Scheme |

claim paper

Related Content

» IdentityBased Threshold Proxy Signature from Bilinear Pairings

» Efficient Generic ForwardSecure Signatures and Proxy Signatures

» IDbased Ring Signature and Proxy Ring Signature Schemes from Bilinear Pairings

» IdentityBased Proxy Signature from Pairings

» A Provably Secure Proxy Signature Scheme in Certificateless Cryptography

» Efficient and Provably Secure TrapdoorFree Group Signature Schemes from Bilinear Pairings

» Identity Based Threshold Proxy Signcryption Scheme

» An Identitybased Ring Signature Scheme from Bilinear Pairings

» Limited Verifier Signature from Bilinear Pairings

Post Info
More Details (n/a)

Added	14 Aug 2010
Updated	14 Aug 2010
Type	Conference
Year	2007
Where	CISC
Authors	Chunxiang Gu, Yuefei Zhu

Comments (0)