ecc 
Papers (13)
| # | Title | |
| 1. | Fast and simple constant-time hashing to the BLS12-381 elliptic curve Wahby, Riad S and Boneh, Dan. 2019. | |
| 2. | A survey of elliptic curves for proof systems Aranha, Diego F and El Housni, Youssef and Guillevic, Aurore. 2022. | |
| 3. | Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition Youssef El Housni and Aurore Guillevic. 2020. | |
| 4. | Families of SNARK-friendly 2-chains of elliptic curves El Housni, Youssef and Guillevic, Aurore. 2021. | |
| 5. | 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. | |
| 6. | Revisiting the Nova Proof System on a Cycle of Curves Wilson Nguyen and Dan Boneh and Srinath Setty. 2023. | |
| 7. | Bandersnatch: a fast elliptic curve built over the BLS12-381 scalar field Simon Masson and Antonio Sanso and Zhenfei Zhang. 2021. | |
| 8. | Revisiting cycles of pairing-friendly elliptic curves Marta Bellés-Muñoz and Jorge Jiménez Urroz and Javier Silva. 2022. | |
| 9. | Efficient Isogeny Proofs Using Generic Techniques Kelong Cong and Yi-Fu Lai and Shai Levin. 2023. | |
| 10. | 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. | |
| 11. | $\mu$Cash: Transparent Anonymous Transactions Liam Eagen. 2022. | |
| 12. | The Arithmetic of Pairing-Based Proof Systems El Housni, Youssef. 2022. | |
| 13. | EdMSM: Multi-Scalar-Multiplication for recursive SNARKs and more Youssef EL Housni and Gautam Botrel. 2022. |
Videos