Skip to content
This repository has been archived by the owner on May 6, 2024. It is now read-only.

n132/SMC

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

MPC/SMC

Module Intro

This repo contains our implemenation of two protocols in SMC/MPC(Secure Multi-Party Communication).

  1. Yao's Garbled Circuit
  • Garbled Circuit
    • iLabel: Lable input wires
    • cGarble: Generate garbled circuits
    • gcEval: Evaluate the garbled circuits
  • Oblivious Transfer
    • Cyclic Group
    • 1 in 2 OT based on Bellare-Micali protocol
  1. GMW
  • Secret Sharing
    • n-1 random bits
    • XOR the secret and random bits to get the last bit
  • Oblivious Transfer
    • Expand 1 in 2 OT to 1 in 4 OT

Usage

Make sure gmpy2 is installed from https://pypi.org/project/gmpy2/

Make sure the module "pycryptodome" is installed.

Yao's Protocol

Python Usage:

run Alice.py first, then Bob.py separately. A will garble circuits for B to compute.

python3 Alice.py
python3 Bob.py

GMW Protocol

Usage: python3 Alice.py [inputs]

python3 Bob.py [inputs]

python3 David.py

Example:

# Terminal 1
python .\Alice.py [0,1,1,0,1,1,1,0]
# Terminal 2
python .\David.py
# Terminal 3
python Bob.py [0,1,1,0,1,1,1,0]

Communication Procedure Intro

  1. Yao's Garbled Circuit
  • Alice sends Bob the circuit, garbled table, and Alice's inputs
  • Bob gets his own inputs through OT
  • Bob evaluates the circuit and sends back the result
  1. GMW
  • Initialization
    • Alice, Bob and Dealer build socket connect with each other
    • Alice and Bob perform Secret Sharing to share their inputs with each other
  • Evaluation
    • Dealer evaluates the circuits
    • Dealer sends requests to Alice and Bob to get necessary data
      • If the gate is NOT
        • If dealer has the data, just do it locally
        • If not, broadcase a requestion about the gate
          • after get the broadcast, Alice and Bob perform caculation locally and store the data lcoally.
      • If the gate is XOR
        • If Dealer has the all the inputs locally, just do it locally.
        • If not, broadcase a requestion about the gate
          • Alice could find both shares of the input wires locally, send the share1 xor share2 to dealer(so dealer can't know the input)
          • Bob does the same thing
          • Dealer could use the data got from previous 2 steps to perform computation
      • If the gate is AND
        • If Dealer has the all the inputs locally, just do it locally.
        • If not, broadcase a requestion about the gate
          • Alice and Bob would check the local inputs, and perform 1 in 4 OT
            • Alice plays the sender
            • Bob plays the sender
          • Alice send mask to the Dealer, Bob send the data he got to the dealer (AKA message xor mask)
          • Dealer got the result and store it locally
      • One thing I did not do / to do
        • If one input is from Alice and the other is stored in dealer, such as the figure in Presentation Page 10
          • Because Alice doesn't want to leak her inputs, this situation is tricky
          • My solution is transfer the model 1 to model 2, they are equal!
          • That's solution needs I write a circuit compiler, due to the limit time, I just assume all the people who provide the circuit is samrt enough and tansfered Model 1 to Model 2
      • So far, dealer could process all the situations!
    • Alice and Bob get the final result from Dealer

Details

Function used to test the protocols: Equality function

Encryption library: Fernet from Python Cryptography

OT2: Bellare-Micali protocol & Implementation

OT4: Combine 3 OT2 & Implementation

Cyclic Group: CyclicGroup

Reference

About

Secure Multi-Party Communication Implementation: Yao & GMW

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages