Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
From MaRDI portal
Recommendations
- Analyzing security protocols using time-bounded task-PIOAs
- scientific article; zbMATH DE number 1692932
- A simple framework for real-time cryptographic protocol analysis with compositional proof rules
- A framework for analyzing probabilistic protocols and its application to the partial secrets exchange
- Trustworthy Global Computing
Cited in
(17)- Analyzing security protocols using time-bounded task-PIOAs
- On the relationships between notions of simulation-based security
- Task-structured probabilistic I/O automata
- The IITM model: a simple and expressive model for universal composability
- Joint state composition theorems for public-key encryption and digital signature functionalities with local computation
- Polynomial runtime and composability
- The reactive simulatability (RSIM) framework for asynchronous systems
- Formal modeling of random oracle programmability and verification of signature unforgeability using task-PIOAs
- On the security of long-lived archiving systems based on the evidence record syntax
- Universal composition with responsive environments
- Bisimulation for Demonic Schedulers
- A survey of symbolic methods in computational analysis of cryptographic systems
- The Layered Games Framework for Specifications and Analysis of Security Protocols
- Information hiding in probabilistic concurrent systems
- Relationship of Three Cryptographic Channels in the UC Framework
- Reconciling quantum theory and process equivalence via physically admissible schedulers
- Making random choices invisible to the scheduler
This page was built for publication: Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524308)
