On Progressive and Efficient Verification of Digital Signatures
Abstract
Common verification procedures for digital signatures return a decision (accept/reject) only at the very end of the execution. If interrupted prematurely, however, the verification process cannot infer any meaningful information about the validity of the given signature. This limitation is due to the algorithm design solely, and it is not inherit to signature verification. In this talk, I will present a formal framework to handle interruptions during signature verification and a generic way to devise alternative verification procedures that progressively build confidence on the final decision. Our transformation applies to a wide range of post-quantum secure schemes including the NIST finalist Rainbow.
For more details see: https://eprint.iacr.org/2021/832.pdf
Elena Pagnin is currently an assistant professor at Lund University (Sweden). Here she is an active member of the CRYSPY lab (CRYptography Security and PrivacY). Her research is focused on cryptography and security, with a special interest for homomorphic cryptosystems, data authentication and user privacy. Prior to joining Lund University, Elena has been a post doctoral researcher in the crypto group at Aarhus University (Denmark). Elena completed her PhD at Chalmers (Göteborg, Sweden) in 2019. Her motto is: det är lätt att vara efterklok (it’s easy to be wise in hindsight).