iframe-proxy | Sunbelt Computer Software

76 lines (67 loc) · 3.25 KB

#include <stdlib.h>
#include "ProtocolParty.h"
#include "GF2_8LookupTable.h"
#include <emscripten.h>
void finish(int result) {
	emscripten_force_exit(result);
void main_loop(void *protocol_arg) {
	ProtocolParty<GF2_8LookupTable> *protocol = (ProtocolParty<GF2_8LookupTable> *)protocol_arg;
	if (!protocol->run()) {
		finish(EXIT_FAILURE);
 * The main structure of our protocol is as follows:
 * 1. Initialization Phase: Initialize some global variables (parties, field, circuit, etc).
 * 2. Preparation Phase: Prepare enough random double-sharings: a random double-sharing is a pair of
 *  two sharings of the same random value, one with degree t, and one with degree 2t. One such double-
 *  sharing is consumed for multiplying two values. We also consume double-sharings for input gates
 *  and for random gates (this is slightly wasteful, but we assume that the number of multiplication
 *  gates is dominating the number of input and random gates).
 * 3. Input Phase: For each input gate, reconstruct one of the random sharings towards the input party.
 *  Then, all input parties broadcast a vector of correction values, namely the differences of the inputs
 *  they actually choose and the random values they got. These correction values are then added on
 *  the random sharings.
 * 4. Computation Phase: Walk through the circuit, and evaluate as many gates as possible in parallel.
 *  Addition gates and random gates can be evaluated locally (random gates consume a random double-
 *  sharing). Multiplication gates are more involved: First, every party computes local product of the
 *  respective shares; these shares form de facto a 2t-sharing of the product. Then, from this sharing,
 *  a degree-2t sharing of a random value is subtracted, the difference is reconstructed and added on
 *  the degree-t sharing of the same random value.
 * 5. Output Phase: The value of each output gate is reconstructed towards the corresponding party.
 * @param argc
 * @param argv[1] = id of parties (1,...,N)
 * @param argv[2] = N: number of parties
 * @param argv[3] = path of inputs file
 * @param argv[4] = path of output file
 * @param argv[5] = path of circuit file
 * @param argv[6] = path of parties file
 * @param argv[7] = fieldType
 * @param argv[8] = number of times to run the protocol
int main(int argc, char* argv[])
//    CmdParser parser;
//    auto parameters = parser.parseArguments("", argc, argv);;
    string fieldType = argv[7];//parser.getValueByKey(parameters, "fieldType");
	/*if(fieldType.compare("ZpMersenne") == 0) {
        ProtocolParty<ZpMersenneIntElement> *protocol = new ProtocolParty<ZpMersenneIntElement>(argc, argv);
        emscripten_set_main_loop_arg(main_loop, protocol, 60, 0);
        cout << "end main" << '\n';
    } else */if(fieldType.compare("GF2_8LookupTable") == 0) {
        ProtocolParty<GF2_8LookupTable> *protocol = new ProtocolParty<GF2_8LookupTable>(argc, argv);
        emscripten_set_main_loop_arg(main_loop, protocol, 60, 0);
        cout << "end main" << '\n';
    } else {
        cout << "Wrong field type. The options are:\n"
                "1. ZpMersenne\n"
                "2. ZpMersenne61\n"
                "3. GF2_8LookupTable\n"
                "4. GF2E\n"
                "5. Zp\n";
        exit(-1);
    return 0;

Sunbelt Computer Software

PL/B Language Development and Support

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Sunbelt Computer Software

PL/B Language Development and Support

Uh oh!

FilesExpand file tree

main.cpp

Latest commit

History

main.cpp

File metadata and controls