Communicating sequential processes
Communicating sequential processes
Prudent Engineering Practice for Cryptographic Protocols
IEEE Transactions on Software Engineering
IEEE Transactions on Software Engineering
Verifying Authentication Protocols in CSP
IEEE Transactions on Software Engineering
A calculus for cryptographic protocols
Information and Computation
Communication and Concurrency
Computer
Message Authentication through Non Interference
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
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
A Hierarchy of Authentication Specifications
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Verifying authentication protocols with CSP
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Formal Analysis of a Non-Repudiation Protocol
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
CVS: A Compiler for the Analysis of Cryptographic Protocols
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Authentication via Localized Names
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Information Flow Analysis in a Discrete-Time Process Algebra
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
A Semantic Model for Authentication Protocols
SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
A fair non-repudiation protocol
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
What do we mean by entity authentication?
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
Proceedings of the 1998 workshop on New security paradigms
Information flow vs. resource access in the asynchronous pi-calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Security Analysis of a Probabilistic Non-repudiation Protocol
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Message Authentication through Non Interference
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
Classification of Security Properties (Part I: Information Flow)
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Probabilistic Information Flow in a Process Algebra
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
CVS at Work: A Report on New Failures upon Some Cryptographic Protocols
MMM-ACNS '01 Proceedings of the International Workshop on Information Assurance in Computer Networks: Methods, Models, and Architectures for Network Security
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Automated Analysis of Some Security Mechanisms of SCEP
ISC '02 Proceedings of the 5th International Conference on Information Security
Noninterference for Concurrent Programs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Information Flow Security in Dynamic Contexts
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
A team automaton scenario for the analysis of security properties of communication protocols
Journal of Automata, Languages and Combinatorics
Recursion versus replication in simple cryptographic protocols
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Static analysis of authentication
Foundations of Security Analysis and Design III
Towards an integrated formal analysis for security and trust
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Supporting Secure Coordination in SecSpaces
Fundamenta Informaticae
| Hi-index | 0.00 |
Many security properties of cryptographic protocols can be all seen as specific instances of a general property, we called Non Deducibility on Composition (NDC), that we proposed a few years ago for studying information flow properties in computer systems. The advantage of our unifying theory is that formal comparison among these properties is now easier and that the full generality of NDC has helped us in finding a few new attacks on cryptographic protocols.