Formally Certifying the Security of Digital Signature Schemes

We present two machine-checked proofs of the existential unforgeability under adaptive chosen-message attacks of the Full Domain Hash signature scheme. These proofs formalize the original argument of Bellare and Rogaway, and an optimal reduction by Coron that provides a tighter bound on the probability of a forgery. Both proofs are developed using CertiCrypt, a general framework to formalize exact security proofs of cryptographic systems in the computational model. Since CertiCrypt is implemented on top of the Coq proof assistant, the proofs are highly trustworthy and can be verified independently and fully automatically.

• Type: Conference
• Year: 2009
• Where: SP
• Authors: Santiago Zanella Béguelin, Gilles Barthe, Benjamin Grégoire, Federico Olmedo
• Keywords: Exact Security Proofs, Hash Signature Scheme, Machine-checked Proofs, Security Privacy, SP 2009