Efficient Provably Secure ID-based Blind Signature with Message Recovery

DOI

10.2991/wartia-18.2018.17How to use a DOI?

Keywords

ID-based Blind Signature; Message Recovery; Provably Secure

Abstract

Due to the rapid growth in popularity of electronic cash, electronic voting and location-based mobile, the design of secure schemes with low-bandwidth and blocking attacks capability is an important research issue. In this paper, we propose an efficient provably secure ID-based blind signature with message recovery scheme based on bilinear pairings. In the scheme, the original message is not required to be transmitted together with the signature and it can be recovered during the signature verification process. Assuming the intractability of the q-Strong Diffie-Hellman problem, our scheme is unforgeable under adaptive chosen-message and ID attack. The proof of correctness and blindness property analysis of the proposed scheme are presented. The scheme can offer advantages in runtime over the schemes available.

Copyright

© 2018, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Wei Cui
AU  - Qian Jia
PY  - 2018/09
DA  - 2018/09
TI  - Efficient Provably Secure ID-based Blind Signature with Message Recovery
BT  - Proceedings of the 4th Workshop on Advanced Research and Technology in Industry (WARTIA 2018)
PB  - Atlantis Press
SP  - 101
EP  - 107
SN  - 2352-5401
UR  - https://doi.org/10.2991/wartia-18.2018.17
DO  - 10.2991/wartia-18.2018.17
ID  - Cui2018/09
ER  -