Paper 2007/396

Proxy Re-Signature Schemes without Random Oracles

Jun Shao, Zhenfu Cao, Licheng Wang, and Xiaohui Liang

Abstract

To construct a suitable and secure proxy re-signature scheme is not an easy job, up to now, there exist only three schemes, one is proposed by Blaze et al. at EUROCRYPT 1998, and the others are proposed by Ateniese and Hohenbergerat ACM CCS 2005. However, none of these schemes is proved in the standard model (i.e., do not rely on the random oracle heuristic). In this paper, based on Waters' approach, we first propose a multi-use bidirectional proxy re-signature scheme, denoted as $S_{mb}$, which is existentially unforgeable in the standard model. And then, we extend $S_{mb}$ to be a multi-use bidirectional ID-based proxy re-signature scheme, denoted by $S_{id-mb}$, which is also existentially unforgeable in the standard model. Both of these two proposed schemes are computationally efficient, and their security bases on the Computational Diffie-Hellman (CDH) assumption.

Note: S_{mu} scheme is revised according to an attack.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Indocrypt 2007
Keywords
proxy re-signature
Contact author(s)
chn junshao @ gmail com
History
2008-07-16: last of 3 revisions
2007-10-14: received
See all versions
Short URL
https://ia.cr/2007/396
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2007/396,
      author = {Jun Shao and Zhenfu Cao and Licheng Wang and Xiaohui Liang},
      title = {Proxy Re-Signature Schemes without Random Oracles},
      howpublished = {Cryptology ePrint Archive, Paper 2007/396},
      year = {2007},
      note = {\url{https://eprint.iacr.org/2007/396}},
      url = {https://eprint.iacr.org/2007/396}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.