Lattice-Based Distributed Signature
Lattice-Based Distributed Signature
Most recent works on distributed signatures have focused on ECDSA and over variants of Schnorr signatures. However, little attention has been given to constructions based on post-quantum secure assumptions like the hardness of lattice problems. This talk presents several lattice-based distributed signing protocols with low round complexity following the Fiat–Shamir with aborts paradigm due to Lyubashevsky (Asiacrypt 2009). These constructions can be seen as distributed variants of the fast Dilithium-G signature scheme, or lattice-based counterparts of recent two-round multi-party signing protocol by Drijvers et al. (S&P 2019) in the discrete-log setting. Our result highlights some important similarities and differences which emerge when translating a discrete-log-based protocol to lattice-based one.
About the speaker
PhD student, Aarhus University
Akira Takahashi is currently a PhD student at Cryptography and Security Group, Aarhus University, Denmark. He received M.Sc. and B.Eng. from Kyoto University, Japan. He worked as an intern at NTT Corporation in 2018. His research interests cover implementation attacks and provable countermeasures against public key cryptographic algorithms, and construction of multiparty cryptographic protocols.