The following pages link to Programming Languages and Systems (Q5316564):
Displaying 20 items.
- Privacy and verifiability in voting systems: methods, developments and trends (Q395657) (← links)
- 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)
- Deducibility constraints and blind signatures (Q462488) (← links)
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols (Q511946) (← links)
- A pure labeled transition semantics for the applied pi calculus (Q621583) (← links)
- Probabilistic and nondeterministic aspects of anonymity (Q843094) (← links)
- Deciding knowledge in security protocols under equational theories (Q860894) (← links)
- Exploiting re-voting in the Helios election system (Q1711416) (← links)
- Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity (Q2119978) (← links)
- Formalizing provable anonymity in Isabelle/HOL (Q2355379) (← links)
- Post-quantum online voting scheme (Q2670852) (← links)
- A Framework for Automatically Checking Anonymity with μCRL (Q3608464) (← links)
- Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus (Q3613062) (← links)
- Bisimulation for Demonic Schedulers (Q3617738) (← links)
- Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif (Q5253587) (← links)
- Automated Verification of Equivalence Properties of Cryptographic Protocols (Q5278194) (← links)
- Symbolic Bisimulation for the Applied Pi Calculus (Q5458829) (← links)
- A Proof Theoretic Analysis of Intruder Theories (Q5902125) (← links)
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus (Q6041667) (← links)
