Generic construction for tightly-secure signatures from discrete log

Jianchang Lai, Ge Wu*, Peng Jiang, Zhen Zhao*, Willy Susilo, Fuchun Guo

*此作品的通讯作者

科研成果: 期刊稿件文章同行评审

1 引用 (Scopus)
Plum Print visual indicator of research metrics
  • Citations
    • Citation Indexes: 1
  • Usage
    • Abstract Views: 2
  • Captures
    • Readers: 3
see details

摘要

Tightly secure signature plays a significant role in the research of cryptography and has been studied extensively in the literature. In this paper, we present a generic construction for tightly-secure signatures from the discrete log (DL) assumption in the existential-unforgeability against key only attacks (EUF-KOA) security model, where the adversary is allowed to obtain only the public key, but not any sample signature. Moreover, the generic construction can also be extended into the multi-user setting with corruptions (MU-C) model. Roughly speaking, given any signature scheme, we can efficiently convert it into a signature scheme that features tight security under the DL assumption in the MU-EUF-KOA-C security model with random oracles. Our transformation shows it is easy to construct a DL-equivalent signature in the EUF-KOA security model, although many known DL-based signatures are not equivalent to DL. If the given signature scheme is key-re-randomizable, the transformed scheme is also key-re-randomizable. Hence, our result provides a supplement to Bader et al.'s work (EUROCRYPT 2016).

源语言英语
页(从-至)13-21
页数9
期刊Theoretical Computer Science
888
DOI
出版状态已出版 - 4 10月 2021

指纹

探究 'Generic construction for tightly-secure signatures from discrete log' 的科研主题。它们共同构成独一无二的指纹。

引用此

Lai, J., Wu, G., Jiang, P., Zhao, Z., Susilo, W., & Guo, F. (2021). Generic construction for tightly-secure signatures from discrete log. Theoretical Computer Science, 888, 13-21. https://doi.org/10.1016/j.tcs.2021.07.014