%0 Conference Proceedings
%T Studying Formal Security Proofs for Cryptographic Protocols
%+ The National Research Nuclear University MEPhI (Moscow Engineering Physics Institute) [Moscow, Russia]
%A Kogos, Konstantin, G.
%A Zapechnikov, Sergey, V.
%Z Part 2: Teaching Information Security
%< avec comité de lecture
%( IFIP Advances in Information and Communication Technology
%B 10th IFIP World Conference on Information Security Education (WISE)
%C Rome, Italy
%Y Matt Bishop
%Y Lynn Futcher
%Y Natalia Miloslavskaya
%Y Marianthi Theocharidou
%I Springer International Publishing
%3 Information Security Education
%V AICT-503
%P 63-73
%8 2017-05-29
%D 2017
%R 10.1007/978-3-319-58553-6_6
%K Information security science
%K Syllabus
%K Information security training
%K Cryptography
%K Provable security
%Z Computer Science [cs]Conference papers
%X This paper discusses the problem of teaching provable security in cryptography when studying information security. The concept of provable security is one of the most important in modern cryptography, soit is necessary to integrate it into the syllabus on cryptographic protocols. Now provable security is not rare thing in basic cryptography courses. However, security proofs for cryptographic protocols are far more complicated than for primitives. We suggest the way of embedding Sequence of Games technique, Universally Composability framework, module design of protocols and other techniques into the cryptography protocols course. Our experience of teaching formal security proofs for cryptographic protocols brings quite positive effect for students’ research and development.
%G English
%Z TC 11
%Z WG 11.8
%2 https://inria.hal.science/hal-01690962/document
%2 https://inria.hal.science/hal-01690962/file/449889_1_En_6_Chapter.pdf
%L hal-01690962
%U https://inria.hal.science/hal-01690962
%~ IFIP
%~ IFIP-AICT
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC11
%~ IFIP-WISE
%~ IFIP-WG11-8
%~ IFIP-AICT-503