Secure Computation

Course objectives

General Objectives The objectives of this course consist of presenting the concept of secure computation with the purpose of designing systems for data protection according to the data in use paradigm, therefore avoiding data leakage towards servers, satisfying the principle of data minimization. This course include both theoretical and practical contents. Specific Objectives The course will introduce the concepts of security through simulation, the use of garbled circuits, the computations through encrypted data via homomorphic encryption, secret sharing and fairness in in distributed computations, including both theoretical and practical aspects, presenting concrete use cases and devoting part of the allocated time to the use of libraries allowing to concretely implement software including the above functionalities. Knowledge and Understanding: -) Knowledge of the concept of secure, fair and private computation. -) Knowledge of the cryptographic tools useful for secure computation. -) Understanding the practical limits when achieving practical secure computation. Applying knowledge and understanding: -) Use of libraries to realize applications of secure computation. -) Measure the performance and the obtained security levels with existing libraries. Critiquing and judgmental skills: The students will be able to judge the actual (in)security of a design and its performance. Communication Skills: The students will learn how to illustrate the various options to securely realize systems through techniques of secure computation.

Channel 1
IVAN VISCONTI Lecturers' profile

Program - Frequency - Exams

Course program
Secure Communication Ideal-Real World Paradigm for Secure Computation Secure Two-Party Computation Commitment Schemes (and coin flipping) Secure Proof Systems Non-malleability Oblivious Transfer Garbled Circuits GMW-Compiler (Verifiable) Secret Sharing Secure Multi-Party Computation Concurrency and Universal Composability Fairness and Optimistic Security Combiners Fully Homomorphic Encryption Popular Applications Libraries/Tools for Secure Computation
Prerequisites
Knowledge of basic cryptographic tools and notions.
Books
Carmit Hazay, Yehuda Lindell:​ Efficient Secure Two-Party Protocols - Techniques and Constructions. Information Security and Cryptography​ Springer 2010, ISBN 9783642143021.​ David Evans, Vladimir Kolesnikov and Mike Rosulek, A Pragmatic Introduction to Secure MultiParty Computation. NOW Publishers, 2018, ISBN:9781680835083. Dan Boneh and Victor Shoup: A Graduate Course in Applied Cryptography (online). Slides and resources that the lecturer will make timely available to the students.
Frequency
Attendance is not mandatory but strongly suggested.
Exam mode
Specific questions will require answers spanning over a large part of the program of the course. The final evaluation will take into account the quality of each answer and the overall view inferred by them. There will be a written exam and the possibility of an oral exam will be taken into account by the commission in specific circumstances.
Lesson mode
Lectures with consist of illustrating the contents of slides and of a whiteboard (and/or a graphics tablet) with interaction and practical examples about the use of tools and libraries.
  • Lesson code1054962
  • Academic year2025/2026
  • CourseCybersecurity
  • CurriculumSingle curriculum
  • Year1st year
  • Semester2nd semester
  • SSDINF/01
  • CFU6