Basso, AndreaCodogni, GiulioConnolly, DeirdreDe Feo, LucaFouotsa, Tako BorisLido, Guido MariaMorrison, TravisPanny, LorenzPatranabis, SikharWesolowski, Benjamin2023-06-062023-06-062023-06-06202310.1007/978-3-031-30617-4_14https://infoscience.epfl.ch/handle/20.500.14299/198163Generating 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.text::conference output::conference proceedings::conference paper