Papers (25)

#Title
Citations
1.Deterministic usage of the digital signature algorithm (DSA) and elliptic curve digital signature algorithm (ECDSA) Pornin, Thomas. 2013
143
2.Decaf: Eliminating cofactors through point compression Hamburg, Mike. 2015
41
3.Fast and simple constant-time hashing to the BLS12-381 elliptic curve Wahby, Riad S and Boneh, Dan. 2019
38
4.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
27
5.UC Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts Canetti, Ran and Gennaro, Rosario and Goldfeder, Steven and Makriyannis, Nikolaos and Peled, Udi. 2020
25
6.MuSig2: Simple Two-Round Schnorr Multi-Signatures Jonas Nick and Tim Ruffing and Yannick Seurin. 2020
21
7.The Provable Security of Ed25519: Theory and Practice Brendel, Jacqueline and Cremers, Cas and Jackson, Dennis and Zhao, Mang. 2020
15
8.Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition Youssef El Housni and Aurore Guillevic. 2020
14
9.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
14
10.Taming the many EdDSAs Konstantinos Chalkias and François Garillot and Valeria Nikolaenko. 2020
11
11.Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures Konstantinos Chalkias and Francois Garillot and Yashvanth Kondi and Valeria Nikolaenko. 2021
6
12.LOVE a pairing Diego F. Aranha and Elena Pagnin and Francisco Rodríguez-Henríquez. 2021
5
13.A Survey of ECDSA Threshold Signing Jean-Philippe Aumasson and Adrian Hamelink and Omer Shlomovits. 2020
4
14.Impossibility on the Schnorr Signature from the One-more DL Assumption in the Non-programmable Random Oracle Model Masayuki Fukumitsu and Shingo Hasegawa. 2020
3
15.Bandersnatch: a fast elliptic curve built over the BLS12-381 scalar field Simon Masson and Antonio Sanso and Zhenfei Zhang. 2021
2
16.Attacking (EC)DSA With Partially Known Multiples of Nonces Marios Adamoudis and Konstantinos A. Draziotis and Dimitrios Poulakis. 2021
1
17.On the security of ECDSA with additive key derivation and presignatures Jens Groth and Victor Shoup. 2021
1
18.Families of SNARK-friendly 2-chains of elliptic curves El Housni, Youssef and Guillevic, Aurore. 2021
1
19.Constructive and computational aspects of cryptographic pairings Naehrig, Michael. 2009
0
20.Efficient Verification of Optimized Code: Correct High-speed Curve25519 Schoolderman, Marc and Moerman, Jonathan and Smetsers, Sjaak and van Eekelen, Marko. 2020
0
21.Thresholdizing HashEdDSA: MPC to the rescue Bonte, Charlotte and Smart, Nigel P and Tanguy, Titouan. 2021
0
22.Efficient and Universally Composable Single Secret Leader Election from Pairings Dario Catalano and Dario Fiore and Emanuele Giunta. 2021
0
23.Efficient Verification of Optimized Code: Correct High-speed X25519 Marc Schoolderman and Jonathan Moerman and Sjaak Smetsers and Marko van Eekelen. 2021
0
24.Guessing Bits: Improved Lattice Attacks on (EC)DSA Chao Sun and Thomas Espitau and Mehdi Tibouchi and Masayuki Abe. 2021
0
25.Efficient Algorithms for Large Prime Characteristic Fields and Their Application to Bilinear Pairings and Supersingular Isogeny-Based Protocols Patrick Longa. 2022
0

Videos