Paper 2022/1469 Original: eprint.iacr.org/2022/1469 ↗

Supersingular Curves You Can Trust

Andrea Basso
Giulio Codogni
Deirdre Connolly
Luca De Feo
Tako Boris Fouotsa
Guido Maria Lido
Travis Morrison
Lorenz Panny
Sikhar Patranabis
Benjamin Wesolowski
Abstract

Generating a supersingular elliptic curve such that nobody knows its endomorphism ring is a notoriously hard task, despite several isogeny-based protocols relying on such an object. A trusted setup is often proposed as a workaround, but several aspects remain unclear. In this work, we develop the tools necessary to practically run such a distributed trusted-setup ceremony. Our key contribution is the first statistically zero-knowledge proof of isogeny knowledge that is compatible with any base field. To prove statistical ZK, we introduce isogeny graphs with Borel level structure and prove they have the Ramanujan property. Then, we analyze the security of a distributed trusted-setup protocol based on our ZK proof in the simplified universal composability framework. Lastly, we develop an optimized implementation of the ZK proof, and we propose a strategy to concretely deploy the trusted-setup protocol.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
History
2023-02-24: last updated
2022-10-26: published
Short URL
https://ia.cr/2022/1469
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2022/1469,
      author = {Andrea Basso and Giulio Codogni and Deirdre Connolly and Luca De Feo and Tako Boris Fouotsa and Guido Maria Lido and Travis Morrison and Lorenz Panny and Sikhar Patranabis and Benjamin Wesolowski},
      title = {Supersingular Curves You Can Trust},
      howpublished = {Cryptology {ePrint} Archive, Paper 2022/1469},
      year = {2022},
      url = {https://eprint.iacr.org/2022/1469}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.