Sciweavers

227 search results - page 4 / 46
» On the Reachability Problem in Cryptographic Protocols
Sort
View
ESOP
2009
Springer
13 years 11 months ago
Type-Based Automated Verification of Authenticity in Cryptographic Protocols
Gordon and Jeffrey have proposed a type and effect system for checking authenticity in cryptographic protocols. The type system reduces the protocol verification problem to the typ...
Daisuke Kikuchi, Naoki Kobayashi
TOCL
2008
102views more  TOCL 2008»
13 years 7 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
IPL
2010
93views more  IPL 2010»
13 years 6 months ago
Compiling and securing cryptographic protocols
Protocol narrations are widely used in security as semi-formal notations to specify conversations between roles. We define a translation from a protocol narration to the sequence...
Yannick Chevalier, Michaël Rusinowitch
MMMACNS
2001
Springer
13 years 12 months ago
Open Issues in Formal Methods for Cryptographic Protocol Analysis
The history of the application of formal methods to cryptographic protocol analysis spans nearly twenty years, and recently has been showing signs of new maturity and consolidatio...
Catherine Meadows
CRYPTO
2005
Springer
83views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
A Practical Attack on a Braid Group Based Cryptographic Protocol
In this paper we present a practical heuristic attack on the Ko, Lee et al. key exchange protocol introduced at Crypto 2000 [10]. One of the ideas behind our attack is using Dehorn...
Alexei G. Myasnikov, Vladimir Shpilrain, Alexander...