A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
A probabilistic poly-time framework for protocol analysis
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Semantics and Program Analysis of Computationally Secure Information Flow
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Encryption-Scheme Security in the Presence of Key-Dependent Messages
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
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
Security analysis of cryptographically controlled access to XML documents
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Cryptographically Sound Dolev-Yao Style Security Proof of an Electronic Payment System
CSFW '05 Proceedings of the 18th 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
Relating Symbolic and Cryptographic Secrecy
IEEE Transactions on Dependable and Secure Computing
Secrecy types for a simulatable cryptographic library
Proceedings of the 12th ACM conference on Computer and communications security
Towards computationally sound symbolic analysis of key exchange protocols
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
A Computationally Sound Mechanized Prover for Security Protocols
SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Theoretical Computer Science
A computational analysis of the Needham-Schroeder-(Lowe) protocol
Journal of Computer Security
Coercion-Resistance and Receipt-Freeness in Electronic Voting
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Cryptographically Sound Theorem Proving
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Computationally Sound Compositional Logic for Key Exchange Protocols
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Secure information flow with random assignment and encryption
Proceedings of the fourth ACM workshop on Formal methods in security
Computationally sound secrecy proofs by mechanized flow analysis
Proceedings of the 13th ACM conference on Computer and communications security
A computational interpretation of Dolev-Yao adversaries
Theoretical Computer Science - Theoretical foundations of security analysis and design II
Protocol Composition Logic (PCL)
Electronic Notes in Theoretical Computer Science (ENTCS)
Computationally Sound Mechanized Proofs of Correspondence Assertions
CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Computational Soundness of Symbolic Analysis for Protocols Using Hash Functions
Electronic Notes in Theoretical Computer Science (ENTCS)
Completeness theorems for the Abadi-Rogaway language of encrypted expressions
Journal of Computer Security - Special issue on WITS'02
The reactive simulatability (RSIM) framework for asynchronous systems
Information and Computation
Controlling access to published data using cryptography
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Cryptographically sound implementations for typed information-flow security
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the computational soundness of cryptographically masked flows
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Security analysis of cryptographically controlled access to XML documents
Journal of the ACM (JACM)
Sound and complete computational interpretation of symbolic hashes in the standard model
Theoretical Computer Science
Computationally sound mechanized proofs for basic and public-key Kerberos
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Cryptographically-Sound Protocol-Model Abstractions
CSF '08 Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
Computational Soundness of Symbolic Zero-Knowledge Proofs Against Active Attackers
CSF '08 Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
CSF '08 Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
Cryptographically-Sound Protocol-Model Abstractions
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
On the Relationships between Notions of Simulation-Based Security
Journal of Cryptology
Inductive Proofs of Computational Secrecy
ESORICS '07 Proceedings of the 12th European symposium on Research In Computer Security
Circular-Secure Encryption from Decision Diffie-Hellman
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Journal of Computer Security - 20th IEEE Computer Security Foundations Symposium (CSF)
Computational soundness of observational equivalence
Proceedings of the 15th ACM conference on Computer and communications security
Towards automated proofs for asymmetric encryption schemes in the random oracle model
Proceedings of the 15th ACM conference on Computer and communications security
A Computationally Sound Mechanized Prover for Security Protocols
IEEE Transactions on Dependable and Secure Computing
Computationally sound implementations of equational theories against passive adversaries
Information and Computation
Handling encryption in an analysis for secure information flow
ESOP'03 Proceedings of the 12th European conference on Programming
Cryptography in the multi-string model
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
A generalization of DDH with applications to protocol analysis and computational soundness
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
On simulatability soundness and mapping soundness of symbolic cryptography
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Computationally sound typing for non-interference: the case of deterministic encryption
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
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
Computational soundness of non-malleable commitments
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
Formal proofs of cryptographic security of Diffie-Hellman-based protocols
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Computationally sound analysis of protocols using bilinear pairings
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
Cryptographically-Masked flows
SAS'06 Proceedings of the 13th international conference on Static Analysis
Deciding key cycles for security protocols
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Computationally sound symbolic secrecy in the presence of hash functions
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
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
Symbolic and cryptographic analysis of the secure WS-ReliableMessaging scenario
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Cryptographically sound implementations for communicating processes
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
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
Time-bounded task-PIOAs: a framework for analyzing security protocols
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Adaptive security of symbolic encryption
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
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
A type system for computationally secure information flow
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Machine-checked security proofs of cryptographic signature schemes
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
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
Cryptographically sound security proofs for basic and public-key kerberos
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Limits of the BRSIM/UC soundness of dolev-yao models with hashes
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Automated security proofs with sequences of games
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Sound computational interpretation of symbolic hashes in the standard model
IWSEC'06 Proceedings of the 1st international conference on Security
Computational secrecy by typing for the pi calculus
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Universally composable symbolic analysis of mutual authentication and key-exchange protocols
TCC'06 Proceedings of the Third conference on Theory of Cryptography
A cryptographically sound security proof of the Needham-Schroeder-Lowe public-key protocol
IEEE Journal on Selected Areas in Communications
Adaptive soundness of static equivalence
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Logical formalisation and analysis of the mifare classic card in PVS
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
A composable computational soundness notion
Proceedings of the 18th ACM conference on Computer and communications security
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
A computational indistinguishability logic for the bounded storage model
FPS'11 Proceedings of the 4th Canada-France MITACS conference on Foundations and Practice of Security
Security protocol verification: symbolic and computational models
POST'12 Proceedings of the First international conference on Principles of Security and Trust
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Information Sciences: an International Journal
Computational soundness without protocol restrictions
Proceedings of the 2012 ACM conference on Computer and communications security
Computational verification of C protocol implementations by symbolic execution
Proceedings of the 2012 ACM conference on Computer and communications security
Verified security of redundancy-free encryption from Rabin and RSA
Proceedings of the 2012 ACM conference on Computer and communications security
Fully automated analysis of padding-based encryption in the computational model
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Deduction soundness: prove one, get five for free
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
A new hierarchical and scalable group key exchange protocol with XOR operation
International Journal of Wireless and Mobile Computing
Hi-index | 0.00 |
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 probability. This approach captures a strong notion of security, guaranteed against all probabilistic polynomial-time attacks. The other approach relies on a symbolic model of protocol executions in which cryptographic primitives are treated as black boxes. Since the seminal work of Dolev and Yao, it has been realized that this latter approach enables significantly simpler and often automated proofs. However, the guarantees that it offers with respect to the more detailed computational models have been quite unclear. For more than 20 years the two approaches have coexisted but evolved mostly independently. Recently, significant research efforts attempt to develop paradigms for cryptographic systems analysis that combines the best of both worlds. There are two broad directions that have been followed. Computational soundness aims to establish sufficient conditions under which results obtained using symbolic models imply security under computational models. The direct approach aims to apply the principles and the techniques developed in the context of symbolic models directly to computational ones. In this paper we survey existing results along both of these directions. Our goal is to provide a rather complete summary that could act as a quick reference for researchers who want to contribute to the field, want to make use of existing results, or just want to get a better picture of what results already exist.