Symmetric encryption in a simulatable Dolev-Yao style cryptographic library

Proceedings of the Computer Security Foundations Workshop

Volumn 17, Issue , 2004, Pages 204-218

  Backes, Michael ^a   Pfitzmann, Birgit ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CANCELLATION RULES; CRYPTOGRAPHIC LIBRARY; NESTED TERMS; SYMMETRIC ENCRYPTION;

ABSTRACTING; AUTOMATION; NETWORK PROTOCOLS; PROBABILITY; PROBLEM SOLVING; SECURITY OF DATA;

CRYPTOGRAPHY;

EID: 4944234643     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. M. Abadi and J. Jürjens. Formal eavesdropping and its computational interpretation. In Proc. 4th International Symposium on Theoretical Aspects of Computer Software, pages 82-94, 2001.
2. M. Abadi and P. Rogaway. Reconciling two views of cryptography: The computational soundness of formal encryption. In Proc. 1st IFIP International Conference on Theoretical Computer Science, volume 1872 of LNCS, pages 3-22. Springer, 2000.
3. M. Backes and B. Pfitzmann. A cryptographically sound security proof of the Needham-Schroeder-Lowe public-key protocol. In Proc. 23rd Conference on Foundations of Software Technology and Theoretical Computer Science, pages 1-12, 2003.
4. M. Backes and B. Pfitzmann. Symmetric encryption in a simulatable Dolev-Yao style cryptographic library. IACR Cryptology ePrint Archive 2004/059, Feb. 2004.
5. M. Backes, B. Pfitzmann, and M. Waidner. A composable cryptographic library with nested operations (extended abstract). In Proc. 10th ACM Conference on Computer and Communications Security, pages 220-230, 2003.Full version in IACR Cryptology ePrint Archive 2003/015.
6. M. Backes, B. Pfitzmann, and M. Waidner. Symmetric authentication within a simulatable cryptographic library. In Proc. 8th European Symposium on Research in Computer Security, volume 2808 of LNCS, pages 271-290. Springer, 2003.
7. M. Backes, B. Pfitzmann, and M. Waidner. A general composition theorem for secure reactive systems. In Proc. 1st Theory of Cryptography Conference, pages 336-354, 2004.
8. M. Backes, B. Pfitzmann, and M. Waidner. Secure asynchronous reactive systems. IACR Cryptology ePrint Archive 2004/082, Mar. 2004.
9. D. Beaver. Plug and play encryption. In Proc. CRYPTO '97, volume 1294 of LNCS, pages 75-89. Springer, 1997.
10. D. Beaver and S. Haber. Cryptographic protocols provably secure against dynamic adversaries. In Proc. EUROCRYPT '92, volume 658 of LNCS, pages 307-323. Springer, 1992.
11. M. Bellare and C. Namprempre. Authenticated encryption: Relations among notions and analysis of the generic composition paradigm. In Proc. ASIACRYPT 2000, volume 1976 of LNCS, pages 531-545. Springer, 2000.
12. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proc. 1st ACM Conference on Computer and Communications Security, pages 62-73, 1993.
13. M. Bellare and P. Rogaway. Encode-then-encipher encryption: How to exploit nonces or redundancy in plaintexts for efficient constructions. In Proc. ASIACRYPT 2000, volume 1976 of LNCS, pages 317-330. Springer, 2000.
14. J. Benaloh and D. Tuinstra. Uncoercible communication. Computer Science Technical Report TR-MCS-94-1, Clarkson University, 1994.
15. R. Canetti, U. Feige, O. Goldreich, and M. Naor. Adaptively secure multi-party computation. In Proc. 28th Annual ACM Symposium on Theory of Computing, pages 639-648, 1996.
16. R. Canetti, O. Goldreich, and S. Halevi. The random oracle methodology, revisited. In Proc. 30th Annual ACM Symposium on Theory of Computing, pages 209-218, 1998.
17. J. Clark and J. Jacob. A survey of authentication protocol literature: Version 1.0, Nov. 1997. http://www.cs.york.ac.uk/~jac/papers/drareview.ps.gz.
18. I. Damgård and J. B. Neilsen. Improved non-committing encryption schemes based on a general complexity assumption. In Proc. CRYPTO 2000, volume 1880 of LNCS, pages 432-450. Springer, 2000.
19. D. Dolev and A. C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983.
20. J. Herzog. Computational Soundness of Formal Adversaries. PhD thesis, MIT, 2002.
21. J. Herzog, M. Liskov, and S. Micali. Plaintext awareness via key registration. In Proc. CRYPTO 2003, volume 2729 of LNCS, pages 548-564. Springer, 2003.
22. R. Impagliazzo and B. M. Kapron. Logics for reasoning about cryptographic constructions. In Proc. 44th Symposium on Foundations of Computer Science, pages 372-381, 2003.
23. P. Laud. Symmetric encryption in automatic analyses for confidentiality against active adversaries. Manuscript, 2004.
24. P. Laud. Semantics and program analysis of computationally secure information flow. In Proc. 10th European Symposium on Programming, pages 77-91, 2001.
25. P. Lincoln, J. Mitchell, M. Mitchell, and A. Scedrov. A probabilistic poly-time framework for protocol analysis. In Proc. 5th ACM Conference on Computer and Communications Security, pages 112-121, 1998.
26. D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Proc. 1st Theory of Cryptography Conference, volume 2951 of LNCS, pages 133-151. Springer, 2004.
27. J. Millen. On the freedom of decryption. Information Processing Letters, 86(6):329-333, June 2003.
28. J. Mitchell, M. Mitchell, and A. Scedrov. A linguistic characterization of bounded oracle computation and probabilistic polynomial time. In Proc. 39th Symposium on Foundations of Computer Science, pages 725-733, 1998.
29. J. Mitchell, M. Mitchell, A. Scedrov, and V. Teague. A probabilistic polynominal-tune process calculus for analysis of cryptographic protocols (preliminary report). Electronic Notes in Theoretical Computer Science, 47:1-31, 2001.
30. B. Pfitzmann and M. Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In Proc. 22nd IEEE Symposium on Security & Privacy, pages 184-200, 2001.
31. P. Rogaway, M. Bellare, J. Black, and T. Krovetz. OCB: A block-cipher mode of operation for efficient authenticated encryption. In Proc. 8th ACM Conference on Computer and Communications Security, pages 196-205, 2001.
32. B. Warinschi. A computational analysis of the Needham-Schroeder-(Lowe) protocol. In Proc. 16th IEEE Computer Security Foundations Workshop, pages 248-262, 2003.
33. A. C. Yao. Theory and applications of trapdoor functions. In Proc. 23rd Symposium on Foundations of Computer Science, pages 80-91, 1982.