print

Multiparty Computation and Blockchains

T
Technical Teaching
MPC
FAONIO Antonio
Abstract

The goal of this course is to introduce the students to the basic concepts of secure multiparty computation, the foundational MPC protocols and more advanced blockchains protocols.

Teaching and Learning Methods: Lectures and homework.

Course Policies: Final projects and homework are not mandatory.

Bibliography

  • Book: EVANS D., KOLESNIKOV V., ROSULEK M. A Pragmatic Introduction to Secure Multi-Party Computation. Now Publishers Inc, 2018, 190p. https://securecomputation.org/

  • Book: CRAMER R., DAMGAARD I. B., NIELSEN J. B. Secure Multiparty Computation and Secret Sharing. Cambridge University Press, 2015, 381p.

  • Book: NARAYANAN A., BONNEAU J., FELTEN E., MILLER A., GOLDFEDER S. Bitcoin and Cryptocurrency Technologies. Princeton University Press, 2016, 336p. http://bitcoinbook.cs.princeton.edu/

  • Slides and Scientific Papers

Requirements

Students must have followed “Secure communications” (SecCom) or equivalent prior to taking this course. Students are encouraged to follow “Security and privacy for Big Data and Cloud” (BigSec) prior to taking this course. Basic knowledge of probability, group theory, and linear algebra is mandatory.

Description
  • The simulation paradigm, security models for MPC (semi-honest security, malicious security)
  • Garbled Circuits and 2PC, Oblivious Transfer (semi-honest security, malicious security, malicious security with aborts), Commitment schemes
  • Secret Sharing Schemes (SSS) (Additive Secret Sharing, Shamir’s Secret Sharing)
  • Semi-honest MPC based on SSS (GMW; BGW)
  • Cryptographic compilers (GMW compiler from semi-honest to malicious security), Zero-Knowledge Proofs, Coin-Tossing protocols
  • Foundational concepts of Blockchains (permission-less vs permissioned, Sybil attack, Distributed Ledger, Chernoff Bound, Blockchain Backbone)
  • Proof-of-work based Blockchains
  • Proof-of-stake based Blockchains

Learning Outcomes:

  • The students will be able to reason about the security requirements of cryptographic protocols
  • The studends will understand formal definitions of security
  • The students will be able to design protocols that are secure.
  • The students will be able to verify that a protocol is secure according to a formal definition.
  • Have a basic knowledge of the most known MPC and Blockchains protocols

Nb hours: 21.00

Evaluation:

  • Final project with oral presentation (25% of the final grade),

  • Exam (75% of the final grade).