International Teaching | SECURE MULTI-PARTY COMPUTATION
International Teaching SECURE MULTI-PARTY COMPUTATION
Back
cod. 8860100009
SECURE MULTI-PARTY COMPUTATION
| 8860100009 | |
| COMPUTER SCIENCE | |
| Corso di Dottorato (D.M.226/2021) | |
| COMPUTER SCIENCE | |
| 2024/2025 |
| YEAR OF COURSE 1 | |
| YEAR OF DIDACTIC SYSTEM 2024 | |
| SPRING SEMESTER |
| SSD | CFU | HOURS | ACTIVITY | |
|---|---|---|---|---|
| INF/01 | 3 | 18 | LESSONS |
| Objectives | |
|---|---|
| INTRODUCING THE STUDENT TO THE FOUNDATIONS OF SECURE MULTI-PARTY COMPUTATION (MPC, FOR SHORT), NEEDED FOR UNDERSTANDING THE DESIGN, THE WORKINGS, AND THE SECURITY OF SYSTEMS AND APPLICATIONS. EXPECTED LEARNING RESULTS: KNOWLEDGE AND UNDERSTANDING - KNOWLEDGE OF THE METHODOLOGY: THE REAL WORLD AND IDEAL WORLD PARADIGM - KNOWLEDGE OF THE MAIN EXISTENTIAL RESULTS IN THE FIELD - KNOWLEDGE OF THE BASIC TOOLS FOR MPC: CIRCUIT REPRESENTATION, OBLIVIOUS TRANSFER, SECRET SHARING - KNOWLEDGE OF THE GENERAL SOLUTIONS FOR THE TWO-PARTY CASE AND THE MULTI-PARTY CASE - KNOWLEDGE OF THE MAIN AD HOC PROTOCOLS FOR PRIVATE SET INTERSECTION - KNOWLEDGE OF THE MAIN TOOLS TO SUPPORT IMPLEMENTATIONS ABILITY TO APPLY KNOWLEDGE AND UNDERSTANDING - SKILLS FOR EXPRESSING IN A RIGOROUS FORM SECURE MULTI-PARTY PROBLEMS AND TO PROVIDE CLEVER SOLUTIONS BY APPLYING THE METHODOLOGY - SKILLS TO ANALYZE SECURITY AND PROTOCOL PROPERTIES - SKILLS TO IDENTIFY CRYPTOGRAPHIC TOOLS SUITABLE FOR EACH SPECIFIC SETTING - SKILLS TO DISCUSS WITH A TECHNICAL LANGUAGE AND, IF NEEDED, INFORMALLY THE ISSUES IN THE AREA |
| Prerequisites | |
|---|---|
| BASIC NOTIONS OF DISCRETE MATHEMATICS, LINEAR ALGEBRA, PROBABILITY THEORY, DESIGN AND ANALYSIS OF ALGORITHMS, AND THEORY OF COMPUTING. OPTIONAL: MODERN CRYPTOGRAPHY |
| Contents | |
|---|---|
| INTRODUCTION TO MPC: AN OVERVIEW (2H) MODERN CRYPTOGRAPHY: METHODOLOGY, PSEUDO-RANDOMNESS, SECURITY REDUCTIONS (2H) SIMULATION PARADIGM: REAL WORLD AND IDEAL WORLD (2H) BASIC TOOLS: OBLIVIOUS TRANSFER AND SECRET SHARING (2H) SECURE TWO-PARTY COMPUTATION: YAO’S PROTOCOL (2H) SECURE MULTI-PARTY COMPUTATION: GMW, BGW AND BMR PROTOCOLS (3H) PRIVATE SET INTERSECTION: MAIN SOLUTIONS (3H) PLATFORM FOR IMPLEMENTATIONS (2H) |
| Teaching Methods | |
|---|---|
| CLASS LECTURES WITH PRACTICAL EXAMPLES AND CASE STUDIES. |
| Verification of learning | |
|---|---|
| THE FINAL EXAM AIMS AT EVALUATING THE UNDERSTANDING AND THE KNOWLEDGE ACQUIRED BY THE STUDENT IN CLASS. AT THE SAME TIME, THE ABILITY TO APPLY SUCH A KNOWLEDGE IN THE DESIGN OF EFFICIENT SOLUTIONS FOR MPC PROBLEMS. THE FINAL EXAM IS DIVIDED INTO A PROJECT AND AN ORAL EXAM. THE PROJECT TESTS THE STUDENT'S ABILITY TO USE THE METHODOLOGY TO SOLVE A TARGET PROBLEM. THE ORAL EXAM IS USED TO EVALUATE THE KNOWLEDGE OF THE WHOLE PROGRAM AND TO QUANTIFY THE QUALITY, THE ROBUSTNESS, AND THE MASTERSHIP OF THE ACQUIRED TECHNIQUES BY THE STUDENT. THE PROJECT CONTRIBUTES TO 40% OF THE FINAL EVALUATION, WHILE THE ORAL EXAM CONTRIBUTES TO THE OTHER 60%. |
| Texts | |
|---|---|
| J. KATZ AND Y. LINDELL, INTRODUCTION TO MODERN CRYPTOGRAPHY (3RD EDITION), CRC PRESS, 2021 (EXTRACTS FROM CHAPTERS 1-3) A. WIGDERSON MATHEMATICS AND COMPUTATION, PRINCETON UNIVERSITY PRESS, 2019 (CHAPTER 18) D. EVANS, V. KOLESHNIKOV, M. ROSULEK A PRAGMATIC INTRODUCTION TO SECURE MULTIPARTY COMPUTATION NOW EDITION, 2021. (CHAPTERS 1-4) |
| More Information | |
|---|---|
| SLIDES, LECTURE NOTES AND REFERENCES TO PAPERS |
BETA VERSION Data source ESSE3
