Sciweavers

25 search results - page 3 / 5
» Symbolic Trace Analysis of Cryptographic Protocols
Sort
View
IANDC
2008
105views more  IANDC 2008»
13 years 5 months ago
Symbolic protocol analysis for monoidal equational theories
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
Stéphanie Delaune, Pascal Lafourcade, Denis...
TCC
2005
Springer
163views Cryptology» more  TCC 2005»
13 years 11 months ago
Adaptive Security of Symbolic Encryption
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
Daniele Micciancio, Saurabh Panjwani
JOC
2011
157views more  JOC 2011»
13 years 14 days ago
Universally Composable Symbolic Security Analysis
In light of the growing complexity of cryptographic protocols and applications, it becomes highly desirable to mechanize — and eventually automate — the security analysis of p...
Ran Canetti, Jonathan Herzog
CCS
2009
ACM
14 years 9 days ago
Computational soundness for key exchange protocols with symmetric encryption
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
Ralf Küsters, Max Tuengerthal
ASIAN
2009
Springer
274views Algorithms» more  ASIAN 2009»
13 years 6 months ago
Reducing Equational Theories for the Decision of Static Equivalence
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen