The following pages link to Programming Languages and Systems (Q5308709):
Displaying 17 items.
- Deducibility constraints and blind signatures (Q462488) (← links)
- A method for symbolic analysis of security protocols (Q557806) (← links)
- To know or not to know: Epistemic approaches to security protocol verification (Q625717) (← links)
- Intruder deduction problem for locally stable theories with normal forms and inverses (Q683746) (← links)
- Current-state opacity enforcement in discrete event systems under incomparable observations (Q1788686) (← links)
- Modular verification of protocol equivalence in the presence of randomness (Q2167715) (← links)
- Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures (Q2268100) (← links)
- Transducer-based analysis of cryptographic protocols (Q2464141) (← links)
- Hierarchical combination of intruder theories (Q2482450) (← links)
- Model Checking Security Protocols (Q3176380) (← links)
- Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables (Q3631368) (← links)
- Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions (Q3636823) (← links)
- (Q4447230) (← links)
- Scenario-Based Verification of Uncertain MDPs (Q5039513) (← links)
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
- Expander-Based Cryptography Meets Natural Proofs (Q5090391) (← links)
- Limits of the Cryptographic Realization of Dolev-Yao-Style XOR (Q5862666) (← links)