Compositional Methods for Information-Hiding

DOI10.1007/978-3-540-78499-9_31MaRDI QIDQ5458378zbMATH OpenOpenAlexFDO

Authors Christelle Braun, Konstantinos Chatzikokolakis, 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

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

Recommendations

• Compositional methods for information-hiding
• Information hiding in probabilistic concurrent systems
• Composition of cryptographic protocols in a probabilistic polynomial-time process calculus.
• Weak probabilistic anonymity
• Quantifying information leakage of randomized protocols

Cites work

• A practical secret voting scheme for large scale elections
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• Anonymity Protocols as Noisy Channels
• CONCUR 2005 – Concurrency Theory
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 1512615 (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
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Quantified interference for a while language
• The dining cryptographers problem: Unconditional sender and recipient untraceability

Cited in

(11)

• Quantifying information leakage in process calculi
• Efficient information hiding based on theory of numbers
• Conditional anonymity with non-probabilistic adversary
• Information hiding using matroid theory
• Nearly optimal verifiable data streaming
• Compositional methods for information-hiding
• On the relation between differential privacy and quantitative information flow
• A Paradigm for Masking (Camouflaging) Information
• Information hiding in probabilistic concurrent systems
• Asymptotic information leakage under one-try attacks
• Hidden-Markov program algebra with iteration

This page was built for publication: Compositional Methods for Information-Hiding

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