Skip to main content
Article thumbnail
Location of Repository

Formally Certifying the Security of Digital Signature Schemes

By Santiago Zanella Béguelin, Benjamin Grégoire, Gilles Barthe and Federico Olmedo


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

Year: 2011
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • http://oakland09.cs.virginia.e... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.