CSP and anonymity

DOI10.1007/3-540-61770-1_38zbMath1493.68049MaRDI QIDQ5096415

Abraham Sidiropoulos, S. A. Schneider

Publication date: 16 August 2022

Published in: Computer Security — ESORICS 96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61770-1_38

zbMATH Keywords

privileged information; abstraction mechanism; security property; anonymity property; anonymity requirement

Mathematics Subject Classification ID

94A60: Cryptography

68M12: Network protocols

68M25: Computer security

Related Items

A Formalization of Anonymity and Onion Routing, Active opacity of discrete-event systems, Comparative analysis of related notions of opacity in centralized and coordinated architectures, On compositional reasoning about anonymity and privacy in epistemic logic, A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols, Probabilistic and nondeterministic aspects of anonymity, Theorem-proving anonymity of infinite-state systems, Probable innocence revisited, Probabilistic anonymity via coalgebraic simulations, Conditional anonymity with non-probabilistic adversary, Comparing the notions of opacity for discrete-event systems, Modular verification of protocol equivalence in the presence of randomness, Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol, Algorithmic probabilistic game semantics. Playing games with automata, Formalizing provable anonymity in Isabelle/HOL, Quantifying leakage in the presence of unreliable sources of information, Anonymity protocols as noisy channels, Weak Probabilistic Anonymity, Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap, A Framework for Automatically Checking Anonymity with μCRL

Cites Work

• Unnamed Item
• Unnamed Item
• The dining cryptographers problem: Unconditional sender and recipient untraceability