Proceedings of the 23rd IEEE Computer Security Foundations Symposium, CSF 2010, Edinburgh, United Kingdom, July 17-19, 2010

2010 Proceedings of the 23rd IEEE Computer Security Foundations Symposium, CSF 2010, Edinburgh, United Kingdom, July 17-19, 2010 IEEE Computer Society Samson Abramsky 1991 Domain Theory in Logical Form Ann. Pure Appl. Logic 51 1-2 1–77 http://dx.doi.org/10.1016/0168-0072(91)90065-T Michael Backes Matthias Berg Boris Köpf 2011 Non-uniform distributions in quantitative information-flow Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security ASIACCS '11 ACM

New York, NY, USA

367–375 http://doi.acm.org/10.1145/1966913.1966960 Michael Backes Boris Köpf Andrey Rybalchenko 2009 Automatic Discovery and Quantification of Information Leaks IEEE Symposium on Security and Privacy IEEE Computer Society 141–153 http://dx.doi.org/10.1109/SP.2009.18 Gilles Barthe Pedro R. D'Argenio Tamara Rezk 2004 Secure Information Flow by Self-Composition CSFW IEEE Computer Society 100–114 http://doi.ieeecomputersociety.org/10.1109/CSFW.2004.17 Christelle Braun Konstantinos Chatzikokolakis Catuscia Palamidessi 2009 Quantitative Notions of Leakage for One-try Attacks Electr. Notes Theor. Comput. Sci. 249 75–91 http://dx.doi.org/10.1016/j.entcs.2009.07.085 Pavol Černý Krishnendu Chatterjee Thomas A. Henzinger 2011 The Complexity of Quantitative Information Flow Problems CSF IEEE Computer Society 205–217 http://doi.ieeecomputersociety.org/10.1109/CSF.2011.21 David Clark Sebastian Hunt Pasquale Malacaria 2005 Quantified Interference for a While Language Electr. Notes Theor. Comput. Sci. 112 149–166 http://dx.doi.org/10.1016/j.entcs.2004.01.018 David Clark Sebastian Hunt Pasquale Malacaria 2007 A static analysis for quantifying information flow in a simple imperative language J. Comput. Secur. 15 321–371 http://dl.acm.org/citation.cfm?id=1370628.1370629 Michael R. Clarkson Andrew C. Myers Fred B. Schneider 2005 Belief in Information Flow CSFW IEEE Computer Society 31–45 http://dx.doi.org/10.1109/CSFW.2005.10 Michael R. Clarkson Fred B. Schneider 2010 Hyperproperties Journal of Computer Security 18 6 1157–1210 http://dx.doi.org/10.3233/JCS-2009-0393 Ellis S. Cohen 1977 Information Transmission in Computational Systems SOSP 133–139 http://doi.acm.org/10.1145/800214.806556 Ádám Darvas Reiner Hähnle David Sands 2005 A Theorem Proving Approach to Analysis of Secure Information Flow Dieter Hutter Markus Ullmann SPC Lecture Notes in Computer Science 3450 Springer 193–209 http://dx.doi.org/10.1007/978-3-540-32004-3_20 Dorothy Elizabeth Robling Denning 1982 Cryptography and data security Addison-Wesley Longman Publishing Co., Inc.

Boston, MA, USA

