Chapter 1 On Multiparty Garbling of Arithmetic Circuits

Chapter 2 $$\mathsf {Free\ }{} \mathtt{IF} $$ : How to Omit Inactive Branches and Implement $$\mathcal {S}$$ -Universal Garbled Circuit (Almost) for Free

Chapter 3 Secure Computation with Low Communication from Cross-Checking

Chapter 4 Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)

Chapter 5 Non-interactive Secure Computation from One-Way Functions

Chapter 6 Simple and Efficient Two-Server ORAM

Chapter 7 More is Less: Perfectly Secure Oblivious Algorithms in the Multi-server Setting

Chapter 8 A Universally Composable Framework for the Privacy of Email Ecosystems

Chapter 9 State Separation for Code-Based Game-Playing Proofs

Chapter 10 Security of the Blockchain Against Long Delay Attack

Chapter 11 Homomorphic Secret Sharing for Low Degree Polynomials

Chapter 12 Constructing Ideal Secret Sharing Schemes Based on Chinese Remainder Theorem

Chapter 13 Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols

Chapter 14 Towards Practical Key Exchange from Ordinary Isogeny Graphs

Chapter 15 CSIDH: An Efficient Post-Quantum Commutative Group Action

Chapter 16 Computing Supersingular Isogenies on Kummer Surfaces

Chapter 18 Simple and More Efficient PRFs with Tight Security from LWE and Matrix-DDH

Chapter 19 Simulatable Channels: Extended Security that is Universally Composable and Easier to Prove