Compositional Methods for Information-Hiding

DOI10.1007/978-3-540-78499-9_31zbMATH Open1138.68402OpenAlexW1694710516MaRDI QIDQ5458378FDOQ5458378

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (11)

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