Compositional Methods for Information-Hiding

DOI10.1007/978-3-540-78499-9_31zbMath1138.68402OpenAlexW1694710516MaRDI QIDQ5458378

Konstantinos Chatzikokolakis, Christelle Braun, Catuscia Palamidessi

Publication date: 11 April 2008

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78499-9_31

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

On the Relation between Differential Privacy and Quantitative Information Flow ⋮ Conditional anonymity with non-probabilistic adversary ⋮ Asymptotic information leakage under one-try attacks ⋮ Hidden-Markov program algebra with iteration ⋮ Information hiding in probabilistic concurrent systems ⋮ Nearly Optimal Verifiable Data Streaming ⋮ Quantifying information leakage in process calculi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Making Random Choices Invisible to the Scheduler
• Anonymity Protocols as Noisy Channels
• A practical secret voting scheme for large scale elections
• CONCUR 2005 – Concurrency Theory
• Processes, Terms and Cycles: Steps on the Road to Infinity