Paper 2011/713
A server-aided verification signature scheme without random oracles
Bin Wang and Qing Zhao
Abstract
Server-aided verification(SAV) signature is useful for power-constrained devices since a powerful server can assist in performing costly operations such as pairing operations. Wu et al. [13] defined three security notions for SAV protocol to prevent a server from convincing a verifier that an invalid signature is valid. Security against strong collusion attack provides the strongest security guarantee among these notions. They [13] constructed SAV protocols that meet the requirement of these notions respectively. But they did not provide concrete running time to show that the running time of a verifier in their SAV protocol is strictly less than that of a verifier in the original verification protocol. In addition, a problem left open by their work is to design SAV signature which is unforgeable without random oracles as well as sound against strong collusion attack. To address the above issues, we first choose to design a SAV protocol called SAV-Hofheinz for a short signature proposed by Hofheinz unforgeable in the standard model. Then we implement SAV-Hofheinz by the PBC library and shows that the running time of a verifier in SAV-Hofheinz is strictly less than that of a verifier in the verification protocol of Hofheinz short signature.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Contact author(s)
- jxbin76 @ yahoo cn
- History
- 2012-01-02: received
- Short URL
- https://ia.cr/2011/713
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2011/713,
author = {Bin Wang and Qing Zhao},
title = {A server-aided verification signature scheme without random oracles},
howpublished = {Cryptology ePrint Archive, Paper 2011/713},
year = {2011},
note = {\url{https://eprint.iacr.org/2011/713}},
url = {https://eprint.iacr.org/2011/713}
}
