Short and provably secure designated verifier proxy signature scheme

2016 ◽  
Vol 10 (2) ◽  
pp. 69-79 ◽  
Author(s):  
Xiaoming Hu ◽  
Huajie Xu ◽  
Jian Wang ◽  
Wenan Tan
2013 ◽  
Vol 411-414 ◽  
pp. 721-724 ◽  
Author(s):  
Bao Dian Wei

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.


2011 ◽  
Vol 6 (7) ◽  
pp. 294-302
Author(s):  
Jianhong Zhang ◽  
Yuanbo Cui ◽  
Min Xu ◽  
Jiancheng Zou

2011 ◽  
Vol 34 (3) ◽  
pp. 494-501 ◽  
Author(s):  
Zhenhua Liu ◽  
Yupu Hu ◽  
Xiangsong Zhang ◽  
Hua Ma

2016 ◽  
Vol 30 (7) ◽  
pp. e3162 ◽  
Author(s):  
Masoumeh Koochak Shooshtari ◽  
Mahmoud Ahmadian-Attari ◽  
Mohammad Reza Aref

2013 ◽  
Vol 397-400 ◽  
pp. 1999-2003
Author(s):  
Li Guo Yang ◽  
Fu Na Ou ◽  
Jing Zhao

By cryptanalysis of a strong designated-verifier proxy signature scheme, it is found that this scheme has security leaks: original signer can forge the proxy signers valid proxy signature for any message; not only the designated-verifier but also proxy signer can verify the signature and proxy signer can misuse it. An improvement is given, and the security analysis shows that it can resist the spiteful forgery attacks by original signer and prevent the misuse of proxy signature by proxy signer.


Sign in / Sign up

Export Citation Format

Share Document