Keeping secrets in resource aware components
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- scientific article; zbMATH DE number 1512618 (Why is no real title available?)
- scientific article; zbMATH DE number 1796138 (Why is no real title available?)
- scientific article; zbMATH DE number 1794367 (Why is no real title available?)
- A Framework for Automatically Checking Anonymity with μCRL
- A calculus of communicating systems
- A theory of timed automata
- Examining smart-card security under the threat of power analysis attacks
- Improved undecidability results on weighted timed automata
- On the definition of a family of automata
- Optimal paths in weighted timed automata
- Relating Two Standard Notions of Secrecy
- Semiring-based constraint satisfaction and optimization
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
This page was built for publication: Keeping secrets in resource aware components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870285)