Cryptographically-masked flows

Theoretical Computer Science

Volumn 402, Issue 2-3, 2008, Pages 82-101

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

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Cryptography; Information flow; Language based security; Noninterference; Security type systems

Indexed keywords

COMPUTER NETWORKS; INFORMATION SYSTEMS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY; QUALITY ASSURANCE; RELIABILITY; STANDARDS;

CHOSEN CIPHER TEXT (CCT) ATTACK; CRITICAL SYSTEMS; CRYPTOGRAPHIC OPERATIONS; CRYPTOGRAPHIC PROTOCOLS; ELSEVIER (CO); INFORMATION FLOWS; KEY GENERATION; NONINTERFERENCE PROPERTIES; PLAIN TEXT; PROGRAM BEHAVIORS; PUBLIC DATA; PUBLIC-KEY CRYPTOGRAPHY; SECRET KEYS; TYPE SYSTEMS;

CRYPTOGRAPHY;

EID: 46449131920     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.04.028     Document Type: Article

References (38)

1. Abadi M. Secrecy by typing in security protocols. J. ACM 46 5 (1999) 749-786
2. Askarov A., Hedin D., and Sabelfeld A. Cryptographically-masked flows. Proc. Symp. on Static Analysis. LNCS (August 2006), Springer Verlag 353-369
3. Askarov A., and Sabelfeld A. Security-typed languages for implementation of cryptographic protocols: A case study. Proc. European Symp. on Research in Computer Security. LNCS vol. 3679 (September 2005), Springer Verlag 197-221
4. A. Askarov, A. Sabelfeld, Gradual release: Unifying declassification, encryption and key release policies, in: Proc. IEEE Symp. on Security and Privacy, May 2007, pp. 207-221
5. Bellare M., Desa A., Pointcheval D., and Rogaway P. Relations among notions of security for public-key encryption schemes. Advances in Cryptology- Crypto 98. LNCS vol. 1462 (January 1998) 26-46
6. Bellare M., and Rogaway P. Random oracles are practical: A paradigm for designing efficient protocols. ACM Conference on Computer and Communications Security (November 1993) 62-73
7. Black J., Rogaway P., and Shrimpton T. Encryption-scheme security in the presence of key-dependent messages. Selected Areas in Cryptography. LNCS vol. 2595 (August 2002), Springer Verlag 62-75
8. Burrows M., Abadi M., and Needham R. A logic of authentication. ACM Trans. Comput. Syst. 8 1 (February 1990) 18-36
9. Chong S., and Myers A.C. Security policies for downgrading. ACM Conference on Computer and Communications Security (October 2004) 198-209
10. T. Chothia, D. Duggan, J. Vitek, Type-based distributed access control, in: Proc. IEEE Computer Security Foundations Workshop, 2003, pp. 170-186
11. D. Clark, S. Hunt, Observation, nondeterminism and nondeducability on strategies. Workshop presentation at PLID'07, 3rd International Workshop on Programming Language Dependence and Independence, August 2007
12. Cohen E.S. Information transmission in sequential programs. In: DeMillo R.A., Dobkin D.P., Jones A.K., and Lipton R.J. (Eds). Foundations of Secure Computation (1978), Academic Press 297-335
13. M. Dam, P. Giambiagi, Confidentiality for mobile code: The case of a simple payment protocol, in: Proc. IEEE Computer Security Foundations Workshop, July 2000, pp. 233-244
14. Denning D.E., and Denning P.J. Certification of programs for secure information flow. Comm. ACM 20 7 (July 1977) 504-513
15. Duggan D. Cryptographic types. Proc. IEEE Computer Security Foundations Workshop (June 2002) 238-252
16. Giambiagi P., and Dam M. On the secure implementation of security protocols. Proc. European Symp. on Programming. LNCS vol. 2618 (April 2003), Springer Verlag 144-158
17. Goguen J.A., and Meseguer J. Security policies and security models. Proc. IEEE Symp. on Security and Privacy (April 1982) 11-20
18. A. Gordon, A. Jeffrey, Secrecy despite compromise: Types, cryptography, and the pi-calculus, Proc. CONCUR'05 Number 3653, LNCS, pp 186-201 Springer Verlag, August 2005
19. B. Hicks, D. King, 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. Laud P. Semantics and program analysis of computationally secure information flow. Proc. European Symp. on Programming. LNCS vol. 2028 (April 2001), Springer Verlag 77-91
21. Laud P. Handling encryption in an analysis for secure information flow. Proc. European Symp. on Programming. LNCS vol. 2618 (April 2003), Springer Verlag 159-173
22. Laud P. On the computational soundness of cryptographically masked flows. Proc. ACM Symp. on Principles of Programming Languages (January 2008) 337-348
23. P. Laud, V. Vene, A type system for computationally secure information flow, in: Proc. Fundamentals of Computation Theory, in: LNCS, vol. 3623, August 2005, pp. 365-377
24. Lincoln P., Mitchell J.C., Mitchell M., and Scedrov A. A probabilistic poly-time framework for protocol analysis. ACM Conference on Computer and Communications Security (November 1998) 112-121
25. McCullough D. Noninterference and the composability of security properties. Proc. IEEE Symp. on Security and Privacy (May 1988) 177-186
26. Mitchell J.C. Probabilistic polynomial-time process calculus and security protocol analysis. Proc. European Symp. on Programming. LNCS vol. 2028 (April 2001), Springer Verlag 23-29
27. Myers A.C., and Liskov B. A decentralized model for information flow control. Proc. ACM Symp. on Operating System Principles (October 1997) 129-142
28. Myers A.C., Sabelfeld A., and Zdancewic S. Enforcing robust declassification and qualified robustness. J. Computer Security 14 2 (May 2006) 157-196
29. National Institute of Standards and Technology. Special publication 800-38a. Recommendation for block cipher modes of operation, December 2001
30. Sabelfeld A., and Myers A.C. Language-based information-flow security. IEEE J. Selected Areas in Communications 21 1 (2003) 5-19
31. Sabelfeld A., and Myers A.C. A model for delimited information release. Proc. International Symp. on Software Security (ISSS'03). LNCS vol. 3233 (October 2004), Springer Verlag 174-191
32. A. Sabelfeld, D. Sands, Dimensions and principles of declassification, in: Proc. IEEE Computer Security Foundations Workshop, June 2005, pp. 255-269
33. Smith G., and Alpizar R. Secure information flow with random assignment and encryption. Proc. 4th ACM Workshop on Formal Methods in Security Engineering (November 2006) 33-43
34. Sumii E., and Pierce B. Logical relations for encryption. Proc. IEEE Computer Security Foundations Workshop (June 2001) 256-269
35. Vaughan J., and Zdancewic S. The cryptographic decentralized label model. Proc. IEEE Symp. on Security and Privacy (May 2007) 192-206
36. Volpano D. Secure introduction of one-way functions. Proc. IEEE Computer Security Foundations Workshop (July 2000) 246-254
37. Volpano D., and Smith G. Verifying secrets and relative secrecy. Proc. ACM Symp. on Principles of Programming Languages (January 2000) 268-276
38. Volpano D., Smith G., and Irvine C. A sound type system for secure flow analysis. J. Comput. Secur. 4 3 (1996) 167-187