CSP and anonymity

DOI10.1007/3-540-61770-1_38zbMath1493.68049OpenAlexW1812425403MaRDI 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 informationabstraction mechanismsecurity propertyanonymity propertyanonymity requirement

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12) Computer security (68M25)

Related Items (20)

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

Cites Work

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

This page was built for publication: CSP and anonymity