SubjectsSubjects(version: 845)
Course, academic year 2018/2019
   Login via CAS
Foundations of theoretical cryptography - NTIN104
Title in English: Foundations of theoretical cryptography
Guaranteed by: Computer Science Institute of Charles University (32-IUUK)
Faculty: Faculty of Mathematics and Physics
Actual: from 2018 to 2018
Semester: summer
E-Credits: 5
Hours per week, examination: summer s.:2/1 C+Ex [hours/week]
Capacity: unlimited
Min. number of students: unlimited
State of the course: taught
Language: Czech, English
Teaching methods: full-time
Guarantor: Mgr. Pavel Hubáček, Ph.D.
Class: M Mgr. MMIB
M Mgr. MMIB > Povinně volitelné
Annotation -
Last update: RNDr. Ondřej Pangrác, Ph.D. (24.04.2017)
The central aim of modern cryptography is to characterize the minimal necessary assumptions for solving given cryptographic task. This course introduces general cryptographic assumptions and their applications in constructions of cryptographic primitives and provably secure protocols. We also demonstrate some more advanced applications in cryptographic currencies and secure computation.
Aim of the course -
Last update: RNDr. Ondřej Pangrác, Ph.D. (24.04.2017)

To teach foundations of provable security with focus on general cryptographic assumptions and their applications in constructions of cryptographic primitives and protocols.

Course completion requirements - Czech
Last update: Mgr. Pavel Hubáček, Ph.D. (13.10.2017)

Zápočet bude udělen za zisk dostatečného počtu bodů udělovaných průběžně za řešení domácích úloh a aktivitu na hodinách. Pro udělení zápočtu je potřeba získat alespoň 65 procent bodů za domácí úkoly.

Zkouška bude ústní. Pro složení zkoušky je nutné prokázat adekvátní znalost látky probrané na přednáškách.

Literature -
Last update: RNDr. Ondřej Pangrác, Ph.D. (24.04.2017)

J. Katz, Y. Lindell: Introduction to Modern Cryptography, Second Edition. CRC Press 2014

O. Goldreich: The Foundations of Cryptography - Volume 1, Basic Techniques. Cambridge University Press 2001

O. Goldreich: The Foundations of Cryptography - Volume 2, Basic Applications. Cambridge University Press 2004

Syllabus -
Last update: RNDr. Ondřej Pangrác, Ph.D. (24.04.2017)

BASICS

  • one-time pad, perfect security, computational security, indistinguishability
  • pseudorandom generators and computational one-time pad
  • pseudorandom functions and permutations

DATA INTEGRITY

  • Message Authentication Codes and cryptographic hashing
  • signature schemes
  • applications in cryptographic currencies: Bitcoin

ZERO-KNOWLEDGE

  • definitions and basic protocols
  • commitment schemes
  • applications in cryptographic currencies: Zerocash

SECURE COMPUTATION

  • simulation paradigm
  • oblivious transfer
  • secret sharing
  • garbled circuits

 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html