A Provably Secure ID-Based Designated Verifier Proxy Signature Scheme Based on DLP
2013 ◽
Vol 411-414
◽
pp. 721-724
◽
Keyword(s):
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 282-283
◽
pp. 307-311
2010 ◽
Vol 439-440
◽
pp. 1271-1276
◽
Keyword(s):
2010 ◽
Vol 40-41
◽
pp. 643-646
Keyword(s):
2011 ◽
Vol 63-64
◽
pp. 785-788
Keyword(s):
2016 ◽
Vol 10
(2)
◽
pp. 69-79
◽
2011 ◽
Vol 204-210
◽
pp. 1062-1065
◽
Keyword(s):
2013 ◽
Vol 457-458
◽
pp. 1262-1265