Secure-Multi-Party-Computation

Hallel Weinberg & Nir Segal & Michael Rodel

Introduction

Equation 1:

Equation 2:

Assignment 1: Truth-table and circuits for sign activation

Report

Assignment 2: One-Time Truth-Table (OTTT), passive

An implementation of a secure two-party protocol for computing the function specified in Equation 1 using the passively secure One-Time Truth-Table (OTTT) protocol.

Report

Code

Assignment 3: BeDOZa protocol, passive

An implementation of the passively secure BeDOZa protocol for computing the function specified in Equation 2.

Report

Code

Assignment 4: BeDOZa protocol, active (malicious) adversary

An enhancement of our implementation of the BeDOZa protocol (assignments 3). It provides security against malicious adversaries (security with abort) by using MACs to authenticate secret shares.

Report

Code

Assignment 5: BeDOZa protocol with a general functionality (bonus)

An extension of our implementation of the BeDOZa protocol (assignments 3-4) to general functionality.

Code

Assignment 6: Oblivious Transfer to Replace Dealer

Elimination of the need for the dealer in BeDOZa protocol we implemented in assignment 4 using a 1-out-of-n OT protocol against active adversaries.

Report

Code

Assignment 7: Garbled Circuits

An implementation of Yao’s protocol for the Boolean circuit evaluating Equation 2.

Report

Code

Assignment 8: Homormorphic Encryption

Report

Final Project: "Don’t be Dense: Efficient Keyword PIR for Sparse Databases"

The paper: "Don’t be Dense: Efficient Keyword PIR for Sparse Databases"

Report

Slides