Package: addy-mpc
Multi-Party Computation Cryptography - Final Projectfinish writing the development process api and demo and screenshots adding testsfix the SSD documenthttps://docs.google.com/document/d/1oWhDiyfaaCHef23QWVzcB4Yah-8EvjGF3wODgSoSex4/edit#Multi-Party Computation Cryptography - Final ProjectAboutWhat is Multi-Party Computation (MPC)?AuthorsProject OverviewProject GoalIntroductionMethods & AlgorithmsDesign ConsiderationsSelected approachPseudo Code Bit ORProcedure PrivacyPreservingBitOr:InfrastractureUser InterfaceDevelopment proccessAPI ReferenceGet itemadd(num1, num2)AppendixLicenseTech StackUsage/ExamplesDemoEnvironment VariablesRun LocallyFiles & Project structureTable of contents generated with markdown-tocAboutThis project is an implementation of a secure multi-party protocol for the secure set-union problem and the secure all-pairs shortest path problem. The protocol is devised from existing literature and is tailored for enhanced efficiency in a semi-honest setting with a dishonest majority.What is Multi-Party Computation (MPC)?Multi-Party Computation (MPC)is a subfield of cryptography that enables multiple entities to jointly compute a function over their inputs while keeping those inputs private. In the context of this project, we focus on a 2-party computation, where both entities share inputs and follow the MPC protocol, ensuring the privacy of their inputs.Without the intervention of a server (Third party) in the proccess.Authors@Dolev Dublon@Yakov Khodorkovski@Daniel Zaken@Aviad GilboaProject OverviewProject GoalThe primary objective of this project is to implement a secure multi-party protocol that is specifically designed for the secure set-union problem and the secure all-pairs shortest path problem. Our protocol aims to achieve greater efficiency than generic MPC protocols, especially in semi-honest settings with a dishonest majority. We base our approach on existing research by Justin Brickell and Vitaly Shmatikov, which you can accesshere.IntroductionOur protocol deals with two semi-honest groups. Since the late 1980s, general protocols have theoretically allowed secure computation in polynomial time and with a security parameter, enabling both players to compute safely under computational complexity assumptions. While these general protocols are theoretically efficient, they are not always practically efficient. Therefore, people have been trying to create specific security protocols for specific functions that are more efficient than the general protocols.The use of various generic libraries, such as YAO, and GMW, has proven to be less efficient, prompting efforts to develop more efficient approaches. We will implement the All-Pairs Shortest Path functionality to contribute to the ecosystem of implementations, aiming to create more efficient implementations in this domain.Methods & AlgorithmsDesign ConsiderationsThere were two algorithms for the set union to implement in our protocol:A provided pseudocode that utilized YAO and GMW for the calculation of the minimum using a generic library. However, this did not fit with our chosen programming language.A tree pruning method that utilized ElGamal and BitOr to reveal information securely.Selected approachWe have decided to implement the BitOr operation to achieve a union without relying on a generic library.ImageCryptographerLinkElgamalWikipediaYaoWikipediabecause the iterative method required using a generic library to calculate the minimum in a secure way.Pseudo Code Bit ORProcedure PrivacyPreservingBitOr:Alice initializes:Selects cyclic group $G$ of prime order $q$Chooses $g$ (quadratic residue) and large prime p $(p=2q+1)$Chooses private key $k ∈ {0, ..., q-1}$Picks random $r ∈ {2, ..., q-1}$If Alice's bit is $0$, calculates $C_a = (g^r, g^{(kr)})$If Alice's bit is $1$, calculates $C_a = (g^r, g\cdot g^{(kr)})$Alice sends $(C_a, q, g, g^k)$ to Bob, keeping k privateBob receives $(C_a, q, g, g^k)$ and unpacks $C_a$ into $(α, β)$Picks random $r' ∈ {2, ..., q-1}$If Bob's bit is $0$, calculate C_b = (α^r', β^r')If Bob's bit is $1$, calculate C_b = (α^r', g^r'*β^r')Bob sends $C_b$ back to AliceAlice receives $C_b$, unpacks it into $(γ, δ)$Calculates $b = \frac{δ}{γ^k}$If $b = 1$, returns $0$If $b ≠ 1$, returns $1$
insert diagram hereInfrastractureUsing Flask and Gunicorn servers on cloud platforms of Microsoft Azure. we represent parties involved in the secure computation.User InterfaceWe built a library mainly for software developers, but included visual aids and infrastructure for easier understanding. It's designed to show anyone how our system works, especially in Multi-party computation. Our simple interface gives a clear view of the protocol's progress and even includes a log output to follow the entire process.Insert screens here[ QR code for GitHub repo on bottom-right ]Development proccessAt first the Development process was to read a lot and get deep into the article of Justin Brickell and Vitaly Shmatikov, which you can accesshere.
and we met every week from the begining reading it, and also reading the articleA Proof of Security of Yao’s Protocol for Two-Party Computationby Yehuda Lindell Benny Pinkas and we had to learn a lot about the secure computation proofs and theorySemi-Honest Adversariesand this lecture as well.
This is the first step is to get into the field so we can understand the problem more deeply.
then we wrote theSynchronization was one of our biggest obstacle for us as a team and for the threads in the program between the clientsAPI ReferenceGET /api/datapoint| Parameter | Type | Description || :-------- | :------- | :------------------------- ||api_key|string|Required. Your API key |Get itemGET /api/items/${id}| Parameter | Type | Description || :-------- | :------- | :-------------------------------- ||id|string|Required. Id of item to fetch |add(num1, num2)Takes two numbers and returns the sum.AppendixAny additional information goes hereLicenseMITTech StackClient:HTML CSS JAVASCRIPT, Jinja engine for flaskServer:PYTHON FLASKUsage/ExamplesimportComponentfrom'my-project'functionApp(){return<Component/>}DemoInsert gifandimage for the video demo on youtubeDeploymentget a user on Microsoft AzureTo deploy this project rungunicornEnvironment VariablesTo run this project, you will need to add the following environment variables to your .env fileAPI_KEYANOTHER_API_KEYRun LocallyClone the projectgitclonehttps://link-to-projectGo to the project directorycdmy-projectInstall dependenciespipinstallflask.....Start the servernpmrunstartFiles & Project structureDocumentsVision Statement - MPC protocol implementationVision StatementSRD DocumentPrivacy-Preserving Graph Algorithms in the Semi-honest Modelby Justin Brickell and Bitaly Shmatikov
The University of Texas at Austin, Austin TX 78712, USAA Proof of Security of Yao’s Protocol for Two-Party Computationby Yehuda Lindell∗ Benny Pinkas June 26, 2006for original code go herehttps://github.com/Dolev-Dublon/Final-Project-Multiple-Party-Computation-Cryptograpynotesnotes for final projecthttps://docs.google.com/document/d/1d35ExjbP7p1KzuKcKIswkkOI2wedrJmxIr1OTyWHQyg/edit#vistion statements noteshttps://docs.google.com/document/d/1xL3wtaWKGzi0FGTweE9COot-9TdP_mHv4BdzA2mkEAg/edit?usp=sharingSSDhttps://docs.google.com/document/d/1oWhDiyfaaCHef23QWVzcB4Yah-8EvjGF3wODgSoSex4/edit?usp=sharingSRDhttps://docs.google.com/document/d/1w5ZWddqB6iOTN4Ku2wOdZLmmxYpQKhgURkkDfFiViZY/edit?usp=sharing