In recent years, the cryptographic community has made remarkable strides in developing efficient post-quantum digital signature schemes. As new applications emerge, there is an increasing demand for advanced functionalities, such as aggregate signatures and threshold signatures. This is especially pressing in light of the ongoing transition to post-quantum cryptographic systems, with organizations like NIST calling for multi-party threshold schemes. In this talk, we will explore the current landscape of aggregate and threshold signatures based on lattice-based assumptions. We will delve into the technical challenges associated with adapting and optimizing NIST-standardized post-quantum schemes for these advanced functionalities.
We will then provide an overview of our most recent results: 1) a two-round threshold signature scheme from the standard (module) learning with errors assumption in the random oracle model (IEEE S&P '25, joint work with Cecilia Boschini, Darya Kaviani, Russell W. F. Lai, Giulio Malavolta, and Mehdi Tibouchi), and 2) a non-interactive aggregate signature scheme compatible with the standardized Falcon hash-and-sign signatures (CRYPTO '24, joint work with Marius A. Aardal, Diego F. Aranha, Katharina Boudgoust, and Sebastian Kolby).
De Akira Takahashi
De Bill Newhouse
De Hubert Le Van Gong
De Reza Azarderakhsh
De Gilles Seghaier
De Thomas Prest
De Markku-Juhani O. Saarinen
De Kris Gaj
De Mehrnoosh Sadrzadeh
De Pouria Fallahpour
De Javad Shabani
