The layered games framework for specifications and analysis of security protocols

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

Volumn 4948 LNCS, Issue , 2008, Pages 125-141

  Herzberg, Amir ^a   Yoffe, Igal ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; GAME THEORY; MICROFLUIDICS; NETWORK PROTOCOLS; SPECIFICATIONS;

(E ,2E) THEORY; COMPLEX DISTRIBUTED SYSTEMS; SECURITY PROTOCOLS;

COMPUTER NETWORKS;

EID: 40249116752     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78524-8_8     Document Type: Conference Paper

References (35)

1. Abadi, Rogaway: Reconciling two views of cryptography (the computational soundness of formal encryption). JCRYPTOL: Journal of Cryptology 15 (2002)
2. Abadi, M., Lamport, L.: Composing specifications. ACM Trans. Program. Lang. Syst. 15(1), 73 132 (1993)
3. Backes, Datta, Derek, Mitchell, Turuani: Compositional analysis of contract-signing protocols. TCS: Theoretical Computer Science 367 (2006)
4. Backes, M., Dürmuth, M., Hofheinz, D., Küsters, R.: Conditional Reactive Simulatability. In: Gollmann, D., Meier, J., Sabelfeld, A. (eds.) ESORICS 2006. LNCS, vol. 4189, pp. 424-443. Springer, Heidelberg (2006)
5. Backes, M., Pfitzmann, B., Waidner, M.: A General Composition Theorem for Secure Reactive Systems. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 336 354. Springer, Heidelberg (2004)
6. Backes, M., Pfitzmann, B., Waidner, M.: Secure Asynchronous Reactive Systems. Cryptology ePrint Archive, Report, 2004/082 (2004), http://eprint.iacr.org/
7. Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A concrete security treatment of symmetric encryption. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS 1997), October 20-22, IEEE Computer Society Press, Los Alamitos (1997)
8. Bellare, M., Rogaway, P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 3-540." Springer, Heidelberg (2006), http://dx.doi.org/10.1007/11761679_25
9. Bradner, S.: Key words for use in RFCs to Indicate Requirement Levels. RFC (Best Current Practice) (March 1.997), http://www.ietf.org/rfc/rfc2119.txt
10. Burrows, Abadi, Needham: A logic of authentication. ACMTCS: ACM Transactions on Computer Systems 8 (1990)
11. Canetti, Kushilevitz, Lindell: On the limitations of universally composable two-party computation without set-up assumptions. In: JCRYPTOL: Journal of Cryptology, 19th edn. (2006)
12. Canetti, R.: Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology 13(1), 143-202 (2000)
13. Canetti, R., Fischlin, M.: Universally Composable Commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19 40. Springer, Heidelberg (2001)
14. Canetti, R.: Universally Composable Security: A. New Paradigm for Cryptographic Protocols. In: IEEE Symposium on Foundations of Computer Science, pp. 136-145 (2001) updated version: Cryptology ePrint Archive, Report 2000/067
15. Canetti, R., Cheung, L., Kaynar, D.K., Liskov, M., Lynch, N.A., Pereira, O., Segala, R.: Time-bounded task-PIOAs: A framework for analyzing security protocols. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 41.67, pp. 3-540. Springer, Heidelberg (2006), http://dx.doi.org/10.1007/11864219.17
16. Datta, A., Derek, A., Mitchell, J.C., Pavlovic, D.: A derivation system and compositional logic for security protocols. J. Comput. Secur. 13(3), 423-482 (2005)
17. Datta, A., Derek, A., Mitchell, J.C., Ramanathan, A., Scedrov, A.: Games and the impossibility of realizable ideal functionality. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 360-379. Springer, Heidelberg (2006)
18. Dolev, D., Yao, A.: On the security of public key protocols. IEEE Transactions on Information Theory 29(2), 198-208 (1983)
19. Goldreich, Goldwasser, Micali: How to construct random functions. JACM: Journal of the ACM 33 (1986)
20. Goldreich, O.: Foundations of Cryptography. Basic Applications, vol. 2. Cambridge University Press, New York (2004)
21. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: STOC, pp. 218-229. ACM, New York (1987)
22. Goldwasser, S., Micali, S.: Probabilistic encryption & how to play mental poker keeping secret all partial information. In: STOC 1982: Proceedings of the fourteenth annual ACM symposium on Theory of computing, pp. 365-377. ACM Press, New York, USA (1982)
23. Goldwasser, S., Micali, S., Yao, A.: Strong signature schemes. In: STOC 1983: Proceedings of the fifteenth annual ACM symposium on Theory of computing, pp. 431-439. ACM Press, New York, USA (1983)
24. Halevi, S.: A. plausible approach to computer-aided cryptographic proofs. Report, 2005/181, Cryptology ePrint Archive (June 2005), http ://eprint.iacr.org/2005/181.pdf
25. Herzberg, A., Yoffe, I.: Layered Architecture for Secure E-Commerce Applications. In: SECRYPT 2006 - International Conference on Security and Cryptography, pp. 118-125. INSTICC Press (2006)
26. Herzberg, A., Yoffe, I.: On Secure Orders in the Presence of Faults. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol. 4116, pp. 126-140. Springer, Heidelberg (2006) New version: Foundations of Secure E-Commerce: The Order Layer, in Cryptology ePrint Archive, Report 2006/352.
27. Herzberg, A., Yoffe, I.: The delivery and evidences layer. Cryptology ePrint Archive, Report 2007/139 (2007), http://eprint.iacr.org/
28. Herzberg, A., Yoffe, I.: Layered specifications, design and analysis of security protocols. Cryptology ePrint Archive, Report 2006/398 (2006)
29. Hofheinz, D., Müller-Quade, J., Unruh, D.: Polynomial Runtime in Simulatability Definitions. In: CSFW 2005: Proceedings of the 18th IEEE Computer Security Foundations Workshop (CSFW 2005), Washington, DC, USA, pp. 156-169. IEEE Computer Society, Los Alamitos (2005)
30. Kurose, J.F., Ross, K.W.: Computer networking: a top-down approach featuring the Internet. Addison-Wesley, Reading (2003)
31. Küsters, R.: Simulation-Based Security with Inexhaustible Interactive Turing Machines. In: CSFW 2006: Proceedings of the 19th IEEE Workshop on Computer Security Foundations, Washington, DC, USA, pp. 309-320. IEEE Computer Society Press, Los Alamitos (2006)
32. Lincoln, P., Mitchell, J., Mitchell, M., Scedrov, A.: A. probabilistic poly-time framework for protocol analysis. In: CCS 1998: Proceedings of the 5th ACM conference on Computer and communications security, pp. 112-121. ACM Press, New York (1998)
33. Lynch, N.A., Tuttle, M.R.: Hierarchical correctness proofs for distributed algorithms. In: PODC 1987: Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, pp. 137-151. ACM Press, New York (1987)
34. Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: CCS 2000: Proceedings of the 7th ACM conference on Computer and communications security, pp. 245-254. ACM Press, New York (2000)
35. Pfitzmann, B., Waidner, M.: A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission. In: SP 2001: Proceedings of the 2001 IEEE Symposium on Security and Privacy, Washington, DC, USA, pp. 184-200. IEEE Computer Society Press, Los Alamitos (2001)