Date
Apr 21, 2022 12:00 AM
Event
Location
Amsterdam, Netherlands
This presentation is about how to efficiently express a pairing a Rank-1 Constraint System (R1CS) arithmetic circuit. The goal is to reduce the time complexity to SNARK prove a bilinear pairing. A corresponding research paper will be soon available on ePrint.
Youssef El Housni
Cryptography engineer at ConsenSys (NYC, USA)
My research interests include applied cryptography for privacy-preserving blockchain applications.