mirror of
https://github.com/data61/MP-SPDZ.git
synced 2026-01-10 22:17:57 -05:00
124 lines
3.2 KiB
C++
124 lines
3.2 KiB
C++
/*
|
|
* paper-example.cpp
|
|
*
|
|
* Working example similar to Figure 2 in https://eprint.iacr.org/2020/521
|
|
*
|
|
*/
|
|
|
|
#include "Math/gfp.hpp"
|
|
#include "Machines/SPDZ.hpp"
|
|
#include "Protocols/CowGearShare.h"
|
|
#include "Protocols/CowGearPrep.hpp"
|
|
|
|
template<class T>
|
|
void run(char** argv, int prime_length);
|
|
|
|
int main(int argc, char** argv)
|
|
{
|
|
// bit length of prime
|
|
const int prime_length = 128;
|
|
|
|
// compute number of 64-bit words needed
|
|
const int n_limbs = (prime_length + 63) / 64;
|
|
|
|
// need player number and number of players
|
|
if (argc < 3)
|
|
{
|
|
cerr << "Usage: " << argv[0] << "<my number: 0/1/...> <total number of players> [protocol]" << endl;
|
|
exit(1);
|
|
}
|
|
|
|
string protocol = "MASCOT";
|
|
if (argc > 3)
|
|
protocol = argv[3];
|
|
|
|
if (protocol == "MASCOT")
|
|
run<Share<gfp_<0, n_limbs>>>(argv, prime_length);
|
|
else if (protocol == "CowGear")
|
|
run<CowGearShare<gfp_<0, n_limbs>>>(argv, prime_length);
|
|
else if (protocol == "SPDZ2k")
|
|
run<Spdz2kShare<64, 64>>(argv, 0);
|
|
else
|
|
{
|
|
cerr << "Unknown protocol: " << protocol << endl;
|
|
exit(1);
|
|
}
|
|
}
|
|
|
|
template<class T>
|
|
void run(char** argv, int prime_length)
|
|
{
|
|
// set up networking on localhost
|
|
Names N;
|
|
int my_number = atoi(argv[1]);
|
|
int n_parties = atoi(argv[2]);
|
|
int port_base = 9999;
|
|
Server::start_networking(N, my_number, n_parties, "localhost", port_base);
|
|
CryptoPlayer P(N);
|
|
|
|
// initialize fields
|
|
T::clear::init_default(prime_length);
|
|
T::clear::next::init_default(prime_length, false);
|
|
|
|
// must initialize MAC key for security of some protocols
|
|
typename T::mac_key_type mac_key;
|
|
T::read_or_generate_mac_key("", P, mac_key);
|
|
|
|
// global OT setup
|
|
BaseMachine machine;
|
|
machine.ot_setups.push_back({P});
|
|
|
|
// keeps tracks of preprocessing usage (triples etc)
|
|
DataPositions usage;
|
|
usage.set_num_players(P.num_players());
|
|
|
|
// initialize binary computation
|
|
T::bit_type::mac_key_type::init_field();
|
|
typename T::bit_type::mac_key_type binary_mac_key;
|
|
T::bit_type::part_type::read_or_generate_mac_key("", P, binary_mac_key);
|
|
GC::ShareThread<typename T::bit_type> thread(N,
|
|
OnlineOptions::singleton, P, binary_mac_key, usage);
|
|
|
|
// output protocol
|
|
typename T::MAC_Check output(mac_key);
|
|
|
|
// various preprocessing
|
|
typename T::LivePrep preprocessing(0, usage);
|
|
SubProcessor<T> processor(output, preprocessing, P);
|
|
|
|
// input protocol
|
|
typename T::Input input(processor, output);
|
|
|
|
// multiplication protocol
|
|
typename T::Protocol protocol(P);
|
|
|
|
int n = 1000;
|
|
vector<T> a(n), b(n);
|
|
T c;
|
|
typename T::clear result;
|
|
|
|
input.reset_all(P);
|
|
for (int i = 0; i < n; i++)
|
|
input.add_from_all(i);
|
|
input.exchange();
|
|
for (int i = 0; i < n; i++)
|
|
{
|
|
a[i] = input.finalize(0);
|
|
b[i] = input.finalize(1);
|
|
}
|
|
|
|
protocol.init_dotprod(&processor);
|
|
for (int i = 0; i < n; i++)
|
|
protocol.prepare_dotprod(a[i], b[i]);
|
|
protocol.next_dotprod();
|
|
protocol.exchange();
|
|
c = protocol.finalize_dotprod(n);
|
|
output.init_open(P);
|
|
output.prepare_open(c);
|
|
output.exchange(P);
|
|
result = output.finalize_open();
|
|
|
|
cout << "result: " << result << endl;
|
|
output.Check(P);
|
|
}
|