A provably secure identity-based strong designated verifier proxy signature scheme from bilinear pairings

We construct an efficient and novel identity-based strong designated verifier signature (IBSDVS) scheme based on bilinear pairings, and provide the security proofs and efficiency analysis for the proposed scheme. Our IBSDVS scheme achieves higher efficiency and satisfies all the security requirements of the designated verifier signatures in identity-based cryptography.

Download Full-text

A Provably Secure Certificate-Based Signature Scheme with Bilinear Pairings

Key Engineering Materials ◽

10.4028/www.scientific.net/kem.439-440.1271 ◽

2010 ◽

Vol 439-440 ◽

pp. 1271-1276 ◽

Cited By ~ 1

Author(s):

Jian Hong Zhang ◽

Hua Chen ◽

Yi Xian Yang

Keyword(s):

Discrete Logarithm ◽

Random Oracle Model ◽

Bilinear Pairings ◽

Random Oracle ◽

Third Party ◽

Maintenance Cost ◽

Signature Scheme ◽

Key Escrow ◽

Identity Based ◽

Provably Secure

Traditional public key cryptosystem (PKC) requires high maintenance cost for certificate management. Although, identity based cryptosystem (IBC) reduces the overhead of management, it suffers from the drawback of key escrow. Certificate-based cryptosystem solves certificate revocation problem and eliminate third party queries in the traditional PKI. In addition, it also solves the inherent key escrow problem in the IBC. In this paper, we proposed an efficient certificate-based signature and the result shows that the scheme is provable secure against two game attacks of certificate-based signature in the random oracle model. The security is closely related to the difficulty of solving the discrete logarithm problem.

Download Full-text

A New Identity-based Proxy Signature Scheme from Bilinear Pairings

2006 2nd International Conference on Information & Communication Technologies ◽

10.1109/ictta.2006.1684946 ◽

2006 ◽

Cited By ~ 1

Author(s):

H. Mala ◽

M. Dakhil-alian ◽

M. Brenjkoub

Keyword(s):

Bilinear Pairings ◽

Proxy Signature ◽

Signature Scheme ◽

Identity Based

Download Full-text

An ID-Based Proxy Multi-Signature Scheme

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.135-136.217 ◽

2011 ◽

Vol 135-136 ◽

pp. 217-221

Author(s):

Hui Meng ◽

Xu Qian

Keyword(s):

Bilinear Pairings ◽

Proxy Signature ◽

Signature Scheme ◽

Forgery Attack ◽

Security Properties ◽

Identity Based ◽

Identity Based Cryptography

Proxy multi-signature is an extension of the basic proxy signature primitive, and permits two or more entities to delegate their signing capabilities to the same other entity. Combining proxy multi-signature with identity based cryptography, in this paper, We construct a concrete identity based proxy multi-signature scheme by using bilinear pairings. Analysis shows that the scheme is capable of resisting forgery attack and can satisfy all the required security properties of a proxy signature. Furthermore, the new scheme is very simple and efficient computationally. It has the property that the size of a proxy multi-signature is independent of the number of the original signers.

Download Full-text

A Provably Secure ID-Based Designated Verifier Proxy Signature Scheme Based on DLP

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.411-414.721 ◽

2013 ◽

Vol 411-414 ◽

pp. 721-724 ◽

Cited By ~ 1

Author(s):

Bao Dian Wei

Keyword(s):

Discrete Logarithm ◽

Random Oracle Model ◽

Random Oracle ◽

Proxy Signature ◽

Signature Scheme ◽

Signature Schemes ◽

The Common ◽

Designated Verifier ◽

Provably Secure

Most of the existing ID-based designated verifier proxy signature schemes are implemented with pairings. The computation of parings is still much more expensive than the common modular multiplications and exponentiations. To obtain better efficiency, we construct an efficient ID-based DVPS scheme without pairings. The scheme is designed based on the hardness of the discrete logarithm problems. It is proven secure against adaptively chosen message attacks, in the random oracle model.

Download Full-text