DATA PRIVACY AND SECURITY

Course objectives

General Objectives Ensuring the privacy of personal data, and securing the computing infrastructures, are key concerns when collecting and analyzing sensitive data sets. Example of these data sets include medical data, personal communication, personal and company-wide financial information. The course is meant to cover an overview of modern techniques aimed at protecting data privacy and security in such applications. Specific Objectives The students will learn the basic cryptographic techniques and their application to obtaining privacy of data in several applications, including cloud computing, statistical databases, distributed computation, and cryptocurrencies. Knowledge and Understanding -) Modern cryptographic techniques and their limitations. -) Techniques for achieving privacy in statistical databases. -) Techniques for designing cryptographic currencies and distributed ledgers. -) Techniques for secure distributed multiparty computation. Applying knowledge and understanding: -) How to select the right cryptographic scheme for a particular application. -) How to design a differentially private mechanism. -) How to program a secure cryptosystem, or a secure smart contract, or a secure cryptographic protocol. Autonomy of Judgment The students will be able to judge the security of the main cryptographic applications. Communication Skills How to describe the security of cryptographic standards, privacy-preserving statistical databases, and blockchains. Next Study Abilities The students interested in research will learn what are the main open challenges in the area, and will obtain the necessary background for a deeper study of the subjects.

Channel 1
DANIELE VENTURI Lecturers' profile

Program - Frequency - Exams

Course program
The course is meant to cover an overview of modern techniques aimed at protecting data privacy and security in digital applications. Below is a list of topics. 1) Brush-up on Cryptography: Confidential communication, secret-key and public-key encryption. Authentic communication, cryptographic hashing, message authentication codes and digital signatures. [20 h] 2) Applications: Key exchange protocols and TLS, authentication protocols, passwords. Outsourcing of storage and computation: Proofs of storage and proofs of retrievability. Verifiable computation. [10 h] 3) Differential Privacy: Privacy-preserving statistical databases. The Laplace mechanism and the exponential mechanism. Lower bounds. [10 h] 4) Distributed ledgers: Cryptocurrencies and the Bitcoin protocol. Smart contracts. [10 h] 5) Secure Computation: Two-party and multi-party computation. Zero knowledge. Yao's garbled circuits. MPC with honest majority. [10 h]
Prerequisites
No specific background is required to attend this course.
Books
Course slides by the lecturer. Additional teaching material can be found at: http://danieleventuri.altervista.org/dps.shtml.
Teaching mode
The course consists of frontal in-person lessons taught by the lecturer. Each lecture is supported by slides distributed by the lecturer. While in-person attendance is not mandatory, the latter is strongly recommended.
Frequency
Attending the lectures is highly recommended.
Exam mode
The exam consists of the following components: 1) Oral exam after the course has ended. The oral exam consists in explaining 3 topics among those covered during the course. To the oral exam, the lecturer assigns a score between 0 and 30. 2) Project/Presentation. During the course the lecturer offers the possibility to deepen one topic among those covered during the course, either by assigning a small project (which might involve coding capabilities), or a research paper to study. The student gives a presentation about his/her project/paper during the oral exam, to which the lecturer assigns a score between 0 and 30. The final score is obtained as weighted average between the grade at the oral exam (with weight 70%) and the grade obtained for the project/paper presentation (with weight 30%).
Bibliography
Daniele Venturi, Crittografia nel Paese delle Meraviglie, Springer, Collana di Informatica, 2012. Jonathan Katz and Yehuda Lindell, Introduction to Modern Cryptography, CRC Press, Second Edition, 2014. Cynthia Dwork and Aaron Roth, The Algorithmic Foundations of Differential Privacy, Foundations and Trends in Theoretical Computer Science, Vol. 9, 2014. Carmit Hazay and Yehuda Lindell, Efficient Secure Two-Party Protocols, Springer, 2010.
Lesson mode
In-person lectures.
  • Lesson code1047214
  • Academic year2025/2026
  • CourseData Science
  • CurriculumSingle curriculum
  • Year2nd year
  • Semester1st semester
  • SSDINF/01
  • CFU6