Ajith Suresh CrIS Lab, IISc * Indian Institute of Science (IISc), - - PowerPoint PPT Presentation

ajith suresh
SMART_READER_LITE
LIVE PREVIEW

Ajith Suresh CrIS Lab, IISc * Indian Institute of Science (IISc), - - PowerPoint PPT Presentation

Ajith Suresh CrIS Lab, IISc * Indian Institute of Science (IISc), Bangalore https://www.csa.iisc.ac.in/~cris ^ Aarhus University, Denmark Outline q Privacy Preserving Machine Learning (PPML) q Secure Multi-party Computation (MPC) q Overview of


slide-1
SLIDE 1

Ajith Suresh

CrIS Lab, IISc

https://www.csa.iisc.ac.in/~cris

* Indian Institute of Science (IISc), Bangalore

^ Aarhus University, Denmark

slide-2
SLIDE 2

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Outline

q Privacy Preserving Machine Learning (PPML) q Secure Multi-party Computation (MPC) q Overview of Trident Protocol q Benchmarking Results

slide-3
SLIDE 3

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Machine Learning (ML) Prediction – An Abstraction

Model Parameters Query Result

Privacy ??

Aladdin (Client) Jasmine (Model Owner) ML Algorithm

slide-4
SLIDE 4

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Model Parameters

Query

Result

Privacy ??

Aladdin (Client) Jasmine (Model Owner) ML Algorithm

Machine Learning (ML) Prediction – An Abstraction

slide-5
SLIDE 5

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Model Parameters Query Result

Privacy ??

Aladdin (Client) Jasmine (Model Owner) ML Algorithm

Machine Learning (ML) Prediction – An Abstraction

slide-6
SLIDE 6

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Model Parameters Query Result

MPC meets ML

Aladdin (Client) Jasmine (Model Owner)

PPML Algorithm

Privacy Preserving Machine Learning (PPML)

slide-7
SLIDE 7

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Secure Multi-party Computation (MPC) [Yao’82]

ü A set of parties with private inputs wish to

compute some joint function of their inputs.

ü Goals of MPC:

§

Correctness – Parties should correctly evaluate the function output.

§

Privacy – Nothing more than the function

  • utput should be revealed
slide-8
SLIDE 8

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Secure Multi-party Computation (MPC) [Yao’82] Trusted Third Party (TTP)

slide-9
SLIDE 9

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Trusted Third Party (TTP)

slide-10
SLIDE 10

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

MPC

MPC emulates TTP

slide-11
SLIDE 11

AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC 26-02-2020

slide-12
SLIDE 12

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Ø A new 4PC protocol over ring in the pre-processing model

Trident protocol

slide-13
SLIDE 13

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Ø A new 4PC protocol over ring in the pre-processing model v 4 parties v Honest majority v At most 1 corruption

Trident protocol

slide-14
SLIDE 14

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Ø A new 4PC protocol over ring in the pre-processing model v Data independent pre-processing v Fast online phase

Trident protocol

slide-15
SLIDE 15

Sharing Semantics

slide-16
SLIDE 16

Pre-processing

slide-17
SLIDE 17

Pre-processing

slide-18
SLIDE 18

Online

+ =

slide-19
SLIDE 19

Shares of

slide-20
SLIDE 20

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Ø A new 4PC protocol over ring in the pre-processing model Ø Malicious security with guarantee of fairness

Trident protocol

slide-21
SLIDE 21

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Ø A new 4PC protocol over ring in the pre-processing model Ø Malicious security with guarantee of fairness Corrupt parties arbitrarily deviate

Trident protocol

slide-22
SLIDE 22

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Ø A new 4PC protocol over ring in the pre-processing model Ø Malicious security with guarantee of fairness Honest parties get output whenever corrupt parties get output

Trident protocol

