Cryptographically-masked flows

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4134 LNCS, Issue , 2006, Pages 353-369

  Askarov, Asian ^a   Hedin, Daniel ^a   Sabelfeld, Andrei ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; FORMAL LOGIC; INFORMATION RETRIEVAL; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SECURITY OF DATA;

CRYPTOGRAPHIC PROTOCOLS; PLAINTEXTS; SECURITY-CRITICAL SYSTEMS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 33749846305     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11823230_23     Document Type: Conference Paper

References (34)

1. M. Abadi. Secrecy by typing in security protocols. J. ACM, 46(5):749-786, September 1999.
2. M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). J. of Cryptology, 15(2): 103-127, 2002.
3. A. Askarov, D. Hedin, and A. Sabelfeld. Cryptographically-masked flows. Technical report, Chalmers University of Technology, June 2006. Located at http://www.cs.chalmers.se/~aaskarov/sas06full.pdf.
4. A. Askarov and A. Sabelfeld. Security-typed languages for implementation of cryptographic protocols: A case study. In Proc. European Symp. on Research in Computer Security, volume 3679 of LNCS, pages 197-221. Springer-Verlag, September 2005.
5. M. Bellare, A. Desa, D. Pointcheval, and P. Rogaway. Relations among notions of security for public-key encryption schemes. In Advances in Cryptology- Crypto 98, volume 1462 of LNCS, pages 26-46, January 1998.
6. M. Bellare and C. Namprempre. Authenticated encryption: Relations among notions and analysis of the generic composition paradigm. In Advances in Cryptology - Asiacrypt 2000, volume 1976 of LNCS, pages 531-545, January 2000.
7. J. Black, P. Rogaway, and T. Shrimpton. Encryption-scheme security in the presence of key-dependent messages. In Selected Areas in Cryptography, volume 2595 of LNCS, pages 62-75. Springer-Verlag, August 2002.
8. M. Burrows, M. Abadi, and R. Needham. A logic of authentication. ACM Transactions on Computer Systems, 8(1): 18-36, February 1990.
9. S. Chong and A. C. Myers. Security policies for downgrading. In ACM Conference on Computer and Communications Security, pages 198-209, October 2004.
10. T. Chothia, D. Duggan, and J. Vitek. Type-based distributed access control. In Proc. IEEE Computer Security Foundations Workshop, pages 170-186, 2003.
11. E. S. Cohen. Information transmission in sequential programs. In R. A. DeMillo, D. P. Dobkin, A. K. Jones, and R. J. Lipton, editors, Foundations of Secure Computation, pages 297-335. Academic Press, 1978.
12. M. Dam and P. Giambiagi. Confidentiality for mobile code: The case of a simple payment protocol. In Proc. IEEE Computer Security Foundations Workshop, pages 233-244, July 2000.
13. D. E. Denning and P. J. Denning. Certification of programs for secure information flow. Comm. of the ACM, 20(7):504-513, July 1977.
14. D. Duggan. Cryptographic types. In Proc. IEEE Computer Security Foundations Workshop, pages 238-252, June 2002.
15. P. Giambiagi and M. Dam. On the secure implementation of security protocols. In Proc. European Symp. on Programming, volume 2618 of LNCS, pages 144-158. Springer-Verlag, April 2003.
16. J. A. Goguen and J. Meseguer. Security policies and security models. In Proc. IEEE Symp. on Security and Privacy, pages 11-20, April 1982.
17. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28:270-299, 1984.
18. A. Gordon and A. Jeffrey. Secrecy despite compromise: Types, cryptography, and the picalculus. In Proc. CONCUR'05, number 3653 in LNCS, pages 186-201. Springer-Verlag, August 2005.
19. B. Hicks, D. King, and P. McDaniel. Declassification with cryptographic functions in a security-typed language. Technical Report NAS-TR-0004-2005, Network and Security Center, Department of Computer Science, Pennsylvania State University, May 2005.
20. P. Laud. Semantics and program analysis of computationally secure information flow. In Proc. European Symp. on Programming, volume 2028 of LNCS, pages 77-91. Springer-Verlag, April 2001.
21. P. Laud. Handling encryption in an analysis for secure information flow. In Proc. European Symp. on Programming, volume 2618 of LNCS, pages 159-173. Springer-Verlag, April 2003.
22. P. Laud and V. Vene. A type system for computationally secure information flow. In Proc. Fundamentals of Computation Theory, volume 3623 of LNCS, pages 365-377, August 2005.
23. P. Lincoln, J. C. Mitchell, M. Mitchell, and A. Scedrov. A probabilistic poly-time framework for protocol analysis. In ACM Conference on Computer and Communications Security, pages 112-121, November 1998.
24. D. McCullough. Noninterference and the composability of security properties. In Proc. IEEE Symp. on Security and Privacy, pages 177-186, May 1988.
25. J. C. Mitchell. Probabilistic polynomial-time process calculus and security protocol analysis. In Proc. European Symp. on Programming, volume 2028 of LNCS, pages 23-29. Springer-Verlag, April 2001.
26. A. C. Myers, A. Sabelfeld, and S. Zdancewic. Enforcing robust declassification and qualified robustness. J. Computer Security, 2006. To appear.
27. A. Sabelfeld and A. C. Myers. Language-based information-flow security. IEEE J. Selected Areas in Communications, 21(1):5-19, January 2003.
28. A. Sabelfeld and A. C. Myers. A model for delimited information release. In Proc. International Symp. on Software Security (ISSS'03), volume 3233 of LNCS, pages 174-191. Springer-Verlag, October 2004.
29. A. Sabelfeld and D. Sands. Dimensions and principles of declassification. In Proc. IEEE Computer Security Foundations Workshop, pages 255-269, June 2005.
30. C. E. Shannon. A mathematical theory of communication. Bell System Tech. J., 27:623-656, 1948.
31. E. Sumii and B. Pierce. Logical relations for encryption. In Proc. IEEE Computer Security Foundations Workshop, pages 256-269, June 2001.
32. D. Volpano. Secure introduction of one-way functions. In Proc. IEEE Computer Security Foundations Workshop, pages 246-254, July 2000.
33. D. Volpano and G. Smith. Verifying secrets and relative secrecy. In Proc. ACM Symp. on Principles of Programming Languages, pages 268-276, January 2000.
34. D. Volpano, G. Smith, and C. Irvine. A sound type system for secure flow analysis. J. Computer Security, 4(3): 167-187, 1996.