Sciweavers

659 search results - page 4 / 132
» Compiling and securing cryptographic protocols
Sort
View
CSFW
2009
IEEE
14 years 2 months ago
Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists
Cryptographic protocols are crucial for securing electronic transactions. The confidence in these protocols can be increased by the formal analysis of their security properties. ...
Najah Chridi, Mathieu Turuani, Michaël Rusino...
CSFW
1999
IEEE
13 years 11 months ago
Decision Procedures for the Analysis of Cryptographic Protocols by Logics of Belief
Belief-logic deductions are used in the analysis of cryptographic protocols. We show a new method to decide such logics. In addition to the familiar BAN logic, it is also applicab...
David Monniaux
FSTTCS
2003
Springer
14 years 17 days ago
A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol
We prove the Needham-Schroeder-Lowe public-key protocol secure under real, active cryptographic attacks including concurrent protocol runs. This proof is based on an abstract crypt...
Michael Backes, Birgit Pfitzmann
IWSEC
2007
Springer
14 years 1 months ago
On Security Models and Compilers for Group Key Exchange Protocols
Emmanuel Bresson, Mark Manulis, Jörg Schwenk