Sciweavers

Share
261 search results - page 1 / 53
» Machine-Checked Security Proofs of Cryptographic Signature S...
Sort
View
ESORICS
2005
Springer
10 years 4 months ago
Machine-Checked Security Proofs of Cryptographic Signature Schemes
Abstract. Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....
Sabrina Tarento
CSFW
2010
IEEE
10 years 2 months ago
A Machine-Checked Formalization of Sigma-Protocols
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
Gilles Barthe, Daniel Hedin, Santiago Zanella B&ea...
TYPES
2004
Springer
10 years 4 months ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento
IJNSEC
2011
143views more  IJNSEC 2011»
9 years 5 months ago
Probable Security Proof of A Blind Signature Scheme over Braid Groups
In this paper, we reinvestigate the security analysis of blind signature scheme over braid groups proposed by Verma in 2008. A blind signature scheme is a cryptographic primitive ...
Girraj Kumar Verma
SP
2009
IEEE
114views Security Privacy» more  SP 2009»
10 years 5 months ago
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 ...
Santiago Zanella Béguelin, Gilles Barthe, B...
books