Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A composable cryptographic library with nested operations
Proceedings of the 10th ACM conference on Computer and communications security
Symmetric Encryption in a Simulatable Dolev-Yao Style Cryptographic Library
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption
CSFW '05 Proceedings of the 18th IEEE workshop on Computer Security Foundations
Deciding security of protocols against off-line guessing attacks
Proceedings of the 12th ACM conference on Computer and communications security
A Computationally Sound Mechanized Prover for Security Protocols
SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
A survey of algebraic properties used in cryptographic protocols
Journal of Computer Security
Completeness theorems for the Abadi-Rogaway language of encrypted expressions
Journal of Computer Security - Special issue on WITS'02
Computational soundness of observational equivalence
Proceedings of the 15th ACM conference on Computer and communications security
Analysing Password Protocol Security Against Off-line Dictionary Attacks
Electronic Notes in Theoretical Computer Science (ENTCS)
Invertible universal hashing and the TET encryption mode
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Computational soundness of formal indistinguishability and static equivalence
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
About the security of ciphers (semantic security and pseudo-random permutations)
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Guessing attacks and the computational soundness of static equivalence
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Probabilistic polynomial-time semantics for a protocol security logic
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Computationally sound implementations of equational theories against passive adversaries
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Password-based encryption analyzed
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Computationally sound, automated proofs for security protocols
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Completing the picture: soundness of formal encryption in the presence of active adversaries
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Limits of the cryptographic realization of dolev-yao-style XOR
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Soundness of formal encryption in the presence of key-cycles
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Universally composable symbolic analysis of mutual authentication and key-exchange protocols
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Adaptive soundness of static equivalence
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Guessing attacks and the computational soundness of static equivalence
Journal of Computer Security
On the equality of probabilistic terms
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems
Journal of Automated Reasoning
Reducing Equational Theories for the Decision of Static Equivalence
Journal of Automated Reasoning
Reducing equational theories for the decision of static equivalence
ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
Fully automated analysis of padding-based encryption in the computational model
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Hi-index | 0.00 |
In this paper we study the link between formal and cryptographic models for security protocols in the presence of passive adversaries. In contrast to other works, we do not consider a fixed set of primitives but aim at results for arbitrary equational theories. We define a framework for comparing a cryptographic implementation and its idealization with respect to various security notions. In particular, we concentrate on the computational soundness of static equivalence, a standard tool in cryptographic pi calculi. We present a soundness criterion, which for many theories is not only sufficient but also necessary. Finally, to illustrate our framework, we establish the soundness of static equivalence for the exclusive OR and a theory of ciphers and lists.