On the computational soundness of cryptographically masked flows

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2008, Pages 337-348

  Laud, Peeter ^a  

^a UNIVERSITY OF TARTU   (Estonia)

Author keywords

computational soundness; cryptographically masked flows; encryption; secure information flow

Indexed keywords

ABSTRACT MODELS; ANALYSIS TOOLS; COMPUTATIONAL SECURITY; COMPUTATIONAL SOUNDNESS; CRYPTOGRAPHIC OPERATIONS; CRYPTOGRAPHICALLY MASKED FLOWS; ERROR PRONES; EXECUTION MODEL; NON INTERFERENCE; PROGRAM STATE; SECURE INFORMATION FLOW; SECURITY DEFINITIONS;

CRYPTOGRAPHY; SECURITY OF DATA;

COMPUTER PROGRAMMING LANGUAGES;

EID: 84865660260     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1328438.1328479     Document Type: Conference Paper

References (32)

1. Martín Abadi. Secrecy by Typing in Security Protocols. Journal of the ACM, 46(5):749-786, September 1999.
2. Martín Abadi and Jan Jürjens. Formal Eavesdropping and Its Computational Interpretation. In Naoki Kobayashi and Benjamin C. Pierce, editors, Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001, volume 2215 of LNCS, pages 82-94, Sendai, Japan, October 2001. Springer-Verlag.
3. Martín Abadi and Phillip Rogaway. Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption). In Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, and Takayasu Ito, editors, International Conference IFIP TCS 2000, volume 1872 of LNCS, pages 3-22, Sendai, Japan, August 2000. Springer-Verlag.
4. Pedro Adão, Gergei Bana, Jonathan Herzog, and Andre Scedrov. Soundness of formal encryption in the presence of key-cycles. In Sabrina De Capitani di Vimercati, Paul F. Syverson, and Dieter Gollmann, editors, ESORICS, volume 3679 of Lecture Notes in Computer Science, pages 374-396. Springer, 2005.
5. Johan Agat. Transforming out timing leaks. In POPL 2000, Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 40-53, Boston, Massachusetts, January 2000. ACM Press.
6. Aslan Askarov and Andrei Sabelfeld. Gradual release: Unifying declassification, encryption and key release policies. In Pfitzmann and McDaniel (2007), pages 207-221.
7. Aslan Askarov, Daniel Hedin, and Andrei Sabelfeld. Cryptographically- Masked flows. In Kwangkeun Yi, editor, SAS, volume 4134 of Lecture Notes in Computer Science, pages 353-369. Springer, 2006.
8. Michael Backes, Birgit Pfitzmann, and Michael Waidner. A Universally Composable Cryptographic Library. In Proceedings of the 10th ACM Conference on Computer and Communications Security, Washington, DC, October 2003. ACM Press. Extended version available as Report 2003/015 of Cryptology ePrint Archive.
9. Mihir Bellare and Chanathip Namprempre. Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm. In Tatsuaki Okamoto, editor, Advances in Cryptology - ASIACRYPT 2000, 6th International Conference on the Theory and Application of Cryptology and Information Security, volume 1976 of LNCS, pages 531-545, Kyoto, Japan, December 2000. Springer-Verlag.
10. Mihir Bellare and Phillip Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In CCS '93, Proceedings of the 1st ACM Conference on Computer and Communications Security, pages 62-73, Fairfax, Virginia, November 1993. ACM Press.
11. Mihir Bellare, Anand Desai, Eron Jokipii, and Phillip Rogaway. A Concrete Security Treatment of Symmetric Encryption. In 38th Annual Symposium on Foundations of Computer Science, pages 394-403, Miami Beach, Florida, October 1997. IEEE Computer Society Press.
12. John Black, Phillip Rogaway, and Thomas Shrimpton. Encryption-scheme security in the presence of key-dependent messages. In Kaisa Nyberg and Howard M. Heys, editors, Selected Areas in Cryptography, volume 2595 of Lecture Notes in Computer Science, pages 62-75. Springer, 2002.
13. Chiara Bodei, Pierpaolo Degano, Flemming Nielson, and Hanne Riis Nielson. Static analysis for secrecy and non-interference in networks of processes. In Victor E. Malyshkin, editor, PaCT, volume 2127 of Lecture Notes in Computer Science, pages 27-41. Springer, 2001.
14. Veronique Cortier and Bogdan Warinschi. Computationally Sound, Automated Proofs for Security Protocols. In Shmuel Sagiv, editor, Programming Languages and Systems, 14th European Symposium on Programming, ESOP 2005, volume 3444 of LNCS, pages 157-171, Edinburgh, UK, April 2005. Springer-Verlag.
15. Danny Dolev and Andrew C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, IT-29(12):198-208, March 1983.
16. Cédric Fournet and Tamara Rezk. Cryptographically Sound Implementations for Typed Information-Flow Security. In POPL 2008, Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, California, January 2008. ACM Press.
17. Joseph A. Goguen and José Meseguer. Security Policies and Security Models. In Proceedings of the 1982 IEEE Symposium on Security and Privacy, pages 11-20, Oakland, California, April 1982. IEEE Computer Society Press.
18. Oded Goldreich. Foundations of Cryptography. Volume 1 - Basic Tools. Cambridge University Press, 2001.
19. Jonathan Herzog. Computational Soundness of Formal Adversaries. Master's thesis, Massachusetts Institute of Technology, September 2002.
20. Peeter Laud. Semantics and Program Analysis of Computationally Secure Information Flow. In David Sands, editor, Programming Languages and Systems, 10th European Symposium on Programming, ESOP 2001, volume 2028 of LNCS, pages 77-91, Genova, Italy, April 2001. Springer-Verlag.
21. Peeter Laud. Handling Encryption in Analyses for Secure Information Flow. In Pierpaolo Degano, editor, Programming Languages and Systems, 12th European Symposium on Programming, ESOP 2003, volume 2618 of LNCS, pages 159-173, Warsaw, Poland, April 2003. Springer-Verlag.
22. Peeter Laud and Varmo Vene. A Type System for Computationally Secure Information Flow. In Maciej Liśkiewicz and Rüdiger Reischuk, editors, 15th International Symposium on Fundamentals of Computation Theory (FCT) 2005, volume 3623 of LNCS, pages 365-377, Lübeck, Germany, August 2005. Springer-Verlag.
23. John McLean. Security models and information flow. In IEEE Symposium on Security and Privacy, pages 180-189, 1990.
24. Andrew C. Myers. JFlow: Practical Mostly-Static Information Flow Control. In POPL '99, Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 228-241, San Antonio, Texas, January 1999. ACM Press.
25. Hanne Riis Nielson and Flemming Nielson. Semantics with Applications: A Formal Introduction. Wiley, 1992.
26. Birgit Pfitzmann and Patrick McDaniel, editors. 2007 IEEE Symposium on Security and Privacy (S&P 2007), 20-23 May 2007, Oakland, California, USA, 2007. IEEE Computer Society.
27. Andrei Sabelfeld and Andrew C. Myers. Language-Based Information-Flow Security. IEEE Journal on Selected Areas in Communications, 21(1):5-19, January 2003.
28. Andrei Sabelfeld and David Sands. A Per Model of Secure Information Flow in Sequential Programs. In S. Doaitse Swierstra, editor, Programming Languages and Systems, 8th European Symposium on Programming, ESOP'99, volume 1576 of LNCS, pages 40-58, Amsterdam, The Netherlands, March 1999. Springer-Verlag.
29. Andrei Sabelfeld and David Sands. Dimensions and principles of declassification. In CSFW, pages 255-269. IEEE Computer Society, 2005.
30. Geoffrey Smith and Rafael Alpízar. Secure Information Flow with Random Assignment and Encryption. In 4th ACM Workshop on Formal Methods in Security Engineering, pages 33-43, 2006.
31. Geoffrey Smith and Dennis M. Volpano. Secure Information Flow in a Multi-threaded Imperative Language. In POPL '98, Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 355-364, San Diego, California, January 1998. ACM Press.
32. Jeffrey A. Vaughan and Steve Zdancewic. A cryptographic decentralized label model. In Pfitzmann and McDaniel (2007), pages 192-206.