Probable innocence revisited

DOI10.1016/J.TCS.2006.08.033zbMATH Open1153.94451OpenAlexW2092179852MaRDI QIDQ860902FDOQ860902

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

Recommendations

• Weak probabilistic anonymity
• Probabilistic anonymity via coalgebraic simulations
• CONCUR 2005 – Concurrency Theory
• Anonymity Protocols as Noisy Channels
• Probabilistic Anonymity Via Coalgebraic Simulations

zbMATH Keywords

probabilitynondeterminismanonymityCrowdsprobable innocence

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Title not available (Why is that?)
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Title not available (Why is that?)
• CONCUR 2005 – Concurrency Theory
• CSP and anonymity
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• Title not available (Why is that?)
• Weak probabilistic anonymity

Cited In (15)

• Anonymity Protocols as Noisy Channels
• Probabilistic Anonymity Via Coalgebraic Simulations
• Conditional anonymity with non-probabilistic adversary
• An analysis of trust in anonymity networks in the presence of adaptive attackers
• Quantitative simulations by matrices
• Anonymity protocols as noisy channels
• Weak bisimulation for probabilistic timed automata
• Implementing secure reporting of sexual misconduct -- revisiting WhoToo
• Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus
• The cost of becoming anonymous: on the participant payload in crowds
• Analyzing anonymity attacks through noisy channels
• On compositional reasoning about anonymity and privacy in epistemic logic
• Quantifying leakage in the presence of unreliable sources of information
• Probabilistic anonymity via coalgebraic simulations
• Formalizing provable anonymity in Isabelle/HOL

Uses Software

• PRISM

This page was built for publication: Probable innocence revisited

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