Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Aurore Guillevic

dblp:54/9839 · DBLP profile ↗
← Back
15ranked-venue papers
7as first author
2since 2021 · last 2023
0000-0002-0824-7273ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 14 · 7 first-author · 2 since 2021Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
5 papers
Cryptographic primitives and cryptanalysis · 94% Cryptographic protocols and secure computation · 6%

Topics — the 9 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve		 0.612022
Families of SNARK-Friendly 2-Chains of Elliptic Curves · EUROCRYPT (2) 2022
Cryptographic primitives and cryptanalysis › public-key cryptography › elliptic curve cryptography
pairing-friendly curves		 0.612022
Families of SNARK-Friendly 2-Chains of Elliptic Curves · EUROCRYPT (2) 2022
Cryptographic primitives and cryptanalysis
discrete logarithm problem		 0.422015
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields · EUROCRYPT (1) 2015
Computing Individual Discrete Logarithms Faster in GF(p n ) with the NFS-DL Algorithm · ASIACRYPT (1) 2015
Cryptographic primitives and cryptanalysis › integer factorization
number field sieve		 0.422015
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields · EUROCRYPT (1) 2015
Computing Individual Discrete Logarithms Faster in GF(p n ) with the NFS-DL Algorithm · ASIACRYPT (1) 2015
Cryptographic primitives and cryptanalysis › discrete logarithm
finite field discrete logarithm		 0.212015
Computing Individual Discrete Logarithms Faster in GF(p n ) with the NFS-DL Algorithm · ASIACRYPT (1) 2015
Cryptographic protocols and secure computation › proof systems
succinct non-interactive arguments of knowledge		 0.212022
Families of SNARK-Friendly 2-Chains of Elliptic Curves · EUROCRYPT (2) 2022
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography		 0.212013
Four-Dimensional GLV via the Weil Restriction · ASIACRYPT (1) 2013
Cryptographic primitives and cryptanalysis › public-key cryptography › elliptic curve cryptography
weil descent attack		 0.212013
Four-Dimensional GLV via the Weil Restriction · ASIACRYPT (1) 2013
Cryptographic primitives and cryptanalysis
discrete logarithm		 0.112020
Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment · CRYPTO (2) 2020
YearPublicationVenuePosition
2023 A survey of elliptic curves for proof systems
abstract
Elliptic curves have become key ingredients for instantiating zero-knowledge proofs and more generally proof systems. Recently, there have been many tailored constructions of these curves that aim at efficiently implementing different kinds of proof systems. In this survey we provide the reader with a comprehensive overview on existing work and revisit the contributions in terms of efficiency and security. We present an overview at three stages of the process: curves to instantiate a SNARK, curves to instantiate a recursive SNARK, and also curves to express an elliptic-curve related statement. We provide new constructions of curves for SNARKs and generalize the state-of-the-art constructions for recursive SNARKs. We also exhaustively document the existing work and open-source implementations.
Diego F. Aranha, Youssef El Housni, Aurore Guillevic
 Des. Codes Cryptogr.3
2022 Families of SNARK-Friendly 2-Chains of Elliptic Curves
Youssef El Housni, Aurore Guillevic
 EUROCRYPT (2)2
2020 Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
Youssef El Housni, Aurore Guillevic
 CANS2
2020 Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment
Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann 0001
 CRYPTO (2)3
2020 Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
Aurore Guillevic, Simon Masson, Emmanuel Thomé
 Des. Codes Cryptogr.1
2018 A New Family of Pairing-Friendly Elliptic Curves
Michael Scott, Aurore Guillevic
 WAIFI2
2017 Computing Discrete Logarithms in 𝔽p6
Laurent Grémy, Aurore Guillevic, François Morain, Emmanuel Thomé
 SAC2
2016 Solving Discrete Logarithms on a 170-Bit MNT Curve by Pairing Reduction
Aurore Guillevic, François Morain, Emmanuel Thomé
 SAC1
2015 Computing Individual Discrete Logarithms Faster in GF(p n ) with the NFS-DL Algorithm
Aurore Guillevic
 ASIACRYPT (1)1
2015 Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain
 EUROCRYPT (1)3
2014 Algorithms for Outsourcing Pairing Computation
Aurore Guillevic, Damien Vergnaud
 CARDIS1
2013 Comparing the Pairing Efficiency over Composite-Order and Prime-Order Elliptic Curves
Aurore Guillevic
 ACNS1
2013 Four-Dimensional GLV via the Weil Restriction
Aurore Guillevic, Sorina Ionica
 ASIACRYPT (1)1
2012 Improved Broadcast Encryption Scheme with Constant-Size Ciphertext
Renaud Dubois, Aurore Guillevic, Marine Sengelin Le Breton
 Pairing2
2012 Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions
Aurore Guillevic, Damien Vergnaud
 Pairing1