Probabilistic Anonymity Via Coalgebraic Simulations

DOI10.1007/978-3-540-71316-6_26MaRDI QIDQ5756506zbMATH OpenOpenAlexFDO

Authors Ichiro Hasuo, Yoshinobu Kawabe

Publication date 4 September 2007

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71316-6_26

Mathematics Subject Classification ID

Internet topics (68M11) Data encryption (aspects in computer science) (68P25) Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• Probabilistic anonymity via coalgebraic simulations
• CONCUR 2005 – Concurrency Theory
• Weak probabilistic anonymity
• Probable innocence revisited
• Formalizing provable anonymity in Isabelle/HOL

Cited in

(7)

• Formalizing provable anonymity in Isabelle/HOL
• Information hiding in probabilistic concurrent systems
• CONCUR 2005 – Concurrency Theory
• Probabilistic bisimulation for parameterized systems (with applications to verifying anonymous protocols)
• Probabilistic and nondeterministic aspects of anonymity
• Probable innocence revisited
• Probabilistic anonymity via coalgebraic simulations

This page was built for publication: Probabilistic Anonymity Via Coalgebraic Simulations

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