Sciweavers

239 search results - page 5 / 48
» Proof Techniques for Cryptographic Processes
Sort
View
TCS
2008
13 years 8 months ago
Using bisimulation proof techniques for the analysis of distributed abstract machines
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Damien Pous
ESORICS
2008
Springer
13 years 10 months ago
Cryptographic Protocol Explication and End-Point Projection
Abstract. Cryptographic protocols are useful for engineering trust in transactions. There are several languages for describing these protocols, but these tend to capture the commun...
Jay A. McCarthy, Shriram Krishnamurthi
ASIACRYPT
2000
Springer
14 years 27 days ago
Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques
Rather than use a shared key directly to cryptographically process (e.g. encrypt or authenticate) data one can use it as a master key to derive subkeys, and use the subkeys for the...
Michel Abdalla, Mihir Bellare
SAT
2009
Springer
126views Hardware» more  SAT 2009»
14 years 3 months ago
Extending SAT Solvers to Cryptographic Problems
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain ...
Mate Soos, Karsten Nohl, Claude Castelluccia
FOSSACS
2004
Springer
14 years 1 months ago
Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...
Ajith Ramanathan, John C. Mitchell, Andre Scedrov,...