CSP and anonymity

DOI10.1007/3-540-61770-1_38zbMATH Open1493.68049OpenAlexW1812425403MaRDI QIDQ5096415FDOQ5096415

Authors: 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

Recommendations

• A formalization of anonymity and onion routing
• A Framework for Automatically Checking Anonymity with μCRL
• Anonymity Protocols as Noisy Channels
• CONCUR 2005 – Concurrency Theory
• scientific article; zbMATH DE number 1487488

zbMATH Keywords

privileged informationabstraction mechanismsecurity propertyanonymity propertyanonymity requirement

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Title not available (Why is that?)

Cited In (21)

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

This page was built for publication: CSP and anonymity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096415)