Compositional Methods for Information-Hiding
From MaRDI portal
Publication:5458378
Recommendations
Cites work
- 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?)
- 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
- 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)- Hidden-Markov program algebra with iteration
- 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
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)