Efficient ID-Based Proxy Signature and Proxy Signcryption Form Bilinear Pairings

2005 ◽  
pp. 167-172 ◽  
Author(s):  
Qin Wang ◽  
Zhenfu Cao
Keyword(s):  
Bilinear Pairings ◽  
Proxy Signature

ID-based directed proxy signature scheme from bilinear pairings

2010 ◽  
Vol 13 (5) ◽  
pp. 487-500 ◽  
Author(s):  
P. Vasudeva Reddy ◽  
B. Umaprasada Rao ◽  
T. Gowri
Keyword(s):  
Bilinear Pairings ◽  
Proxy Signature ◽  
Signature Scheme

scholarly journals A Novel Anonymous Proxy Signature Scheme

2012 ◽  
Vol 2012 ◽  
pp. 1-10
Author(s):  
Jue-Sam Chou
Keyword(s):  
Bilinear Pairings ◽  
Proxy Signature ◽  
Random Numbers ◽  
Signature Scheme ◽  
Signature Schemes

Recently, several studies about proxy signature schemes have been conducted. In 2009, Yu et al. proposed an anonymous proxy signature scheme attempting to protect the proxy signer's privacy from outsiders. They claimed that their scheme can make the proxy signer anonymous. However, based on our research, we determined that this was not the case and the proxy signer's privacy was not anonymous. Hence, in this paper, we propose a new anonymous proxy signature scheme that truly makes the proxy signer anonymous while making it more secure and efficient when compared with Yu et al.'s scheme. Our proxy signature scheme consists of two contributions. First, we mainly use random numbers and bilinear pairings to attain the anonymous property. Secondly, we increase the security and efficiency of our proxy in the design.

A provably secure proxy signature scheme from bilinear pairings

2010 ◽  
Vol 27 (3) ◽  
pp. 298-304 ◽  
Author(s):  
Aiqin Wang ◽  
Jiguo Li ◽  
Zhijian Wang
Keyword(s):  
Bilinear Pairings ◽  
Proxy Signature ◽  
Signature Scheme ◽  
Provably Secure

Applied-Information Technology in Certificateless Proxy Signature Scheme without Bilinear Pairings

2014 ◽  
Vol 685 ◽  
pp. 532-535
Author(s):  
Su Li Wang ◽  
Jun Yao Ye
Keyword(s):  
Information Technology ◽  
Finite Field ◽  
Discrete Logarithm ◽  
Bilinear Pairings ◽  
Proxy Signature ◽  
Hard Problem ◽  
Signature Scheme ◽  
Certificateless Cryptography ◽  
Key Escrow ◽  
The Hard Problem

This paper researches on the existing certificateless proxy signature scheme, there is almost no certificateless proxy signature scheme based on discrete logarithm up till now. Combining the knowledge of discrete logarithm over finite field and the advantages of certificateless cryptography, this paper proposes an efficient certificateless proxy signature scheme based on the discrete logarithm without bilinear pairings. To avoid the key escrow problem in the id-based cryptosystem and the saving certificate problem in the traditional public cryptography, meet the good properties of the proxy signature, such as unforgery, dependence of the proxy keys, distinguish of the proxy signature and anti-abuse. The scheme does not use the bilinear pairings, and based on the hard problem of discrete logarithm in the finite field, given the proof and discussion of the validity and security of the scheme.

Sign in / Sign up

Export Citation Format

Share Document