A probabilistic poly-time framework for protocol analysis
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
A calculus for cryptographic protocols
Information and Computation
Secrecy by typing in security protocols
Journal of the ACM (JACM)
Using encryption for authentication in large networks of computers
Communications of the ACM
The faithfulness of abstract protocol analysis: message authentication
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Universally composable two-party and multi-party secure computation
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Formal Eavesdropping and Its Computational Interpretation
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
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
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Relations Among Notions of Security for Public-Key Encryption Schemes
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Universally Composable Notions of Key Exchange and Secure Channels
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Secrecy types for asymmetric communication
Theoretical Computer Science - Foundations of software science and computation structures
Typing correspondence assertions for communication protocols
Theoretical Computer Science
A Concrete Security Treatment of Symmetric Encryption
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
A composable cryptographic library with nested operations
Proceedings of the 10th ACM conference on Computer and communications security
Authenticity by typing for security protocols
Journal of Computer Security - Special issue on CSFW14
Symmetric Encryption in a Simulatable Dolev-Yao Style Cryptographic Library
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Analyzing security protocols with secrecy types and logic programs
Journal of the ACM (JACM)
Relating Symbolic and Cryptographic Secrecy
SP '05 Proceedings of the 2005 IEEE Symposium on Security and Privacy
Types and effects for asymmetric cryptographic protocols
Journal of Computer Security - Special issue on CSFW15
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Handling encryption in an analysis for secure information flow
ESOP'03 Proceedings of the 12th European conference on Programming
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
Formal methods for cryptographic protocol analysis: emerging issues and trends
IEEE Journal on Selected Areas in Communications
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
Universally composable and forward-secure RFID authentication and authenticated key exchange
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Cryptographically sound implementations for typed information-flow security
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computationally sound mechanized proofs for basic and public-key Kerberos
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Information flow security of multi-threaded distributed programs
Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security
Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Universally Composable RFID Identification and Authentication Protocols
ACM Transactions on Information and System Security (TISSEC)
Security Abstractions and Intruder Models (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
CoSP: a general framework for computational soundness proofs
Proceedings of the 16th ACM conference on Computer and communications security
Channel abstractions for network security†
Mathematical Structures in Computer Science
Application of dependency graphs to security protocol analysis
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Adversaries and information leaks (Tutorial)
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Security protocols: principles and calculi tutorial notes
Foundations of security analysis and design IV
Computational soundness of symbolic zero-knowledge proofs
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems
Journal of Automated Reasoning
Modular code-based cryptographic verification
Proceedings of the 18th ACM conference on Computer and communications security
Cryptographically sound implementations for communicating processes
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
A user interface for a game-based protocol verification tool
FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Verified Cryptographic Implementations for TLS
ACM Transactions on Information and System Security (TISSEC) - Special Issue on Computer and Communications 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
Towards provable security for ubiquitous applications
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Computational secrecy by typing for the pi calculus
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Security protocol verification: symbolic and computational models
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Adaptive soundness of static equivalence
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
| Hi-index | 0.00 |
We present a type system for checking secrecy of messages handled by protocols that use the Backes-Pfitzmann-Waidner library for cryptographic operations. A secure realization of this library exists, therefore we obtain for the first time a cryptographically sound analysis for a full language for expressing protocols, particularly handling symmetric encryption and unbounded number of sessions. The language is similar to the spi-calculus, but has a completely deterministic semantics. The type system is similar to the Abadi-Blanchet type system for asymmetric communication.