Sciweavers

181 search results - page 5 / 37
» Programming Language Techniques for Cryptographic Proofs
Sort
View
CCS
2008
ACM
13 years 7 months ago
Minimal backups of cryptographic protocol runs
As cryptographic protocols execute they accumulate information such as values and keys, and evidence of properties about this information. As execution proceeds, new information b...
Jay A. McCarthy, Shriram Krishnamurthi
PPPJ
2003
ACM
13 years 10 months ago
A Java implemented key collision attack on the data encryption standard (DES)
A Java implementation of a key collision attack on DES suggested by Eli Biham, [1], is discussed. Storage space minimization and fast searching techniques to speed up the attack a...
John Loughran, Tom Dowling
POPL
2007
ACM
14 years 5 months ago
Modular verification of a non-blocking stack
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
Matthew J. Parkinson, Richard Bornat, Peter W. O'H...
ESOP
2005
Springer
13 years 10 months ago
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Véronique Cortier, Bogdan Warinschi
PPDP
2005
Springer
13 years 10 months ago
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
Véronique Cortier, Michaël Rusinowitch...