Studying Formal Security Proofs for Cryptographic Protocols - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Studying Formal Security Proofs for Cryptographic Protocols

(1) , (1)
1

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.
Fichier principal
Vignette du fichier
449889_1_En_6_Chapter.pdf (550.27 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01690962 , version 1 (23-01-2018)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Konstantin G. Kogos, Sergey V. 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⟩
65 View
326 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More