[2/27/24, 11:00 AM EST] CSRC has been experiencing technical issues. If you are unable to access a CSRC page or resource, or get a 503 error, please try reloading the page several times--it may help to wait a few minutes before trying again. We apologize for the inconvenience, and hope to have a solution in place next week.
Joint work with Fabien Laguillaumie.
Abstract: More than 30 years ago, Buchmann and Williams proposed using ideal class groups of imaginary quadratic fields in cryptography with a Diffie-Hellman style key exchange protocol. After several twists, there has been in recent years a new interest in this area. This rebirth is mainly due to two features. First, class groups of imaginary quadratic fields allow the design of cryptographic protocols that do not require a trusted setup. This particularity has been used for example to build cryptographic accumulators and verifiable delay functions. Secondly, using these groups, we proposed with Fabien Laguillaumie in 2015 a versatile encryption scheme, linearly homomorphic modulo a prime that has found many applications, for instance in secure two-party computation. In this talk, I will give an overview of cryptography based on class groups of imaginary quadratic fields, present our encryption scheme and discuss applications.
Related paper: ia.cr/2015/047