Automated Cryptographic Analysis of the Pedersen Commitment Scheme [chapter]

Roberto Metere, Changyu Dong
2017 Lecture Notes in Computer Science  
Aiming for strong security assurance, recently there has been an increasing interest in formal verification of cryptographic constructions. This paper presents a mechanised formal verification of the popular Pedersen commitment protocol, proving its security properties of correctness, perfect hiding, and computational binding. To formally verify the protocol, we extended the theory of EasyCrypt, a framework which allows for reasoning in the computational model, to support the discrete logarithm
more » ... and an abstraction of commitment protocols. Commitments are building blocks of many cryptographic constructions, for example, verifiable secret sharing, zero-knowledge proofs, and e-voting. Our work paves the way for the verification of those more complex constructions.
doi:10.1007/978-3-319-65127-9_22 fatcat:lc2ro2rlzvd4jfmek2hdnu5grq