Skip to main content

Table 1 Computational performance for different matrix sizes in terms of number of gates, OT and total time cost for matrix addition, matrix multiplication and matrix inversion in a 2-party setup

From: Secure Multi-pArty Computation Grid LOgistic REgression (SMAC-GLORE)

Matrix addition operation

Matrix size

# of AND gates

# of total gates

OT time (s)

Total time (s)

Party 1

Party 2

Party 1

Party 2

1 × 1

27

250

0.346

0.194

0.354

0.202

2 × 2

108

994

0.348

0.194

0.357

0.20

4 × 4

432

2,850

0.343

0.202

0.353

0.212

10 × 10

2,700

24,802

0.369

0.230

0.387

0.247

Matrix multiplication operation

Matrix size

# of AND gates

# of total gates

OT time (s)

Total time (s)

Party 1

Party 2

Party 1

Party 2

1 × 1

4,621

21,594

0.367

0.245

0.384

0.262

2 × 2

37,076

273,034

0.518

0.609

0.577

0.660

4 × 4

580,325

2,707,002

2.135

3.636

2.603

4.060

10 × 10

4,645,300

21,664,002

21.174

50.413

29.646

58.769

Matrix inversion operation (15 iterations)

Matrix size

# of AND gates

# of total gates

OT time (s)

Total time (s)

Party 1

Party 2

Party 1

Party 2

2 × 2

1,030,869

4,872,479

4.864

10.908

6.519

12.472

4 × 4

8,027,793

37,694,207

36.503

85.848

49.619

98.314

6 × 6

26,847,253

125,771,967

121.266

296.780

170.634

349.398

8 × 8

63,345,729

296,412,479

281.653

676.747

405.865

810.214

10 × 10

123,379,701

576,922,463

528.062

1286.500

751.421

1519.897