Probable innocence revisited

DOI10.1016/j.tcs.2006.08.033zbMath1153.94451OpenAlexW2092179852MaRDI QIDQ860902

Konstantinos Chatzikokolakis, Catuscia Palamidessi

Publication date: 9 January 2007

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

Full work available at URL: https://hal.inria.fr/inria-00201072/file/tcsPI.pdf

zbMATH Keywords

probabilitynondeterminismanonymityCrowdsprobable innocence

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items

Quantifying leakage in the presence of unreliable sources of information ⋮ Weak bisimulation for probabilistic timed automata ⋮ Analyzing anonymity attacks through noisy channels ⋮ Conditional anonymity with non-probabilistic adversary ⋮ Anonymity protocols as noisy channels ⋮ An analysis of trust in anonymity networks in the presence of adaptive attackers ⋮ Probabilistic anonymity via coalgebraic simulations ⋮ Anonymity Protocols as Noisy Channels ⋮ Quantitative simulations by matrices ⋮ Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus

Uses Software

• PRISM

Cites Work

• A randomized encoding of the \(\pi\)-calculus with mixed choice
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Weak Probabilistic Anonymity
• CSP and anonymity
• CONCUR 2005 – Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Probable innocence revisited