Skip to Main content Skip to Navigation
Conference papers

Studying Formal Security Proofs for Cryptographic Protocols

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.inria.fr/hal-01690962
Contributor : Hal Ifip <>
Submitted on : Tuesday, January 23, 2018 - 3:25:42 PM
Last modification on : Tuesday, January 23, 2018 - 3:32:25 PM
Document(s) archivé(s) le : Thursday, May 24, 2018 - 12:05:16 PM

File

449889_1_En_6_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Konstantin Kogos, Sergey Zapechnikov. Studying Formal Security Proofs for Cryptographic Protocols. 10th IFIP World Conference on Information Security Education (WISE), May 2017, Rome, Italy. pp.63-73, ⟨10.1007/978-3-319-58553-6_6⟩. ⟨hal-01690962⟩

Share

Metrics

Record views

139

Files downloads

67