slide-23
SLIDE 23

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Multiplication (!. #)

Ref Pre-processing

(#elements)

Online

(#elements)

Security

Araki et al’17 (3PC) 12 9 Abort

slide-24
SLIDE 24

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Multiplication (!. #)

Ref Pre-processing

(#elements)

Online

(#elements)

Security

Araki et al’17 (3PC) ASTRA (3PC) 12 21 9 4 Abort Fair

slide-25
SLIDE 25

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Multiplication (!. #)

Ref Pre-processing

(#elements)

Online

(#elements)

Security

Araki et al’17 (3PC) ASTRA (3PC) Gordon et al.’18 (4PC) 12 21 2 9 4 4 Abort Fair Abort

slide-26
SLIDE 26

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Multiplication (!. #)

Ref Pre-processing

(#elements)

Online

(#elements)

Security

Araki et al’17 (3PC) ASTRA (3PC) Gordon et al.’18 (4PC)

Trident

12 21 2

3

9 4 4

3

Abort Fair Abort

Fair

slide-27
SLIDE 27

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Ø A new 4PC protocol over ring in the pre-processing model Ø Malicious security with guarantee of fairness Ø Efficient Mixed World Conversions

Trident protocol

slide-28
SLIDE 28

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Mixed World Conversions

Boolean Boolean World

  • Comparison, Bit Extraction …
slide-29
SLIDE 29

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Mixed World Conversions

Boolean Arithmetic Boolean World

  • Comparison, Bit Extraction …

Arithmetic World

  • Addition, Multiplication …
slide-30
SLIDE 30

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Mixed World Conversions

Boolean Arithmetic Garbled Boolean World

  • Comparison, Bit Extraction …

Arithmetic World

  • Addition, Multiplication …

Garbled World

  • Division over rings …
slide-31
SLIDE 31

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Mixed World Conversions

Boolean Arithmetic Garbled

B2A A2B G2B B2G A2G G2A

Online Rounds Online Communication Up to 7x

2x - 67x

Range of improvement over ABY3

slide-32
SLIDE 32

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Mixed World Conversions – An Example

min(%& + %(, %*) %,

slide-33
SLIDE 33

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Mixed World Conversions – An Example

!" + x%

slide-34
SLIDE 34

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Mixed World Conversions – An Example

!" + x%

Arithmetic

slide-35
SLIDE 35

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Mixed World Conversions – An Example

!" + x% min(!" + !%, !+)

Arithmetic

A2B

slide-36
SLIDE 36

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Mixed World Conversions – An Example

!" + x% min(!" + !%, !+)

Arithmetic Boolean

A2B

slide-37
SLIDE 37

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Mixed World Conversions – An Example

!" + x% min(!" + !%, !+)

Arithmetic Boolean

A2B B2G

slide-38
SLIDE 38

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Mixed World Conversions – An Example

!" + x% min(!" + !%, !+) !-

Arithmetic Boolean

A2B A2G B2G

slide-39
SLIDE 39

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Mixed World Conversions – An Example

!" + x% min(!" + !%, !+) min !" + !%, !+ ÷ !. !.

Arithmetic Boolean

A2B A2G B2G

slide-40
SLIDE 40

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Mixed World Conversions – An Example

!" + x% min(!" + !%, !+) min !" + !%, !+ ÷ !. !.

Arithmetic Boolean

A2B A2G B2G

Garbled

slide-41
SLIDE 41

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Mixed World Conversions – An Example

min(%& + %(, %*) %, %& + x( min(%& + %(, %*) min %& + %(, %* ÷ %, %,

Arithmetic Boolean Garbled

A2B G2A A2G B2G

slide-42
SLIDE 42

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Ø A new 4PC protocol over ring in the pre-processing model Ø Malicious security with guarantee of fairness Ø Efficient Mixed World Conversions Ø Special tools for PPML

Trident protocol

slide-43
SLIDE 43

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Dot Product

Ref Pre-processing

(#elements)

Online

(#elements)

Security

ABY3 (3PC) 12d 9d Abort

d – #elements in each vector

!∎# = %

&'( )

*+ . -+

slide-44
SLIDE 44

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Dot Product

Ref Pre-processing

(#elements)

Online

(#elements)

Security

ABY3 (3PC) ASTRA (3PC) 12d 21d 9d 2d+2 Abort Fair

d – #elements in each vector

!∎# = %

&'( )

*+ . -+

slide-45
SLIDE 45

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Dot Product

Ref Pre-processing

(#elements)

Online

(#elements)

Security

ABY3 (3PC) ASTRA (3PC)

Trident

12d 21d

3

9d 2d+2

3

Abort Fair

Fair

d – #elements in each vector

!∎# = %

&'( )

*+ . -+

slide-46
SLIDE 46

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Tools for PPML

Dot Product Truncation Fixed Point Arithmetic Comparison Bit to Arithmetic Bit Injection Non-linear Activation Functions

slide-47
SLIDE 47

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Trident protocol

Ø A new 4PC protocol over ring in the pre-processing model Ø Malicious security with guarantee of fairness Ø Efficient Mixed World Conversions Ø Special tools for PPML Ø Lower monetary cost in the outsourced setting

slide-48
SLIDE 48

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Trident protocol

Ø A new 4PC protocol over ring in the pre-processing model Ø Malicious security with guarantee of fairness Ø Efficient Mixed World Conversions Ø Special tools for PPML Ø Lower monetary cost in the outsourced setting Computation is

  • utsourced to a set of

hired servers

slide-49
SLIDE 49

Benchmarking

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

Ø Implemented both Trident and ABY3, using the ENCRYPTO library. Ø Benchmarked the protocols over LAN (40 Mbps) and WAN (1 Gbps) with the Google Cloud Platform. Ø Servers located in West Europe, East Australia, South Asia, and South East Asia. Ø For benchmarking, we used batch sizes up to 512 and feature sizes up to 1000.

slide-50
SLIDE 50

Summary of Our Benchmarking Results ML Algorithm

Improvement in terms of Online Throughput over ABY3 Training Prediction

Linear Regression 251.84x 145.81x Logistic Regression 34.58x 149.63x Neural Networks 63.71x 407.12x Convolutional Neural Networks 42.81x 741.56x

*Throughput for Training - #iterations processed by servers / minute *Throughput for Prediction - #queries processed by servers / minute

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

slide-51
SLIDE 51

AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC 26-02-2020

slide-52
SLIDE 52

26-02-2020 AJITH SURESH | CRYPTOGRAPHY AND INFORMATION SECURITY LAB ,CSA, IISC

References

1.

Andrew Chi-Chih Yao. Protocols for secure computations (extended abstract). In FOCS, pages 160-164, 1982.

2.

  • P. Mohassel, M. Rosulek, and Y. Zhang. Fast and Secure Three party Computation: Garbled Circuit Approach. In CCS, 2015.

3.

  • T. Araki, A. Barak, J. Furukawa, T. Lichter, Y. Lindell, A. Nof, K. Ohara, A. Watzman, and O. Weinstein. Optimized

Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second Barrier. In IEEE S&P, 2017.

4.

  • J. Furukawa, Y. Lindell, A. Nof, and O. Weinstein. High-Throughput Secure Three-Party Computation for Malicious Adversaries

and an Honest Majority. In EUROCRYPT, 2017.

5.

  • K. Chida, D. Genkin, K. Hamada, D. Ikarashi, R. Kikuchi, Y. Lindell, and A. Nof. Fast Large-Scale Honest-Majority MPC for

Malicious Adversaries. In CRYPTO, 2018.

6.

  • P. Mohassel and P. Rindal, ABY3: A Mixed Protocol Framework for Machine Learning. In ACM CCS, 2018.

7.

  • H. Chaudhari, A. Choudhury, A. Patra and A. Suresh. ASTRA: High-throughput 3PC over Rings with Application to

Secure Prediction, In ACM CCSW , 2019.

8.

  • S. D. Gordon and S. Ranellucci and X. Wang. Secure Computation with Low Communication from Cross-checking. In

ASIACRYPT, 2018.