Pages that link to "Item:Q5466517"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5466517):
Displaying 19 items.
- Computing knowledge in security protocols under convergent equational theories (Q437033) (← links)
- Decidability and combination results for two notions of knowledge in security protocols (Q437043) (← links)
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols (Q511946) (← links)
- To know or not to know: Epistemic approaches to security protocol verification (Q625717) (← links)
- Deciding knowledge in security protocols under equational theories (Q860894) (← links)
- Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks (Q861696) (← links)
- Intruder deduction for the equational theory of abelian groups with distributive encryption (Q876047) (← links)
- Computationally sound implementations of equational theories against passive adversaries (Q1013091) (← links)
- Deciding knowledge in security protocols under some e-voting theories (Q3095038) (← links)
- An algebraic approach to the verification of a class of Diffie-Hellman protocols (Q3435341) (← links)
- Deciding Knowledge in Security Protocols for Monoidal Equational Theories (Q3498466) (← links)
- Combining Algorithms for Deciding Knowledge in Security Protocols (Q3525004) (← links)
- (Q4517291) (← links)
- Computing knowledge in equational extensions of subterm convergent theories (Q5139279) (← links)
- (Q5146597) (← links)
- Computing Knowledge in Security Protocols under Convergent Equational Theories (Q5191113) (← links)
- A Logical Characterisation of Static Equivalence (Q5262936) (← links)
- Limits of the Cryptographic Realization of Dolev-Yao-Style XOR (Q5862666) (← links)
- Adversarial reachability for program-level security analysis (Q6535227) (← links)
