Probabilistic anonymity via coalgebraic simulations

DOI10.1016/j.tcs.2010.01.031zbMath1209.68219OpenAlexW2075609824MaRDI QIDQ974115

Ichiro Hasuo, Yoshinobu Kawabe, Hideki Sakurada

Publication date: 27 May 2010

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

Full work available at URL: http://hdl.handle.net/2433/128862

zbMATH Keywords

coalgebraprobabilityprivacyanonymityautomaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data encryption (aspects in computer science) (68P25)

Related Items (2)

On compositional reasoning about anonymity and privacy in epistemic logic ⋮ Quantitative simulations by matrices

Uses Software

• Casper

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Retracted: Semantic domains for combining probability and non-determinism
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• Theorem-proving anonymity of infinite-state systems
• Probable innocence revisited
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Forward and backward simulations. I. Untimed Systems
• Making Random Choices Invisible to the Scheduler
• A Framework for Automatically Checking Anonymity with μCRL
• Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus
• CSP and anonymity
• Generic Trace Semantics via Coinduction
• Distributing probability over non-determinism
• Algebra and Coalgebra in Computer Science
• Probabilistic Anonymity Via Coalgebraic Simulations
• Generic Forward and Backward Simulations
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Probabilistic anonymity via coalgebraic simulations