Keeping Secrets in Resource Aware Components

DOI10.1016/j.entcs.2007.07.006zbMath1279.68253OpenAlexW2134519120MaRDI QIDQ2870285

Mohammad Torabi Dashti, Tom Chothia, Jun Pang

Publication date: 17 January 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.07.006

zbMATH Keywords

quality of service\(\mu\)CRLsecrecycomponent-based systemsautomatic checkingQ-automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• mCRL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal paths in weighted timed automata
• Improved undecidability results on weighted timed automata
• A calculus of communicating systems
• A theory of timed automata
• On the definition of a family of automata
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• A Framework for Automatically Checking Anonymity with μCRL
• Relating Two Standard Notions of Secrecy
• Semiring-based constraint satisfaction and optimization
• Examining smart-card security under the threat of power analysis attacks

This page was built for publication: Keeping Secrets in Resource Aware Components