Quantifying opacity

Proceedings - 7th International Conference on the Quantitative Evaluation of Systems, QEST 2010

Volumn , Issue , 2010, Pages 263-272

  Bérard, Béatrice ^a   Mullins, John ^b   Sassolas, Mathieu ^a  

^a SORBONNE UNIVERSITÉ   (France)

^b ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

GAIN INFORMATION; MUTUAL INFORMATIONS; NON-PROBABILISTIC; NULL VALUE; PROBABILISTIC SYSTEMS; QUANTITATIVE INFORMATION; SECURE SYSTEM;

OPACITY;

EID: 78649453243     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2010.40     Document Type: Conference Paper

References (16)

1. A. Aldini, M. Bravetti, and R. Gorrieri. A process-algebraic approach for the analysis of probabilistic noninterference. Journal of Computer Security, 12(2):191-245, 2004.
2. R. Alur, P. Černý, and S. Zdancewic. Preserving secrecy under refinement. In Proc. of the 33rd Intl. Colloquium on Automata, Languages and Programming (ICALP'06), volume 4052 of LNCS, pages 107-118. Springer, 2006.
3. M. E. Andrés, C. Palamidessi, P. van Rossum, and G. Smith. Computing the leakage of information-hiding systems. In Proc. 16th Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'10), volume 6015 of LNCS, pages 373-389. Springer, March 2010.
4. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Proc. 15th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'95), volume 1026 of LNCS, pages 499-513. Springer, 1995.
5. M. Boreale. Quantifying information leakage in process calculi. Information and Computation, 207(6):699-725, 2009.
6. J. W. Bryans, M. Koutny, L. Mazaré, and P. Y. A. Ryan. Opacity generalised to transition systems. Intl. Jour. of Information Security, 7(6):421-435, 2008.
7. K. Chatzikokolakis, C. Palamidessi, and P. Panangaden. Anonymity protocols as noisy channels. Information and Computation, 206(2-4):378-401, Feb. 2008.
8. D. Chaum. The dining cryptographers problem: unconditional sender and recipient untraceability. Journal of Cryptology, 1:65-75, 1988.
9. C. Courcoubetis and M. Yannakakis. Markov Decision Processes and Regular Events. IEEE Transactions on Automatc Control, 43(10):1399-1418, 1998.
10. T. M. Cover and J. A. Thomas. Elements of information theory. Wiley Series in Telecommunications and Signal Processing. Wiley-Interscience, July 2006.
11. J. A. Goguen and J. Meseguer. Security policy and security models. In Proc. of IEEE Symposium on Security and Privacy, pages 11-20. IEEE Computer Society Press, 1982.
12. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(5):512-535, 1994.
13. Y. Lakhnech and L. Mazaré. Probabilistic opacity for a passive adversary and its application to Chaum's voting scheme. Technical Report 4, Verimag, 2 2005.
14. L. Mazaré. Decidability of opacity with non-atomic keys. In Proc. 2nd Workshop on Formal Aspects in Security and Trust (FAST'04), volume 173 of Intl. Federation for Information Processing, pages 71-84. Springer, 2005.
15. M. K. Reiter and A. D. Rubin. Crowds: anonymity for web transactions. ACM Transactions on Information and System Security, 1(1):66-92, 1998.
16. G. Smith. On the foundations of quantitative information flow. In Proc. 12th Intl. Conf. on Foundations of Software Science and Computational Structures (FOSSACS '09), pages 288-302. Springer-Verlag, 2009.