Course detail

Cryptologic Protocol Theory

FEKT-XPC-CPTAcad. year: 2021/2022

The course contains the introduction into advanced cryptography and provides the students with the information about basic cryptographic primitives and schemes. In particular, the commitment schemes, interactive proof systems, zero-knowledge protocols, sigma protocols, interactive and non-interactive proof of knowledge protocols, group signatures and advanced systems like eCash and attribute-based credentials are covered.

Language of instruction

Czech

Number of ECTS credits

5

Mode of study

Not applicable.

Guarantor

prof. Ing. Jan Hajný, Ph.D.

Department

Department of Telecommunications (UTKO)

Learning outcomes of the course unit

Students will obtain theoretical knowledge of main primitives used in modern cryptography, in particular of commitment schemes, zero-knowledge protocols, sigma-protocols and advanced schemes built using these primitives. After course completion, students will be able to:

Explain in English the principles of cryptographic commitments, zero-knowledge protocols and sigma protocols.
Design the interactive proof of knowledge protocols.
Use the commitment schemes in complex cryptosystems.
Evaluate speed and computational efficiency of standard proof of knowledge protocols.
Explain in English the principles of attribute authentication systems and eCash systems.

Prerequisites

Basic knowledge of cryptography as provided in the compulsory subject Foundations of Cryptography, in particular of the asymmetric cryptosystems, is required to enroll the course. Furthermore, the basic knowledge of Czech terminology in cryptography and B1 intermediate English level is required.

Co-requisites

Not applicable.

Planned learning activities and teaching methods

Methods of educations are described in the article 7 of the BUT’s Study and Examination Regulation. Teachning methods include lectures and laboratories. Course is taking advantage of e-learning (Moodle) system.

Assesment methods and criteria linked to learning outcomes

The maximum of 40 points is given upon completion of the  tests in laboratories. The requirements on the completion of the tasks in laboratories are described in the annual supervisor’s notice.  The maximum of 60 points can be gained during the final exam. 

Course curriculum

1. Introduction to modern cryptography, Number Theory.
2. Modular arithmetics, Algebraic structures.
3. Basic cryptographic primitives overview.
4. Elliptic curve cryptography.
5. Bilinear pairing.
6. Protocols using bilinear pairing.
7. Commitment schemes.
8. Zero-knowledge protocols.
9. Sigma protocols.
10. Sigma protocols II.
11. Group signatures.
12. Attribute-based credentials. 

Work placements

Not applicable.

Aims

The goal of the course is to extend the introductory cryptology courses and to provide students with deeper knowledge of advanced principles of modern cryptology and English terminology. Students will learn the principles of selected building blocks of modern cryptographic protocols and schemes and will be able to understand English information sources during their further studies.

Specification of controlled education, way of implementation and compensation for absences

The conditions for the successful course completion are stated in the yearly updated supervisor’s notice.

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

DAMGAARD, I.; NIELSEN, J. B. Commitment Schemes and Zero-Knowledge Protocols [online]. Dostupné z: https://cs.au.dk/~ivan/CPT.html (EN)
DAMGAARD, I. On Σ-protocols [online]. Dostupné z: https://cs.au.dk/~ivan/CPT.html (EN)
GARRETT, Paul. Making, breaking codes: an introduction to cryptology. Vyd. 1. Upper Saddle River: Prentice Hall, 2001, xix, 523 s. ISBN 01-303-0369-0. (EN)
MENEZES, Alfred J. Handbook of applied cryptography. Vyd. 1. Boca Raton: CRC Press, 1997, 780 s. ISBN 08-493-8523-7. Online https://cacr.uwaterloo.ca/hac/. (EN)
OCHODKOVÁ, Eliška. Matematické základy kryptografických algoritmů [online]. [cit. 2013-06-11]. Dostupné z: http://mi21.vsb.cz/sites/mi21.vsb.cz/files/unit/mat_zaklady_kryptografickych_algoritmu.pdf (CS)
STALLINGS, William. Cryptography and network security: principles and practice. Seventh edition. xix, 731 pages. ISBN 9781292158587. (EN)

Recommended reading

Not applicable.

Elearning

eLearning: currently opened course

Classification of course in study plans

  • Programme BPC-IBE Bachelor's 3 year of study, summer semester, compulsory

Type of course unit

 

Lecture

26 hod., optionally

Teacher / Lecturer

prof. Ing. Jan Hajný, Ph.D.

Syllabus

1. Úvod do moderní kryptografie
2. Přehled anglické terminologie
3. Přehled základních kryptografických primitiv
4. Kryptografické závazky
5. Využití kryptografických závazků v konstrukci protokolů
6. Interaktivní důkazové systémy
7. Protokoly s nulovou znalostí
8. Sigma protokoly
9. Sigma protkoly II
10. Interaktivní a neinteraktivní důkazy znalosti
11. Integrace primitiv ve vyšší systémy
12. Skupinové podpisy
13. Atributová pověření

Laboratory exercise

26 hod., compulsory

Teacher / Lecturer

M.Sc. Sara Ricci, Ph.D.

Syllabus

1. Úvod do moderní kryptografie
2. Přehled anglické terminologie
3. Přehled základních kryptografických primitiv
4. Kryptografické závazky
5. Využití kryptografických závazků v konstrukci protokolů
6. Interaktivní důkazové systémy
7. Protokoly s nulovou znalostí
8. Sigma protokoly
9. Sigma protkoly II
10. Interaktivní a neinteraktivní důkazy znalosti
11. Integrace primitiv ve vyšší systémy
12. Skupinové podpisy
13. Atributová pověření

Elearning

eLearning: currently opened course