Proofs of discrete logarithm equality across groups

Melissa Chase; Michele Orrù; Trevor Perrin; Greg Zaverucha

Paper 2022/1593

Proofs of discrete logarithm equality across groups

Melissa Chase, Microsoft Research

Michele Orrù

, University of California, Berkeley

Trevor Perrin, Signal Foundation

Greg Zaverucha, Microsoft Research

Abstract

We provide a $\Sigma$-protocol for proving that two values committed in different groups are equal. We study our protocol in Lyubashevsky's framework "Fiat-Shamir with aborts" (Asiacrypt’09) and offer concrete parameters for instantiating it. We explain how to use it to compose SNARKs with $\Sigma$-protocols, create efficient proofs of solvency on cryptocurrencies, and join of attributes across different anonymous credentials.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: zero-knowledge sigma protocols
Contact author(s): michele orru @ berkeley edu
gregz @ microsoft com
History: 2022-11-17: approved; 2022-11-16: received; See all versions
Short URL: https://ia.cr/2022/1593
License: CC BY

BibTeX

@misc{cryptoeprint:2022/1593,
      author = {Melissa Chase and Michele Orrù and Trevor Perrin and Greg Zaverucha},
      title = {Proofs of discrete logarithm equality across groups},
      howpublished = {Cryptology ePrint Archive, Paper 2022/1593},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/1593}},
      url = {https://eprint.iacr.org/2022/1593}
}