216 search results - page 7 / 44 » Formal Proofs for the Security of Signcryption |
CSFW
1999
IEEE
14 years 2 months ago
1999
IEEE
The combination of two security protocols, a simple shared-key communication protocol and the Di e-Hellman key distribution protocol, is modeled formally and proved correct. The m...
ESORICS
2004
Springer
14 years 3 months ago
2004
Springer
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
CCS
2004
ACM
14 years 3 months ago
2004
ACM
Information flow type systems provide an elegant means to enforce confidentiality of programs. Using the proof assistant Isabelle/HOL, we have machine-checked a recent work of B...
IACR
2011
12 years 9 months ago
2011
Abstract. Tampering attacks are cryptanalytic attacks on the implementation of cryptographic algorithms (e.g., smart cards), where an adversary introduces faults with the hope that...
ESORICS
2005
Springer
14 years 3 months ago
2005
Springer
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....