Computer networks
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Prisoner's Dilemma
Information Theory and Reliable Communication
Information Theory and Reliable Communication
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Towards Quantitative Verification of Probabilistic Transition Systems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The Cocaine Auction Protocol: On the Power of Anonymous Broadcast
IH '99 Proceedings of the Third International Workshop on Information Hiding
Design and Verification of a Secure Electronic Auction Protocol
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Assessing security threats of looping constructs
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Data and Computer Communications (8th Edition)
Data and Computer Communications (8th Edition)
An information-theoretic model for adaptive side-channel attacks
Proceedings of the 14th ACM conference on Computer and communications security
Anonymity protocols as noisy channels
Information and Computation
On the Foundations of Quantitative Information Flow
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Proceedings of the 16th ACM conference on Computer and communications security
Quantifying information flow with beliefs
Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
The capacity of channels with feedback
IEEE Transactions on Information Theory
Quantified Interference for a While Language
Electronic Notes in Theoretical Computer Science (ENTCS)
Metrics for Action-labelled Quantitative Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Information flow in interactive systems
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Computing the leakage of information-hiding systems
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
We consider the problem of defining the information leakage in interactive systems where secrets and observables can alternate during the computation. We show that the information-theoretic approach which interprets such systems as simple noisy channels is no longer valid. However, the principle can be recovered if we consider channels of a more complicated kind, that in Information Theory are known as channels with memory and feedback. We show that there is a complete correspondence between interactive systems and such channels. Furthermore, we show that the capacity of the channels associated to such systems is a continuous function with respect to a pseudometric based on the Kantorovich metric.