Pages that link to "Item:Q3569110"
From MaRDI portal
The following pages link to Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster (Q3569110):
Displaying 13 items.
- Decidability of equivalence of symbolic derivations (Q437031) (← links)
- Computing knowledge in security protocols under convergent equational theories (Q437033) (← links)
- On compositional reasoning about anonymity and privacy in epistemic logic (Q504214) (← links)
- To know or not to know: Epistemic approaches to security protocol verification (Q625717) (← links)
- Modular verification of protocol equivalence in the presence of randomness (Q2167715) (← links)
- POR for security protocol equivalences. Beyond action-determinism (Q2167736) (← links)
- Efficiently deciding equivalence for standard primitives and phases (Q2167745) (← links)
- Deciding knowledge in security protocols under some e-voting theories (Q3095038) (← links)
- Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols (Q3304811) (← links)
- On Communication Models When Verifying Equivalence Properties (Q3304813) (← links)
- YAPA: A Generic Tool for Computing Intruder Knowledge (Q3636824) (← links)
- Trace Equivalence and Epistemic Logic to Express Security Properties (Q5041278) (← links)
- Computing Knowledge in Security Protocols under Convergent Equational Theories (Q5191113) (← links)
