Weak Probabilistic Anonymity

DOI10.1016/j.entcs.2005.05.047zbMath1277.68027OpenAlexW2068391935WikidataQ126254683 ScholiaQ126254683MaRDI QIDQ2864392

Yu-xin Deng, Jun Pang, Catuscia Palamidessi

Publication date: 6 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2005.05.047

zbMATH Keywords

probabilitynondeterminismanonymitydining cryptographers

Mathematics Subject Classification ID

Cryptography (94A60) Internet topics (68M11)

Related Items (6)

Probable innocence revisited ⋮ Conditional anonymity with non-probabilistic adversary ⋮ Anonymity protocols as noisy channels ⋮ A Framework for Automatically Checking Anonymity with μCRL ⋮ Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus ⋮ Formalizing provable anonymity in Isabelle/HOL

Uses Software

• PRISM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• A logic for reasoning about time and reliability
• Model checking of probabilistic and nondeterministic systems
• CSP and anonymity
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Weak Probabilistic Anonymity