Practical evaluation of chain-like MPC protocols
(2023) EITM01 20222Department of Electrical and Information Technology
- Abstract (Swedish)
- Bottleneck Complexity (BNC) is a fairly new metric for Secure Multi Party Computation (SMPC) protocols. Two protocols with the BNC in mind are examined in
this thesis. One protocol is successfully implemented in the Python programming
language, and the BNC, latency and computational complexity of the protocol
is examined with positive results. The BNC is independent on the number of
parties in the protocol. The latency is linearly increasing with each new party
added, and the computational complexity is linerarly dependent on the bitlength
of the numbers computed on. The second protocol was not implemented because
of the complexity of the Garbled Circuits that would have had to been created
in order to perform encryption and... (More) - Bottleneck Complexity (BNC) is a fairly new metric for Secure Multi Party Computation (SMPC) protocols. Two protocols with the BNC in mind are examined in
this thesis. One protocol is successfully implemented in the Python programming
language, and the BNC, latency and computational complexity of the protocol
is examined with positive results. The BNC is independent on the number of
parties in the protocol. The latency is linearly increasing with each new party
added, and the computational complexity is linerarly dependent on the bitlength
of the numbers computed on. The second protocol was not implemented because
of the complexity of the Garbled Circuits that would have had to been created
in order to perform encryption and decryption of an Additively Homomorphic
Encryption (AHE) scheme. Instead, a conclusion is drawn that while garbled
circuits serves a good purpose for secure computation in simple settings, computations that require complicated operations scale up very quickly in the number of gates needed. A github repository with the code for the first protocol is found
at https://github.com/ha7008/ChainMPC. (Less)
Please use this url to cite or link to this publication:
http://lup.lub.lu.se/student-papers/record/9112490
- author
- Jonson, Hanna LU
- supervisor
-
- Paul Stankovski LU
- Elena Pagnin LU
- organization
- course
- EITM01 20222
- year
- 2023
- type
- H2 - Master's Degree (Two Years)
- subject
- keywords
- Cryptography
- report number
- LU/LTH-EIT 2024-987
- language
- English
- id
- 9112490
- date added to LUP
- 2024-06-17 15:19:28
- date last changed
- 2024-06-17 15:19:28
@misc{9112490, abstract = {{Bottleneck Complexity (BNC) is a fairly new metric for Secure Multi Party Computation (SMPC) protocols. Two protocols with the BNC in mind are examined in this thesis. One protocol is successfully implemented in the Python programming language, and the BNC, latency and computational complexity of the protocol is examined with positive results. The BNC is independent on the number of parties in the protocol. The latency is linearly increasing with each new party added, and the computational complexity is linerarly dependent on the bitlength of the numbers computed on. The second protocol was not implemented because of the complexity of the Garbled Circuits that would have had to been created in order to perform encryption and decryption of an Additively Homomorphic Encryption (AHE) scheme. Instead, a conclusion is drawn that while garbled circuits serves a good purpose for secure computation in simple settings, computations that require complicated operations scale up very quickly in the number of gates needed. A github repository with the code for the first protocol is found at https://github.com/ha7008/ChainMPC.}}, author = {{Jonson, Hanna}}, language = {{eng}}, note = {{Student Paper}}, title = {{Practical evaluation of chain-like MPC protocols}}, year = {{2023}}, }