Probabilistic and nondeterministic aspects of anonymity

DOI10.1016/j.tcs.2009.06.008zbMath1187.68202OpenAlexW2003327353MaRDI QIDQ843094

Romain Beauxis, Catuscia Palamidessi

Publication date: 29 September 2009

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.008

zbMATH Keywords

probabilityanonymityprobabilistic automata

Mathematics Subject Classification ID

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

Uses Software

• Casper

Cites Work

• A randomized encoding of the \(\pi\)-calculus with mixed choice
• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Some congruence properties for \(\pi\)-calculus bisimilarities
• A calculus of mobile processes. I
• A calculus for cryptographic protocols: The spi calculus
• Private authentication
• Anonymity protocols as noisy channels
• Assessing security threats of looping constructs
• Making Random Choices Invisible to the Scheduler
• On the Foundations of Quantitative Information Flow
• Bisimulation for Demonic Schedulers
• CSP and anonymity
• Programming Languages and Systems
• CONCUR 2005 – Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Probabilistic and nondeterministic aspects of anonymity