Ring Signatures: Logarithmic-Size, No Setup --- from Standard Assumptions

Michael Backes; Nico Döttling; Lucjan Hanzlik; Kamil Kluczniak; Jonas Schneider

Paper 2019/196

Ring Signatures: Logarithmic-Size, No Setup --- from Standard Assumptions

Michael Backes, Nico Döttling, Lucjan Hanzlik, Kamil Kluczniak, and Jonas Schneider

Abstract

Ring signatures allow for creating signatures on behalf of an ad hoc group of signers, hiding the true identity of the signer among the group. A natural goal is to construct a ring signature scheme for which the signature size is short in the number of ring members. Moreover, such a construction should not rely on a trusted setup and be proven secure under falsifiable standard assumptions. Despite many years of research this question is still open. In this paper, we present the first construction of logarithmic-size ring signatures which do not rely on a trusted setup or the random oracle heuristic. Specifically, our scheme can be instantiated from standard assumptions and the size of signatures grows only logarithmically in the number of ring members. We also extend our techniques to the setting of linkable ring signatures, where signatures created using the same signing key can be linked.

Metadata

Available format(s): PDF
Publication info: A major revision of an IACR publication in EUROCRYPT 2019
Keywords: ring signatures linkable ring signatures standard model
Contact author(s): jonas schneider-bensch @ cispa-helmholtz de
History: 2019-03-06: last of 2 revisions; 2019-02-27: received; See all versions
Short URL: https://ia.cr/2019/196
License: CC BY

BibTeX

@misc{cryptoeprint:2019/196,
      author = {Michael Backes and Nico Döttling and Lucjan Hanzlik and Kamil Kluczniak and Jonas Schneider},
      title = {Ring Signatures: Logarithmic-Size, No Setup --- from Standard Assumptions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2019/196},
      year = {2019},
      url = {https://eprint.iacr.org/2019/196}
}