The references listed are optional, and sometimes go well beyond what we covered in class.

When scribing notes, please use this preamble. This sample file illustrates how to use it. Please note: The scribe notes have for the most part not been edited by me, and may contain errors.

Lectures and scribe notes

Additional references

Other notions of security: covert security (with public verifiability); 1-bit leakage: Aumann-Lindell 2007 (covert security), Asharov-Orlandi 2012, Hong et al. 2018, Damgård et al. 2020 (covert security with public verifiability), Huang et al. 2012 (1-bit leakage)

Malicious OT (extension) protocols: Asharov et al., Keller et al., Masny-Rindal, Büscher et al., Guo et al.

Practical considerations
References: Barak et al., Hastings et al.

Oblivious transfer

Pragmatic MPC

Distributed point functions (DPFs)

Implementations of semi-honest secure two-party computation.
References: Fairplay, TASTY (see also here), Huang et al. 2011, Choi et al., Schneider-Zohner 2013

Implementations of multi-party computation with semi-honest security.
References: FairplayMP, SecureSCM, sugar-beet auction, SEPIA, Sharemind, VIFF, MPC for financial-data analysis, Choi et al.

References: Peikert et al. 2008,

More efficient cut-and-choose in the two-party setting.
References: Lindell 2013, Huang et al. 2013

The IPS compiler.
References: Ishai-Prabhakaran-Sahai, Lindell-Pinkas-Oxman

The Damgard-Orlandi protocol for malicious MPC without honest majority.
References: Damgard-Orlandi (see also here for an implementation)