Sciweavers

1777 search results - page 14 / 356
» Programming Cryptographic Protocols
Sort
View
CSFW
1999
IEEE
14 years 27 days 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
SAS
1999
Springer
117views Formal Methods» more  SAS 1999»
14 years 25 days ago
Abstracting Cryptographic Protocols with Tree Automata
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
David Monniaux
TOCL
2008
102views more  TOCL 2008»
13 years 8 months ago
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying
Cryptographic protocols with single blind copying were defined and modeled by Comon and Cortier using the new class C of first order clauses, which extends the Skolem class. They s...
Helmut Seidl, Kumar Neeraj Verma
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 8 months ago
Sequential Rationality in Cryptographic Protocols
Much of the literature on rational cryptography focuses on analyzing the strategic properties of cryptographic protocols. However, due to the presence of computationallybounded pl...
Ronen Gradwohl, Noam Livne, Alon Rosen
CCS
2001
ACM
14 years 1 months ago
Constraint solving for bounded-process cryptographic protocol analysis
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.
Jonathan K. Millen, Vitaly Shmatikov