Supersingular Curves You Can Trust
hal.structure.identifier | University of Birmingham [Birmingham] | |
hal.structure.identifier | University of Bristol [Bristol] | |
dc.contributor.author | BASSO, Andrea | |
hal.structure.identifier | Dipartimento di Matematica [Bologna] | |
dc.contributor.author | CODOGNI, Giulio | |
dc.contributor.author | CONNOLLY, Deirdre | |
hal.structure.identifier | IBM Research [Zurich] | |
dc.contributor.author | DE FEO, Luca | |
hal.structure.identifier | Ecole Polytechnique Fédérale de Lausanne [EPFL] | |
dc.contributor.author | FOUOTSA, Tako | |
hal.structure.identifier | Dipartimento di Matematica [Bologna] | |
dc.contributor.author | LIDO, Guido | |
hal.structure.identifier | Virginia Tech [Blacksburg] | |
dc.contributor.author | MORRISON, Travis | |
hal.structure.identifier | Academia Sinica | |
dc.contributor.author | PANNY, Lorenz | |
hal.structure.identifier | IBM India Research Lab. | |
dc.contributor.author | PATRANABIS, Sikhar | |
hal.structure.identifier | Centre National de la Recherche Scientifique [CNRS] | |
hal.structure.identifier | Unité de Mathématiques Pures et Appliquées [UMPA-ENSL] | |
hal.structure.identifier | Lithe and fast algorithmic number theory [LFANT] | |
hal.structure.identifier | Analyse cryptographique et arithmétique [CANARI] | |
dc.contributor.author | WESOLOWSKI, Benjamin | |
dc.date.accessioned | 2024-04-04T02:34:43Z | |
dc.date.available | 2024-04-04T02:34:43Z | |
dc.date.conference | 2023-04-23 | |
dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/190573 | |
dc.description.abstractEn | 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. | |
dc.description.sponsorship | Méthodes pour les variétés abéliennes de petite dimension - ANR-20-CE40-0013 | |
dc.description.sponsorship | Post-quantum padlock for web browser - ANR-22-PETQ-0008 | |
dc.language.iso | en | |
dc.rights.uri | http://creativecommons.org/licenses/by/ | |
dc.subject.en | Isogenies | |
dc.subject.en | Ramanujan Graphs | |
dc.subject.en | Zero-knowledge Proofs | |
dc.subject.en | Trusted Setup | |
dc.title.en | Supersingular Curves You Can Trust | |
dc.type | Communication dans un congrès | |
dc.subject.hal | Informatique [cs]/Cryptographie et sécurité [cs.CR] | |
bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
bordeaux.institution | Université de Bordeaux | |
bordeaux.institution | Bordeaux INP | |
bordeaux.institution | CNRS | |
bordeaux.conference.title | Eurocrypt 2023 | |
bordeaux.country | FR | |
bordeaux.conference.city | Lyon | |
bordeaux.peerReviewed | oui | |
hal.identifier | hal-04052486 | |
hal.version | 1 | |
hal.invited | non | |
hal.proceedings | oui | |
hal.conference.end | 2023-04-27 | |
hal.popular | non | |
hal.audience | Internationale | |
hal.origin.link | https://hal.archives-ouvertes.fr//hal-04052486v1 | |
bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.au=BASSO,%20Andrea&CODOGNI,%20Giulio&CONNOLLY,%20Deirdre&DE%20FEO,%20Luca&FOUOTSA,%20Tako&rft.genre=unknown |
Fichier(s) constituant ce document
Fichiers | Taille | Format | Vue |
---|---|---|---|
Il n'y a pas de fichiers associés à ce document. |