Compositional methods for information-hiding
From MaRDI portal
Recommendations
- Compositional Methods for Information-Hiding
- scientific article; zbMATH DE number 1953869
- Secure information hiding based on computationally intractable problems
- Information-theoretic analysis of information hiding
- Secure information flow by self-composition
- Computing the leakage of information-hiding systems
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 1561817 (Why is no real title available?)
- A randomized encoding of the \(\pi\)-calculus with mixed choice
- Anonymity protocols as noisy channels
- Asymptotic information leakage under one-try attacks
- Compositional closure for Bayes risk in probabilistic noninterference
- Computing the leakage of information-hiding systems
- Information flow in interactive systems
- Making random choices invisible to the scheduler
- On the Foundations of Quantitative Information Flow
- Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Cited in
(6)- Information hiding in probabilistic concurrent systems
- Compositional Methods for Information-Hiding
- Efficient information hiding based on theory of numbers
- A Paradigm for Masking (Camouflaging) Information
- Maximizing the conditional expected reward for reaching the goal
- Composing hidden information modules over inclusive institutions
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 Q2971070)