Cormac Flanagan James B. Saxe 2001 Avoiding exponential explosion: generating compact verification conditions POPL 193–205 http://doi.acm.org/10.1145/360204.360220 Joseph A. Goguen José Meseguer 1982 Security Policies and Security Models IEEE Symposium on Security and Privacy 11–20 Jonathan Heusser Pasquale Malacaria 2009 Applied Quantitative Information Flow and Statistical Databases Pierpaolo Degano Joshua D. Guttman Formal Aspects in Security and Trust Lecture Notes in Computer Science 5983 Springer 96–110 http://dx.doi.org/10.1007/978-3-642-12459-4_8 Boris Köpf David A. Basin 2007 An information-theoretic model for adaptive side-channel attacks Peng Ning Sabrina De Capitani di Vimercati Paul F. Syverson ACM Conference on Computer and Communications Security ACM 286–296 http://doi.acm.org/10.1145/1315245.1315282 Boris Köpf Andrey Rybalchenko 2010 Approximation and Randomization for Quantitative Information-Flow Analysis CSF 3–14 http://doi.ieeecomputersociety.org/10.1109/CSF.2010.8 Boris Köpf Geoffrey Smith 2010 Vulnerability Bounds and Leakage Resilience of Blinded Cryptography under Timing Attacks CSF 44–56 http://doi.ieeecomputersociety.org/10.1109/CSF.2010.11 K. Rustan M. Leino 2005 Efficient weakest preconditions Inf. Process. Lett. 93 6 281–288 http://dx.doi.org/10.1016/j.ipl.2004.10.015 Pasquale Malacaria 2007 Assessing security threats of looping constructs Martin Hofmann Matthias Felleisen POPL ACM 225–235 http://doi.acm.org/10.1145/1190216.1190251 Pasquale Malacaria Han Chen 2008 Lagrange multipliers and maximum information leakage in different observational models Úlfar Erlingsson Marco Pistoia PLAS ACM 135–146 http://doi.acm.org/10.1145/1375696.1375713 James L. Massey 1994 Guessing and Entropy ISIT '94: Proceedings of the 1994 IEEE International Symposium on Information Theory 204 http://dx.doi.org/10.1109/ISIT.1994.394764 Stephen McCamant Michael D. Ernst 2008 Quantitative information flow as network flow capacity Rajiv Gupta Saman P. Amarasinghe PLDI ACM 193–205 http://doi.acm.org/10.1145/1375581.1375606 David A. Naumann 2006 From Coupling Relations to Mated Invariants for Checking Information Flow Dieter Gollmann Jan Meier Andrei Sabelfeld ESORICS Lecture Notes in Computer Science 4189 Springer 279–296 http://dx.doi.org/10.1007/11863908_18 James Newsome Stephen McCamant Dawn Song 2009 Measuring channel capacity to distinguish undue influence Stephen Chong David A. Naumann PLAS ACM 73–85 http://doi.acm.org/10.1145/1554339.1554349 Claude Shannon 1948 A Mathematical Theory of Communication Bell System Technical Journal 27 379–423, 623–656 http://doi.acm.org/10.1145/584091.584093 Geoffrey Smith 2009 On the Foundations of Quantitative Information Flow Luca de Alfaro FOSSACS Lecture Notes in Computer Science 5504 Springer 288–302 http://dx.doi.org/10.1007/978-3-642-00596-1_21 Tachio Terauchi Alexander Aiken 2005 Secure Information Flow as a Safety Problem Chris Hankin Igor Siveroni SAS Lecture Notes in Computer Science 3672 Springer 352–367 http://dx.doi.org/10.1007/11547662_24 Hiroshi Unno Naoki Kobayashi Akinori Yonezawa 2006 Combining type-based analysis and model checking for finding counterexamples against non-interference Vugranam C. Sreedhar Steve Zdancewic PLAS ACM 17–26 http://doi.acm.org/10.1145/1134744.1134750 Hirotoshi Yasuoka Tachio Terauchi 2010 On Bounding Problems of Quantitative Information Flow Dimitris Gritzalis Bart Preneel Marianthi Theoharidou ESORICS Lecture Notes in Computer Science 6345 Springer 357–372 http://dx.doi.org/10.1007/978-3-642-15497-3_22 Hirotoshi Yasuoka Tachio Terauchi 2010 Quantitative Information Flow - Verification Hardness and Possibilities CSF 15–27 http://doi.ieeecomputersociety.org/10.1109/CSF.2010.9 Hirotoshi Yasuoka Tachio Terauchi 2011 On Bounding Problems of Quantitative Information Flow (Extended version) Journal of Computer Security 19 6 1029–1082 http://dx.doi.org/10.3233/JCS-2011-0437 Hirotoshi Yasuoka Tachio Terauchi 2011 Quantitative Information Flow as Safety and Liveness Hyperproperties http://www.kb.ecei.tohoku.ac.jp/~yasuoka