SecurePL: a compiler and toolbox for practical and easy secure multiparty computation
İsmail Fatih Yıldırım
Abstract
Open-access reader
İsmail Fatih Yıldırım
Abstract
Open-access reader
Secure multiparty computation is basically about techniques that allow multiple parties to jointly carry out computations that are based on data from each of the players while the data held by each player remains private to that player. Since the beginning of the notion of secure multiparty computation, many algorithms and methods were introduced on how to achieve this goal. This thesis first introduces different methods to do secure multiparty computation and later focusing on Secret sharing based multiparty computation it explains how efficient and secure multiparty operations can be done. Also while introducing secret sharing based secure multiparty computation we introduce a novel technique which allows to do secure multiparty computation using the Asmuth Bloom secret sharing scheme, which is not possible in the original scheme. The aim of this thesis is the design and implementation of a programming language and libraries for secure multiparty computation, SecurePL. We show that our tool’s ease of use and security allows even a person who has absolutely no knowledge about security or cryptography to write applications that can do secure multiparty computation.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Secure multiparty computation is basically about techniques that allow multiple parties to jointly carry out computations that are based on data from each of the players while the data held by each player remains private to that player. Since the beginning of the notion of secure multiparty computation, many algorithms and methods were introduced on how to achieve this goal. This thesis first introduces different methods to do secure multiparty computation and later focusing on Secret sharing based multiparty computation it explains how efficient and secure multiparty operations can be done. Also while introducing secret sharing based secure multiparty computation we introduce a novel technique which allows to do secure multiparty computation using the Asmuth Bloom secret sharing scheme, which is not possible in the original scheme. The aim of this thesis is the design and implementation of a programming language and libraries for secure multiparty computation, SecurePL. We show that our tool’s ease of use and security allows even a person who has absolutely no knowledge about security or cryptography to write applications that can do secure multiparty computation.
Key concepts: Secure multi-party computation, Computer science, Secure two-party computation, Compiler, Computation, Secret sharing, Cryptography, Theoretical computer science