Probabilistic and nondeterministic aspects of anonymity

DOI10.1016/J.TCS.2009.06.008MaRDI QIDQ843094zbMATH OpenOpenAlexFDO

Authors 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

anonymityprobabilistic automataprobability

Mathematics Subject Classification ID

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

Recommendations

• CONCUR 2005 – Concurrency Theory
• Probabilistic and nondeterministic aspects of anonymity
• Weak probabilistic anonymity
• Probabilistic Anonymity Via Coalgebraic Simulations
• Probabilistic anonymity via coalgebraic simulations

Cites work

• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• A calculus for cryptographic protocols: The spi calculus
• A calculus of mobile processes. I
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• Anonymity protocols as noisy channels
• Assessing security threats of looping constructs
• Bisimulation for Demonic Schedulers
• CONCUR 2005 – Concurrency Theory
• CSP and anonymity
• scientific article; zbMATH DE number 1690176 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1104326 (Why is no real title available?)
• scientific article; zbMATH DE number 2000824 (Why is no real title available?)
• scientific article; zbMATH DE number 1487488 (Why is no real title available?)
• scientific article; zbMATH DE number 1512615 (Why is no real title available?)
• scientific article; zbMATH DE number 1759624 (Why is no real title available?)
• scientific article; zbMATH DE number 2090929 (Why is no real title available?)
• scientific article; zbMATH DE number 2090930 (Why is no real title available?)
• scientific article; zbMATH DE number 794262 (Why is no real title available?)
• Making Random Choices Invisible to the Scheduler
• On the Foundations of Quantitative Information Flow
• Private authentication
• Programming Languages and Systems
• Some congruence properties for \(\pi\)-calculus bisimilarities
• The dining cryptographers problem: Unconditional sender and recipient untraceability

Cited in

(5)

• Probabilistic and nondeterministic aspects of anonymity
• Weak probabilistic anonymity
• Anonymity from Asymmetry: New Constructions for Anonymous HIBE
• Information hiding in probabilistic concurrent systems
• CONCUR 2005 – Concurrency Theory

Describes a project that uses

Uses Software

• Casper

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

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