Pairing-free threshold signatures and their lattice-based analogs
- Chenzhi Zhu, University of Washington,
- Time: 2025-01-06 15:00
- Host: Dr. Tianren Liu
- Venue: Room 204, Courtyard No.5, Jingyuan
Abstract
Threshold signature schemes allow the signing key to be distributed among a group of signers, with a signature being issued if and only if a threshold number of signers are involved. These schemes have gained significant attention recently, particularly for their use in cryptocurrency wallets to mitigate single points of failure, as well as for ongoing standardization efforts by NIST. I will first go through the state-of-the-art construction based on pairing-free elliptic curves, which are highly desirable for real-world applications due to strong library support compared to pairing-based constructions and smaller signature sizes compared to RSA-based schemes. Then, I will explain how to transform these pairing-free constructions into efficient lattice-based alternatives.
Biography
Chenzhi Zhu is a fifth-year Ph.D. student in the Cryptography Group at the Paul G. Allen School of Computer Science & Engineering, University of Washington, advised by Stefano Tessaro. He earned his bachelor’s degree from the Yao Class at Tsinghua University. His research focuses on the design of practically efficient cryptographic protocols that have real-world impacts. In particular, his work on blind signatures and threshold signatures has been published in top conferences such as Crypto and Eurocrypt and has contributed to standardization efforts in these areas.