References

  1. M.S. Alvim, M.E. Andrés, K. Chatzikokolakis & C. Palamidessi (2011): Quantitative information flow and applications to differential privacy. In: A. Aldini & R. Gorrieri: Foundations of security analysis and design VI. Springer-Verlag, pp. 211–230, doi:10.1007/978-3-642-23082-0-8.
  2. M.S. Alvim, K. Chatzikokolakis, C. Palamidessi & G. Smith (2012): Measuring Information Leakage Using Generalized Gain Functions. In: CSF '12: Proceedings of the 2012 IEEE 25th Computer Security Foundations Symposium. IEEE Computer Society, pp. 265–279, doi:10.1109/CSF.2012.26.
  3. M.E. Andres, C. Palamidessi, P. Rossum & A. Sokolova (2010): Information Hiding in Probabilistic Concurrent Systems. In: Proceedings of the 2010 Seventh International Conference on the Quantitative Evaluation of Systems, QEST '10. IEEE Computer Society, pp. 17–26, doi:10.1109/QEST.2010.11.
  4. C. Cachin (1997): Entropy Measures and Unconditional Security in Cryptography.
  5. K. Chatzikokolakis, C. Palamidessi & P. Panangaden (2007): Anonymity protocols as noisy channels. In: Proceedings of the 2nd international conference on Trustworthy global computing, TGC'06. Springer-Verlag, pp. 281–300, doi:10.1007/978-3-540-75336-0-18.
  6. H. Chen & P. Malacaria (2007): Quantitative analysis of leakage for multi-threaded programs. In: Proceedings of the 2007 workshop on Programming languages and analysis for security, PLAS '07. ACM, pp. 31–40, doi:10.1145/1255329.1255335.
  7. H. Chen & P. Malacaria (2010): The optimum leakage principle for analyzing multi-threaded programs. In: Proceedings of the 4th international conference on Information theoretic security, ICITS'09. Springer-Verlag, pp. 177–193, doi:10.1007/978-3-642-14496-7-15.
  8. D. Clark, S. Hunt & P. Malacaria (2005): Quantitative Information Flow, Relations and Polymorphic Types. J. Log. and Comput. 15, pp. 181–199, doi:10.1093/logcom/exi009.
  9. J.A. Goguen & J. Meseguer (1982): Security Policies and Security Models. In: IEEE Symposium on Security and Privacy, pp. 11–20.
  10. A. Gurfinkel & M. Chechik (2006): Why Waste a Perfectly Good Abstraction. In: In TACAS'06. Springer, pp. 3920.
  11. M. Huisman & T.M. Ngo (2012): Scheduler-specific confidentiality for multi-threaded programs and its logic-based verification. In: FoVeOOS'11. Springer-Verlag, pp. 178–195, doi:10.1007/978-3-642-31762-0-12.
  12. D. Kozen: Semantics of probabilistic programs. In: Proceedings of the 20th Annual Symposium on Foundations of Computer Science, SFCS '79. IEEE Computer Society, pp. 101–114, doi:10.1109/SFCS.1979.38.
  13. S.A. Kripke (1963): Semantical Considerations on Modal Logic. Acta Philosophica Fennica 16, pp. 83–94.
  14. P. Malacaria (2010): Risk assessment of security threats for looping constructs. J. Comput. Secur. 18, pp. 191–228.
  15. P. Malacaria & H. Chen (2008): Lagrange multipliers and maximum information leakage in different observational models. In: Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security, PLAS '08. ACM, pp. 135–146, doi:10.1145/1375696.1375713.
  16. J.L. Massey (1994): Guessing and Entropy. In: Proceedings of the 1994 IEEE International Symposium on Information Theory, pp. 204, doi:10.1109/ISIT.1994.394764.
  17. I.S. Moskowitz, R.E. Newman, D.P. Crepeau & A.R. Miller (2003): Covert Channels and Anonymizing Networks. In: In Workshop on Privacy in the Electronic Society (WPES 2003). ACM, pp. 79–88, doi:10.1145/1005140.1005153.
  18. C. Mu & D. Clark (2009): Quantitative Analysis of Secure Information Flow via Probabilistic Semantics. In: Proceedings of the The Forth International Conference on Availability, Reliability and Security, ARES 2009, 2009, Japan. IEEE Computer Society, pp. 49–57, doi:10.1109/ARES.2009.88.
  19. T.M. Ngo, M. Stoelinga & M. Huisman (2013): Confidentiality for probabilistic multi-threaded programs and its verification. In: Proceedings of the 5th international conference on Engineering Secure Software and Systems, ESSoS'13. Springer-Verlag, Berlin, Heidelberg, pp. 107–122.
  20. A. Sabelfeld & D. Sands (1999): Probabilistic Noninterference for Multi-threaded Programs. In: In Proc. IEEE Computer Security Foundations Workshop. IEEE Computer Society Press, pp. 200–214.
  21. G. Smith (2009): On the Foundations of Quantitative Information Flow. In: FOSSACS '09. Springer-Verlag, pp. 288–302, doi:10.1007/978-3-642-00596-1-21.
  22. G. Smith (2011): Quantifying Information Flow Using Min-Entropy. In: QEST, pp. 159–167. Available at http://doi.ieeecomputersociety.org/10.1109/QEST.2011.31.
  23. M.I.A. Stoelinga (2002): Alea jacta est: verification of probabilistic, real-time and parametric systems. University of Nijmegen, the Netherlands.
  24. S. Zdancewic & A.C. Myers (2003): Observational Determinism for Concurrent Program Security. In: In Proc. 16th IEEE Computer Security Foundations Workshop, pp. 29–43.
  25. J. Zhu & M. Srivatsa (2011): Poster: on quantitative information flow metrics. In: Proceedings of the 18th ACM conference on Computer and communications security, CCS '11. ACM, pp. 877–880, doi:10.1145/2046707.2093516.
  26. J. Zhu & M. Srivatsa (2011): Quantifying Information Leakage in Finite Order Deterministic Programs. In: ICC, pp. 1–6, doi:10.1109/icc.2011.5963509.
  27. Y. Zhu & R. Bettati (2005): Anonymity vs. Information Leakage in Anonymity Systems. In: In Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (ICDCS 2005), pp. 514–524, doi:10.1109/ICDCS.2005.13.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org