Soundness of Formal Encryption in the Presence of Active Adversaries (original) (raw)
Related papers
Computationally Sound, Automated Proofs for Security Protocols
Lecture Notes in Computer Science, 2005
Completing the Picture: Soundness of Formal Encryption in the Presence of Active Adversaries
Lecture Notes in Computer Science, 2005
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
2005
Logics of Knowledge and Cryptography: Completeness and Expressiveness
Prof. Olalekan Lekings Abdulrasheed Ogunjimi
Logics of Knowledge and Cryptography- Completeness and Expressiveness, 2013
Computational soundness without protocol restrictions
Proceedings of the 2012 ACM conference on Computer and communications security - CCS '12, 2012
A Complete Axiomatization of Knowledge and Cryptography
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007
Towards Producing Formally Checkable Security Proofs, Automatically
2008 21st IEEE Computer Security Foundations Symposium, 2008
Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols
Lecture Notes in Computer Science, 2009
Inductive Proofs of Computational Secrecy
2007
Computationally Sound Compositional Logic for Key Exchange Protocols
2006
HERMES: An Automatic Tool for Verification of Secrecy in Security Protocols
Lecture Notes in Computer Science, 2003
Inductive Proof Method for Computational Secrecy
On Symbolic Analysis of Cryptographic Protocols
2005
The inductive approach to verifying cryptographic protocols
Proving secrecy is easy enough
2001
Automated Proofs for Asymmetric Encryption
Journal of Automated Reasoning, 2011
Secrecy-Oriented First-Order Logical Analysis of Cryptographic Protocols
2010
Automated Proofs for Asymmetric Encryption: First results in the random oracle model
2008
SECURITY ANALYSIS OF NETWORK PROTOCOLS: COMPOSITIONAL REASONING AND COMPLEXITY-THEORETIC FOUNDATIONS
2005
Sound Computational Interpretation of Formal Encryption with Composed Keys
Information Security and Cryptology - ICISC 2003, 2004
Proving secure properties of cryptographic protocols with knowledge based approach
2005
Towards automated proofs for asymmetric encryption schemes in the random oracle model
Proceedings of the 15th ACM conference on Computer and communications security - CCS '08, 2008
Computational Semantics for Basic Protocol Logic – A Stochastic Approach
Lecture Notes in Computer Science
Computationally complete symbolic attacker and key exchange
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13, 2013
Formal Methods and Cryptography
Lecture Notes in Computer Science, 2006
Cryptographically Sound Theorem Proving
19th IEEE Computer Security Foundations Workshop (CSFW'06), 2006
On the Existence of an Effective and Complete Inference System for Cryptographic Protocols
Lecture Notes in Computer Science, 2004
Secrecy of cryptographic protocols under equational theory
Knowledge-Based Systems, 2009
Formal verification logic for hybrid security protocols
Computer Systems: Science & Engineering, 2003
Proving Properties of Security Protocols by Induction
1997
A Semi-Decidable Procedure for Secrecy in Cryptographic Protocols
Hanane Houmani, Jaouhar Fattahi
Finite models for formal security proofs
Journal of Computer Security, 2010
Approaches to Formal Verification of Security Protocols
Computing Research Repository, 2011
DELP: Dynamic Epistemic Logic for Security Protocols
arXiv (Cornell University), 2021