Communication and concurrency
Transition system specifications with negative premises
Theoretical Computer Science
Information and Computation
SPINS: security protocols for sensor networks
Wireless Networks
A comparison of three authentication properties
Theoretical Computer Science - Special issue: Algebraic methodology and software technology
Extending Process Languages with Time
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Analysing Time Dependent Security Properties in CSP Using PVS
ESORICS '00 Proceedings of the 6th European Symposium on Research in Computer Security
Analysing a Stream Authentication Protocol Using Model Checking
ESORICS '02 Proceedings of the 7th European Symposium on Research in Computer Security
On Compositional Reasoning in the Spi-calculus
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
A Hierarchy of Authentication Specifications
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Protocol Independence through Disjoint Encryption
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
Efficient Authentication and Signing of Multicast Streams over Lossy Channels
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Authenticity in a reliable protocol for mobile computing
Proceedings of the 2003 ACM symposium on Applied computing
Real-time information flow analysis
IEEE Journal on Selected Areas in Communications
Automated Synthesis of Enforcing Mechanisms for Security Properties in a Timed Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
Observation Based System Security
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
Constraint Abstraction in Verification of Security Protocols
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Formal Models and Analysis of Secure Multicast in Wired and Wireless Networks
Journal of Automated Reasoning
Probabilistic Information Flow Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Security in a Model for Long-running Transactions
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Quantifying Security for Timed Process Algebras
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Securing Statically-verified Communications Protocols Against Timing Attacks
Electronic Notes in Theoretical Computer Science (ENTCS)
Information-flow attacks based on limited observations
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Fast certificate-based authentication scheme in multi-operator maintained wireless mesh networks
Computer Communications
Constraints solution for time sensitive security protocols
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Timed calculus of cryptographic communication
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Synthesis of web services orchestrators in a timed setting
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
Process Algebra Contexts and Security Properties
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
A calculus for the analysis of wireless network security protocols
FAST'10 Proceedings of the 7th International conference on Formal aspects of security and trust
A team automaton scenario for the analysis of security properties of communication protocols
Journal of Automata, Languages and Combinatorics
A semantic analysis of wireless network security protocols
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Gained and Excluded Private Actions by Process Observations
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Quantifying Security for Timed Process Algebras
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Probabilistic Information Flow Security
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Security in a Model for Long-running Transactions
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Observation Based System Security
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
A semantic analysis of key management protocols for wireless sensor networks
Science of Computer Programming
Informational Analysis of Security and Integrity
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
| Hi-index | 0.00 |
A real-time process algebra, enhanced with specific constructs for handling cryptographic primitives, is proposed to model cryptographic protocols in a simple way. We show that some security properties, such as authentication and secrecy, can be re-formulated in this timed setting. Moreover, we show that they can be seen as suitable instances of a general information flow-like scheme, called timed generalized non-deducibility on compositions (tGNDC), parametric w.r.t. the observational semantics of interest. We show that, when considering timed trace semantics. there exists a most powerful hostile environment (or enemy) that can try to compromise the protocol. Moreover, we present a couple of compositionality results for tGNDC, one of which is time dependent, and show their usefulness by means of a case study.