Sciweavers

47 search results - page 2 / 10
» A Method for Automatic Cryptographic Protocol Verification
Sort
View
FUIN
2006
142views more  FUIN 2006»
13 years 5 months ago
Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol
Abstract. We analyse different versions of the Dining Cryptographers protocol by means of automatic verification via model checking. Specifically we model the protocol in terms of ...
Magdalena Kacprzak, Alessio Lomuscio, Artur Niewia...
BIRTHDAY
2006
Springer
13 years 9 months ago
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses
We consider secrecy problems for cryptographic protocols modeled using Horn clauses and present general classes of Horn clauses which can be efficiently decided. Besides simplifyin...
Helmut Seidl, Kumar Neeraj Verma
IPL
2006
118views more  IPL 2006»
13 years 5 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
CORR
2011
Springer
175views Education» more  CORR 2011»
12 years 9 months ago
Extracting and Verifying Cryptographic Models from C Protocol Code by Symbolic Execution
Consider the problem of verifying security properties of a cryptographic protocol coded in C. We propose an automatic solution that needs neither a pre-existing protocol descripti...
Mihhail Aizatulin, Andrew D. Gordon, Jan Jürj...
CAV
2004
Springer
154views Hardware» more  CAV 2004»
13 years 9 months ago
Automatic Verification of Sequential Consistency for Unbounded Addresses and Data Values
Sequential consistency is the archetypal correctness condition for the memory protocols of shared-memory multiprocessors. Typically, such protocols are parameterized by the number ...
Jesse D. Bingham, Anne Condon, Alan J. Hu, Shaz Qa...