Verified Security of BLT Signature Scheme
The majority of real-world applications of digital signatures use timestamping to ensure non-repudiation in face of possible key revocations. This observation led Buldas, Laanoja, and Truu to a server-assisted digital signature scheme built around cryptographic timestamping. In this paper, we report on the machine-checked proofs of existential unforgeability under the chosen-message attack (EUF-CMA) of some variations of BLT digital signature scheme. The proofs are developed and verified using the EasyCrypt framework, which provides interactive theorem proving supported by the state-of-the-art SMT solvers.
Tue 21 JanDisplayed time zone: Saskatchewan, Central America change
11:45 - 12:30
|Formalising Oblivious Transfer in the Semi-Honest and Malicious Model in CryptHOL|
David Butler Alan Turing Institute, David Aspinall University of Edinburgh, Adria Gascon Alan Turing InstituteDOI Pre-print Media Attached
|Verified Security of BLT Signature Scheme|
Denis Firsov Guardtime AS, Ahto Buldas Tallinn University of Technology, Ahto Truu Guardtime AS, Risto Laanoja Guardtime ASDOI Pre-print Media Attached File Attached