Papers (44)

#Title
Citations
1.Pairing-Friendly Elliptic Curves of Prime Order Paulo S. L. M. Barreto and Michael Naehrig. 2005.
1252
2.High-Speed Software Implementation of the Optimal Ate Pairing over Barreto-Naehrig Curves Jean-Luc Beuchat and Jorge Enrique González Díaz and Shigeo Mitsunari and Eiji Okamoto and Francisco Rodríguez-Henríquez and Tadanori Teruya. 2010.
268
3.Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case Taechan Kim and Razvan Barbulescu. 2015.
267
4.Deterministic usage of the digital signature algorithm (DSA) and elliptic curve digital signature algorithm (ECDSA) Pornin, Thomas. 2013.
191
5.Verifiable Delay Functions from Supersingular Isogenies and Pairings Luca De Feo and Simon Masson and Christophe Petit and Antonio Sanso. 2019.
121
6.Implementing Pairings at the 192-bit Security Level Diego F. Aranha and Laura Fuentes-Castañeda and Edward Knapp and Alfred Menezes and Francisco Rodríguez-Henríquez. 2012.
96
7.UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts Canetti, Ran and Gennaro, Rosario and Goldfeder, Steven and Makriyannis, Nikolaos and Peled, Udi. 2020.
88
8.MuSig2: Simple Two-Round Schnorr Multi-Signatures Jonas Nick and Tim Ruffing and Yannick Seurin. 2020.
77
9.LadderLeak: Breaking ECDSA With Less Than One Bit Of Nonce Leakage Diego F. Aranha and Felipe Rodrigues Novaes and Akira Takahashi and Mehdi Tibouchi and Yuval Yarom. 2020.   
75
10.Fast and simple constant-time hashing to the BLS12-381 elliptic curve Wahby, Riad S and Boneh, Dan. 2019.   
66
11.Decaf: Eliminating cofactors through point compression Hamburg, Mike. 2015.
56
12.Indifferentiable hashing to Barreto--Naehrig curves Fouque, Pierre-Alain and Tibouchi, Mehdi. 2012.
52
13.Delay Encryption Jeffrey Burdges and Luca De Feo. 2020.   
46
14.The Provable Security of Ed25519: Theory and Practice Brendel, Jacqueline and Cremers, Cas and Jackson, Dennis and Zhao, Mang. 2020.
44
15.Verifiable Timed Signatures Made Practical Thyagarajan, Sri Aravinda Krishnan and Bhat, Adithya and Malavolta, Giulio and D\"ottling, Nico and Kate, Aniket and Schr\"oder, Dominique. 2020.
35
16.Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition Youssef El Housni and Aurore Guillevic. 2020.   
30
17.A Survey of ECDSA Threshold Signing Jean-Philippe Aumasson and Adrian Hamelink and Omer Shlomovits. 2020.
23
18.VERI-ZEXE: Decentralized private computation with universal setup Xiong, Alex Luoyuan and Chen, Binyi and Zhang, Zhenfei and B\"unz, Benedikt and Fisch, Ben and Krell, Fernando and Camacho, Philippe. 2022.
20
19.A survey of elliptic curves for proof systems Aranha, Diego F and El Housni, Youssef and Guillevic, Aurore. 2022.
20
20.Taming the many EdDSAs Konstantinos Chalkias and François Garillot and Valeria Nikolaenko. 2020.
19
21.Thresholdizing HashEdDSA: MPC to the rescue Bonte, Charlotte and Smart, Nigel P and Tanguy, Titouan. 2021.
18
22.Families of SNARK-friendly 2-chains of elliptic curves El Housni, Youssef and Guillevic, Aurore. 2021.
18
23.LOVE a pairing Diego F. Aranha and Elena Pagnin and Francisco Rodríguez-Henríquez. 2021.
16
24.Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures Konstantinos Chalkias and Francois Garillot and Yashvanth Kondi and Valeria Nikolaenko. 2021.
14
25.On the security of ECDSA with additive key derivation and presignatures Jens Groth and Victor Shoup. 2021.
14
26.Bandersnatch: a fast elliptic curve built over the BLS12-381 scalar field Simon Masson and Antonio Sanso and Zhenfei Zhang. 2021.
9
27.Efficient and Universally Composable Single Secret Leader Election from Pairings Dario Catalano and Dario Fiore and Emanuele Giunta. 2021.
8
28.Efficient Verification of Optimized Code: Correct High-speed Curve25519 Schoolderman, Marc and Moerman, Jonathan and Smetsers, Sjaak and van Eekelen, Marko. 2020.
6
29.Efficient Verification of Optimized Code: Correct High-speed X25519 Marc Schoolderman and Jonathan Moerman and Sjaak Smetsers and Marko van Eekelen. 2021.
6
30.Efficient Isogeny Proofs Using Generic Techniques Kelong Cong and Yi-Fu Lai and Shai Levin. 2023.
6
31.Impossibility on the Schnorr Signature from the One-more DL Assumption in the Non-programmable Random Oracle Model Masayuki Fukumitsu and Shingo Hasegawa. 2020.
5
32.Efficient Algorithms for Large Prime Characteristic Fields and Their Application to Bilinear Pairings and Supersingular Isogeny-Based Protocols Patrick Longa. 2022.
5
33.$\mu$Cash: Transparent Anonymous Transactions Liam Eagen. 2022.
3
34.Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-degree Extension in Time O (n log n) over all Finite Fields Ben-Sasson, Eli and Carmon, Dan and Kopparty, Swastik and Levit, David. 2023.
3
35.Revisiting the Nova Proof System on a Cycle of Curves Wilson Nguyen and Dan Boneh and Srinath Setty. 2023.
2
36.The Arithmetic of Pairing-Based Proof Systems El Housni, Youssef. 2022.
2
37.Attacking (EC)DSA With Partially Known Multiples of Nonces Marios Adamoudis and Konstantinos A. Draziotis and Dimitrios Poulakis. 2021.
1
38.Revisiting cycles of pairing-friendly elliptic curves Marta Bellés-Muñoz and Jorge Jiménez Urroz and Javier Silva. 2022.
1
39.Constructive and computational aspects of cryptographic pairings Naehrig, Michael. 2009.
0
40.Guessing Bits: Improved Lattice Attacks on (EC)DSA Chao Sun and Thomas Espitau and Mehdi Tibouchi and Masayuki Abe. 2021.
0
41.CycloneNTT: An NTT/FFT Architecture Using Quasi-Streaming of Large Datasets on DDR- and HBM-based FPGA Platforms Kaveh Aasaraai and Emanuele Cesena and Rahul Maganti and Nicolas Stalder and Javier Varela and Kevin Bowers. 2022.
0
42.EdMSM: Multi-Scalar-Multiplication for recursive SNARKs and more Youssef EL Housni and Gautam Botrel. 2022.
0
43.Speeding up elliptic computations for Ethereum Account Abstraction Renaud Dubois. 2023.
0
44.Limits in the Provable Security of ECDSA Signatures Dominik Hartmann and Eike Kiltz. 2023.
0

Videos