14 search results - page 1 / 3 » A Machine-Checked Formalization of Sigma-Protocols |
CSFW
2010
IEEE
13 years 8 months ago
2010
IEEE
—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...
ITP
2010
13 years 3 months ago
2010
mentation of the Abstraction Method In Coq Eelis van der Weegen Institute for Computing and Information Sciences Raboud University Nijmegen This technical report documents our deve...
TYPES
2004
Springer
13 years 10 months ago
2004
Springer
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...
FMICS
2007
Springer
13 years 10 months ago
2007
Springer
Using PVS (Prototype Verification System), we prove that an industry designed scheduler for a smartcard personalization machine is safe and optimal. This scheduler has previously ...
CADE
2004
Springer
14 years 4 months ago
2004
Springer