Winter School on Secure Computation and Efficiency

Background: In the setting of secure computation, two or more parties with private inputs wish to compute some joint function of their inputs. The security requirements of such a computation are privacy (meaning that the parties learn the output and nothing more), correctness (meaning that the output is correctly distributed), independence of inputs, and more. This setting encompasses computations as simple as coin-tossing and agreement, and as complex as electronic voting, electronic auctions, electronic cash schemes, anonymous transactions, and private information retrieval schemes. Due to its generality, secure computation is a central tool in cryptography. The target audience for the school is graduate students and postdocs in cryptography (we will assume background in cryptography, but not secure computation). However, faculty, undergrads and professionals with the necessary background are welcome. The winter school is open to participants from all over the world; all talks will be in English.

Topics:

• Background and Definitions – Yehuda Lindell

• The Yao construction and Its Proof of Security – Yehuda Lindell

• The GMW Construction: the Multiparty Case and Security for Malicious – Benny Pinkas

• The BGW Construction for the Information Theoretic Setting – Benny Pinkas

• Sigma Protocols – Yehuda Lindell

• Oblivious Transfer – Benny Pinkas

• Two-Party Secure Computation for Malicious Adversaries – Yehuda Lindell

• Constructions for Specific Function of Interest – Benny Pinkas

• Fully Homomorphic Encryption (two lectures) – Shai Halevi

• Efficient Secure Computation with an Honest Majority – Yuval Ishai

• The IPS Compiler and Related Constructions – Yuval Ishai