Theoretical Computer Science
Proceedings of the 7th ACM conference on Computer and communications security
SAC '98 Proceedings of the Selected Areas in Cryptography
A Practical Implementation of the Timing Attack
CARDIS '98 Proceedings of the The International Conference on Smart Card Research and Applications
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
A simple framework for real-time cryptographic protocol analysis with compositional proof rules
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Timing analysis of keystrokes and timing attacks on SSH
SSYM'01 Proceedings of the 10th conference on USENIX Security Symposium - Volume 10
Modeling long–running transactions with communicating hierarchical timed automata
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Opacity generalised to transition systems
FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust
| Hi-index | 0.00 |
Communicating Hierarchical Transaction-based Timed Automata have been introduced to model systems performing long-running transactions. Here, for these automata a security concept is introduced, which is based on a notion of opacity and on the assumption that an attacker can not only observe public system activities, but also cause abortion of some of them. Different intruder capabilities as well as different kinds of opacity are defined and the resulting security properties are investigated. Security of long-running transactions is defined by the mentioned notion of opacity and conditions for compositionality are established.