Universally composable symmetric encryption

Proceedings - IEEE Computer Security Foundations Symposium

Volumn , Issue , 2009, Pages 293-307

  Küsters, Ralf ^a   Tuengerthal, Max ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATED ENCRYPTION; COMMITMENT PROBLEM; CRYPTOGRAPHIC ASSUMPTIONS; DIGITAL SIGNATURE; IND-CCA; KEY EXCHANGE; PUBLIC-KEY ENCRYPTION; SECURITY SETTINGS; SIMULATION-BASED; SIMULATION-BASED SECURITY; SYMMETRIC ENCRYPTION; SYMMETRIC ENCRYPTION SCHEMES; UNIVERSALLY COMPOSABLE;

AUTHENTICATION; CHANNEL CAPACITY; PUBLIC KEY CRYPTOGRAPHY; SECURITY SYSTEMS;

NETWORK SECURITY;

EID: 70350540703     PISSN: 19401434     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSF.2009.18     Document Type: Conference Paper

References (31)

1. M. Abadi and P. 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, Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference (IFIPTCS 2000), volume 1872 of Lecture Notes in Computer Science, pages 3-22. Springer-Verlag, 2000.
2. M. Backes and D. Hofheinz. How to Break and Repair a Universally Composable Signature Functionality. In Kan Zhang and Yuliang Zheng, editors, Information Security, 7th International Conference, ISC 2004, Proceedings, volume 3225 of Lecture Notes in Computer Science, pages 61-72. Springer, 2004.
3. M. Backes and B. Pfitzmann. Symmetric Encryption in a Simulatable Dolev-Yao Style Cryptographic Library. In 17th IEEE Computer Security Foundations Workshop (CSFW-17 2004), pages 204-218. IEEE Computer Society, 2004.
4. M. Backes, B. Pfitzmann, and A. Scedrov. Key-dependent Message Security under Active Attacks - BRSIM/UC-Soundness of Symbolic Encryption with Key Cycles. Journal of Computer Security (JCS), 2008.
5. M. Bellare, R. Canetti, and H. Krawczyk. A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols (Extended Abstract). In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing (STOC 1998), pages 419-428. ACM Press, 1998.
6. M. Bellare and C. 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, 2000, Proceedings, volume 1976 of Lecture Notes in Computer Science, pages 531-545. Springer, 2000.
7. 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 (STOC 1995), pages 57-66. ACM, 1995.
8. J. Black, Ph. Rogaway, and Th. Shrimpton. Encryption-Scheme Security in the Presence of Key-Dependent Messages. In Kaisa Nyberg and Howard M. Heys, editors, Selected Areas in Cryptography, 9th Annual International Workshop (SAC 2002), volume 2595 of Lecture Notes in Computer Science, pages 62-75. Springer, 2002.
9. B. Blanchet. A Computationally Sound Mechanized Prover for Security Protocols. In IEEE Symposium on Security and Privacy (S&P 2006), pages 140-154. IEEE Computer Society, 2006.
10. C. Boyd and A. Mathuria. Protocols for Authentication and Key Establishment. Springer, 2003.
11. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS 2001), pages 136-145. IEEE Computer Society, 2001.
12. R. Canetti. Universally Composable Signature, Certification, and Authentication. In Proceedings of the 17th IEEE Computer Security Foundations Workshop (CSFW-17 2004), pages 219-233. IEEE Computer Society, 2004.
13. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. Technical Report 2000/067, Cryptology ePrint Archive, December 2005. Online available at http://eprint.iacr.org/.
14. R. Canetti. Security and Composition of Cryptographic Protocols: A Tutorial. Cryptology ePrint Archive, Report 2006/465, 2006. Online available at http://eprint.iacr.org/.
15. R. Canetti, Y. Dodis, R. Pass, and S. Walfish. Universally Composable Security with Global Setup. In Salil P. Vadhan, editor, Theory of Cryptography, 4th Theory of Cryptography Conference, TCC 2007, Proceedings, volume 4392 of Lecture Notes in Computer Science, pages 61-85. Springer, 2007.
16. R. Canetti and M. Fischlin. Universally Composable Commitments. In Joe Kilian, editor, Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, volume 2139 of Lecture Notes in Computer Science, pages 19-40. Springer, 2001.
17. R. Canetti and J. Herzog. Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols. In Shai Halevi and Tal Rabin, editors, Theory of Cryptography, Third Theory of Cryptography Conference, TCC 2006, Proceedings, volume 3876 of Lecture Notes in Computer Science, pages 380-403. Springer, 2006.
18. R. Canetti and H. Krawczyk. Universally Composable Notions of Key Exchange and Secure Channels. In Lars R. Knudsen, editor, Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings, volume 2332 of Lecture Notes in Computer Science, pages 337-351. Springer, 2002.
19. H. Comon-Lundh and V. Cortier. Computational soundness of observational equivalence. In Peng Ning, Paul F. Syverson, and Somesh Jha, editors, Proceedings of the 15th ACM Conference on Computer and Communications Security (CCS 2008), pages 109-118. ACM Press, 2008.
20. H. Comon-Lundh and V. Cortier. Computational soundness of observational equivalence. Technical Report INRIA Research Report RR-6508, INRIA, 2008. Online available at http://www.loria.fr/?cortier/Papiers/CCS08-report.pdf.
21. A. Datta, A. Derek, J. C. Mitchell, A. Ramanathan, and A. Scedrov. Games and the Impossibility of Realizable Ideal Functionality. In Shai Halevi and Tal Rabin, editors, Theory of Cryptography, Third Theory of Cryptography Conference, TCC 2006, Proceedings, volume 3876 of Lecture Notes in Computer Science, pages 360-379. Springer, 2006.
22. A. Datta, A. Derek, J. C. Mitchell, and B. Warinschi. Computationally Sound Compositional Logic for Key Exchange Protocols. In Proceedings of the 19th IEEE Computer Security Foundations Workshop (CSFW-19 2006), pages 321-334. IEEE Computer Society, 2006.
23. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270-299, 1984.
24. R. Küsters. Simulation-Based Security with Inexhaustible Interactive Turing Machines. In Proceedings of the 19th IEEE Computer Security Foundations Workshop (CSFW-19 2006), pages 309-320. IEEE Computer Society, 2006.
25. R. Küsters and M. Tuengerthal. Joint State Theorems for Public-Key Encryption and Digitial Signature Functionalities with Local Computation. In Proceedings of the 21st IEEE Computer Security Foundations Symposium (CSF 2008), pages 270-284. IEEE Computer Society, 2008.
26. R. Küsters and M. Tuengerthal. Universally Composable Symmetric Encryption. Technical Report 2009/055, Cryp-tology ePrint Archive, 2009. Online available at http://eprint. iacr.org/.
27. P. Laud. Symmetric Encryption in Automatic Analyses for Confidentiality against Active Adversaries. In IEEE Symposium on Security and Privacy 2004 (S&P 2004), pages 71-85. IEEE Computer Society, 2004.
28. R. M. Needham and M. D. Schroeder. Authentication revisited. SIGOPS Operating Systems Review, 21(1):7-7, 1987.
29. B. Pfitzmann and M. Waidner. A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission. In IEEE Symposium on Security and Privacy 2001 (S&P 2001), pages 184-201. IEEE Computer Society Press, 2001.
30. A. Roy, A. Datta, A. Derek, and J. C. Mitchell. Inductive Proofs of Computational Secrecy. In Joachim Biskup and Javier Lopez, editors, Proceedings of the 12th European Symposium On Research In Computer Security (ESORICS 2007), volume 4734 of Lecture Notes in Computer Science, pages 219-234. Springer, 2007.
31. A. Roy, A. Datta, A. Derek, and J. C. Mitchell. Inductive Trace Properties Imply Computational Security. In Proceedings of the 7th International Workshop on Issues in the Theory of Security (WITS 2007), 2007.