ANALYSIS OF TWO VERSATILE MPC FRAMEWORKS MP-SPDZ AND MPYC

Date

2023-12-07

Author

Aykurt, Fatih

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

337
views

187
downloads

Cite This

Using secure multi-party computing protocols (MPC), a group of participants who distrust one another can securely compute any function of their shared secret inputs. Participants exchange these inputs in a manner similar to secret sharing, where each participant owns a portion of the input but is unable to independently reconstruct the complete information without collaborating with the other participants. This kind of computation is quite powerful and has many uses where data privacy is quite criti- cal such as areas like government, business, and academia. MPC has grown from a subject of theoretical study to a technology being employed in industry, becom- ing effective enough to be deployed in practice with various algorithms implemented with MPC frameworks. In this study, two versatile MPC frameworks, MP-SPDZ and MPyC are analyzed. These frameworks’ performances are compared by using algo- rithms execution times from basic operations to more complex structures like shuffle sort algorithm. Profiling results are also analyzed to reveal the bottleneck points of the algorithms where the time consumption increases drastically. To detect the critical parts easier, profiling results are visualized as dot graphs. Besides all these, in the MPyC framework, Sattolo shuffle algorithm is implemented and compared with the current modern version of Fisher-Yates algorithm

Subject Keywords

MPC, Profiling, Bottleneck, Benchmark

URI

https://hdl.handle.net/11511/107749

Collections

Graduate School of Applied Mathematics, Thesis