Symmetric encryption in automatic analyses for confidentiality against active adversaries

Proceedings - IEEE Symposium on Security and Privacy

Volumn 2004, Issue , 2004, Pages 71-85

  Laud, Peeter ^a  

^a UNIVERSITY OF TARTU   (Estonia)

Author keywords

[No Author keywords available]

Indexed keywords

ADVERSARIES; COMPUTATIONAL MODELS; CRYPTOGRAPHIC PROTOCOLS; SYMMETRIC ENCRYPTION;

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; MATHEMATICAL MODELS; SECURITY OF DATA; SEMANTICS;

CRYPTOGRAPHY;

EID: 3543052976     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SECPRI.2004.1301316     Document Type: Conference Paper

References (36)

1. M. Abadi and P. Rogaway, "Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)," in International Conference IFIP TCS 2000, ser. LNCS, J. van Leeuwen, O. Watanabe, M. Hagiya, P. Mosses, and T. Ito, Eds., vol. 1872. Sendai, Japan: Springer-Verlag, Aug. 2000, pp. 3-22.
2. M. Abadi and J. Jürjens, "Formal Eavesdropping and Its Computational Interpretation," in Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001, ser. LNCS, N. Kobayashi and B. Pierce, Eds., vol. 2215. Sendai, Japan: Springer-Verlag, Sept. 2001, pp. 82-94.
3. E. Hermann, "Krüptograafiliste protokollide turvalisuse analüüs (Security Analysis of Cryptographic Protocols)," Diploma thesis, Tartu University, May 2003, in Estonian with English summary.
4. P. Laud, "Symmetric encryption in automatic analyses for confidentiality against active adversaries," Cybernetica, Tech. Rep. IT-AR-0-030-040227, 27 Feb. 2004.
5. _, "Computationally Secure Information Flow," Ph.D. dissertation, Universität des Saarlandes, 2002.
6. _, "Handling Encryption in Analyses for Secure Information Flow," in Programming Languages and Systems. 12th European Symposium on Programming, ESOP 2003, ser. LNCS, P. Degano, Ed., vol. 2618. Warsaw, Poland: Springer-Verlag, Apr. 2003, pp. 159-173.
7. B. Pfitzmann, M. Schunter, and M. Waidner, "Cryptographic Security of Reactive Systems," in Workshop on Secure Architectures and Information Flow, ser. Electronic Notes in Theoretical Computer Science, S. Schneider and P. Ryan, Eds., vol. 32. Royal Holloway, University of London: Elsevier Science, 2000.
8. B. Pfitzmann and M. Waidner, "Composition and integrity preservation of secure reactive systems," in CCS 2000, Proceedings of the 7th ACM Conference on Computer and Communications Security. Athens, Greece: ACM Press, Nov. 2000, pp. 245-254.
9. _, "A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission," in 2001 IEEE Symposium on Security and Privacy. Oakland, California: IEEE Computer Society Press, May 2001, pp. 184-200.
10. M. Backes, "Cryptographically Sound Analysis of Security Protocols," Ph.D. dissertation, Universität des Saarlandes, 2002.
11. M. Backes and C. Jacobi II, "Cryptographically Sound and Machine-Assisted Verification of Security Protocols," in STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, ser. LNCS, H. Alt and M. Habib, Eds., vol. 2607. Berlin, Germany: Springer-Verlag, Feb. 2003, pp. 675-686.
12. M. Backes, B. Pfitzmann, and M. Waidner, "A Universally Composable Cryptographic Library," in Proceedings of the 10th ACM Conference on Computer and Communications Security. Washington, DC: ACM Press, Oct. 2003.
13. B. Blanchet, "Automatic Verification of Cryptographic Protocols: A Logic Programming Approach (invited talk)," in 5th ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP'03). Uppsala, Sweden: ACM Press, Aug. 2003.
14. M. Backes, B. Pfitzmann, and M. Waidner, "Symmetric authentication within a simulatable cryptographic library," in Computer Security ESORICS 2003, 8th European Symposium on Research in Computer Security, ser. LNCS, E. Snekkenes and D. Gollmann, Eds., vol. 2808. Gjøvik, Norway: Springer-Verlag, Oct. 2003, pp. 271-290.
15. M. Backes and B. Pfitzmann, "Symmetric Encryption in a Simulatable Dolev-Yao Style Cryptographic Library," Cryptology ePrint Archive, Report 2004/059, 2004, http://eprint.iacr.org/.
16. R. Canetti, "A unified framework for analyzing security of protocols," Electronic Colloquium on Computational Complexity (ECCC), vol. 8, no. 16, 2001.
17. R. Canetti and M. Fischlin, "Universally Composable Commitments," in Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, ser. LNCS, J. Kilian, Ed., vol. 2139. Santa Barbara, California: Springer-Verlag, Aug. 2001, pp. 19-40.
18. R. Canetti and H. Krawczyk, "Universally Composable Notions of Key Exchange and Secure Channels," in Advances in Cryptology - EURO-CRYPT 2002, International Conference on the Theory and Application of Cryptographic Techniques, ser. LNCS, L. R. Knudsen, Ed., vol. 2332. Amsterdam, The Netherlands: Springer-Verlag, Apr. 2002, pp. 337-351.
19. R. Canetti, Y. Lindell, R. Ostrovsky, and A. Sahai, "Universally composable two-party and multi-party secure computation," in Proceedings on 34th Annual ACM Symposium on Theory of Computing. Montreal, Quebec: ACM, May 2002, pp. 494-503.
20. J. Herzog, "Computational Soundness of Formal Adversaries," Master's thesis, Massachusetts Institute of Technology, Sept. 2002.
21. M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway, "Relations among Notions of Security for Public-Key Encryption Schemes," in Advances in Cryptology - CRYPTO '98, 18th Annual International Cryptology Conference, ser. LNCS, H. Krawczyk, Ed., vol. 1462. Santa Barbara, California: Springer-Verlag, Aug. 1998, pp. 26-45.
22. M. Bellare and P. 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. Fairfax, Virginia: ACM Press, Nov. 1993, pp. 62-73.
23. J. Herzog, M. Liskov, and S. Micali, "Plaintext Awareness via Key Registration," in Advances in Cryptology - CRYPTO 2003, 23rd Annual International Cryptology Conference, ser. LNCS, D. Boneh, Ed., vol. 2729. Santa Barbara, California: Springer-Verlag, Aug. 2003, pp. 548-564.
24. M. Bellare and C. Namprempre, "Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm," in Advances in Cryptology - ASIACRYPT 2000, 6th International Conference on the Theory and Application of Cryptology and Information Security, ser. LNCS, T. Okamoto, Ed., vol. 1976. Kyoto, Japan: Springer-Verlag, Dec. 2000, pp. 531-545.
25. M. Bellare, A. Desai, E. Jokipii, and P. Rogaway, "A Concrete Security Treatment of Symmetric Encryption," in 38th Annual Symposium on Foundations of Computer Science. Miami Beach, Florida: IEEE Computer Society Press, Oct. 1997, pp. 394-403.
26. M. Naor and M. Yung, "Public-key cryptosystems provably secure against chosen ciphertext attacks," in Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing. Baltimore, Maryland: ACM Press, May 1990, pp. 427-437.
27. C. Rackoff and D. R. Simon, "Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack," in Advances in Cryptology CRYPTO '91, 11th Annual International Cryptology Conference, ser. LNCS, J. Feigenbaum, Ed., vol. 576. Santa Barbara, California: Springer-Verlag, Aug. 1991, pp. 433-444.
28. F. Thayer, J. Herzog, and J. Guttman, "Strand Spaces: Proving Security Protocols Correct," Journal of Computer Security, vol. 7, no. 2/3, pp. 191-230, 1999.
29. M. Bellare and P. Rogaway, "Provably secure session key distribution - The three party case," in Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing. Las Vegas, Nevada: ACM Press, June 1995, pp. 57-66.
30. A. Yao, "Theory and applications of trapdoor functions (extended abstract)," in 23rd Annual Symposium on Foundations of Computer Science. Chicago, Illinois: IEEE Computer Society Press, Nov. 1982, pp. 80-91.
31. K. Leino and R. Joshi, "A Semantic Approach to Secure Information Flow," in Mathematics of Program Construction, MPC '98, ser. LNCS, J. Jeuring, Ed., vol. 1422. Marstrand, Sweden: Springer-Verlag, June 1998, pp. 254-271.
32. P. Lincoln, J. Mitchell, M. Mitchell, and A. Scedrov, "A Probabilistic Poly-Time Framework for Protocol Analysis," in CCS '98, Proceedings of the 5th ACM Conference on Computer and Communications Security. San Francisco, California: ACM Press, Nov. 1998, pp. 112-121.
33. C. E. Shannon, "A Mathematical Theory of Communication," Bell System Technical Journal, vol. 27, pp. 379-423 and 623-656, 1948.
34. D. Denning, "A Lattice Model of Secure Information Flow," Communications of the ACM, vol. 19, no. 5, pp. 236-243, 1976.
35. D. Denning and P. Denning, "Certification of Programs for Secure Information Flow," Communications of the ACM, vol. 20, no. 7, pp. 504-513, 1977.
36. D. Volpano, G. Smith, and C. Irvine, "A Sound Type System for Secure Flow Analysis," Journal of Computer Security, vol. 4, no. 2, 3, pp. 167-187, 1996.