File size: 10,553 Bytes
27be9c5 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 | /*
Copyright (c) 2017, The University of Bristol, Senate House, Tyndall Avenue, Bristol, BS8 1TH, United Kingdom.
Copyright (c) 2021, COSIC-KU Leuven, Kasteelpark Arenberg 10, bus 2452, B-3001 Leuven-Heverlee, Belgium.
All rights reserved
*/
/* This file tests the advanced FHE functionalties like
* Distributed Decryption, ZKPoKs etc.
*
* As well as reading data from the files written to by
* the Setup.x program
*/
#include <fstream>
#include <iostream>
#include <string>
#include "FHE/FHE_Keys.h"
#include "FHE/FHE_Params.h"
#include "FHE/ZKPoK.h"
using namespace std;
void Gen_FHE_Data(int &n, Ring &Rg, FFT_Data &PTD, FHE_Params ¶ms,
FHE_PK *&pk, FHE_SK **&sk, FHE_SK *&Msk, PoKVersion version)
{
n= 2;
bigint p0, p1, pr= 0;
unsigned int hwt= 64, N;
Generate_Parameters(N, p0, p1, pr, 128, n, version, hwt);
Rg.initialize(2 * N);
gfp::init_field(pr);
PTD.init(Rg, gfp::get_ZpD());
params.set(Rg, p0, p1, hwt, n);
sk= new FHE_SK *[n];
pk= new FHE_PK(params, pr);
Msk= new FHE_SK(params, pr);
PRNG G;
G.ReSeed(0);
KeyGen(*pk, *Msk, G);
// Now create the distributed secret key
vector<Rq_Element> si(n, Rq_Element(params.FFTD(), evaluation, evaluation));
si[0]= (*Msk).s();
for (int i= 1; i < n; i++)
{
si[i].randomize(G, 0);
sub(si[0], si[0], si[i]);
sk[i]= new FHE_SK(params, pr);
(*sk[i]).assign(si[i]);
}
sk[0]= new FHE_SK(params, pr);
(*sk[0]).assign(si[0]);
}
void Read_FHE_Data(int &n, Ring &Rg, FFT_Data &PTD, FHE_Params ¶ms,
FHE_PK *&pk, FHE_SK **&sk, FHE_SK *&Msk)
{
ifstream input("Data/NetworkData.txt");
string str;
input >> str;
input >> n;
input.close();
unsigned int N, hwt;
bigint p0, p1, pr;
sk= new FHE_SK *[n];
for (int i= 0; i < n; i++)
{
stringstream ss;
ss << "Data/FHE-Key-" << i << ".key";
ifstream inp(ss.str().c_str());
inp >> N >> p0 >> p1 >> pr >> hwt;
char ch;
do
{
inp.get(ch);
}
while (ch != ':');
if (i == 0)
{
Rg.initialize(2 * N);
gfp::init_field(pr);
PTD.init(Rg, gfp::get_ZpD());
params.set(Rg, p0, p1, hwt, n);
pk= new FHE_PK(params, pr);
inp >> *pk;
}
else
{
if (Rg.phi_m() != N || gfp::pr() != pr || params.p0() != p0 ||
params.p1() != p1)
{
cout << "Something mismatched in files";
abort();
}
FHE_PK pkt(params, pr);
inp >> pkt;
if (pkt.a() != pk->a() || pkt.b() != pk->b() || pkt.as() != pk->as() ||
pkt.bs() != pk->bs())
{
cout << "Something mismatched in public keys";
abort();
}
}
sk[i]= new FHE_SK(params, pr);
inp >> *(sk[i]);
inp.close();
}
Msk= new FHE_SK(params, (*pk).p());
Rq_Element te((*pk).get_params().FFTD());
te.assign_zero();
te.lower_level();
for (int i= 0; i < n; i++)
{
add(te, te, sk[i]->s());
}
te.raise_level();
(*Msk).assign(te);
}
void Test_All(int n, const Ring &Rg, const FFT_Data &PTD,
const FHE_Params ¶ms, FHE_PK *pk, FHE_SK **sk, FHE_SK *Msk,
PoKVersion version)
{
// Make an identifiable plaintext
Plaintext mess(PTD);
PRNG G;
G.ReSeed(0);
mess.randomize(G);
Random_Coins rc(params);
rc.generate(G);
Ciphertext ctx(params);
pk->encrypt(ctx, mess, rc);
// Test distributed decryption
vector<vector<bigint>> vv(n);
for (int i= 0; i < n; i++)
{
sk[i]->dist_decrypt_1(vv[i], ctx, i);
}
vector<bigint> ans= vv[0];
for (int i= 1; i < n; i++)
{
sk[i]->dist_decrypt_2(ans, vv[i]);
}
Plaintext output(PTD);
output.set_poly_mod(ans, params.p0());
for (unsigned int i= 0; i < Rg.phi_m(); i++)
{
if (mess.element(i) != output.element(i))
{
cout << "Something wrong in position - 1" << i << endl;
abort();
}
}
Ciphertext ctx2= ctx;
ctx2.Scale((*pk).p());
(*Msk).decrypt(output, ctx2);
for (unsigned int i= 0; i < Rg.phi_m(); i++)
{
if (mess.element(i) != output.element(i))
{
cout << "Something wrong in position - 2 " << i << endl;
abort();
}
}
// Test squaring then distributed decryption
mul(ctx2, ctx, ctx, *pk);
for (int i= 0; i < n; i++)
{
sk[i]->dist_decrypt_1(vv[i], ctx2, i);
}
ans= vv[0];
for (int i= 1; i < n; i++)
{
sk[i]->dist_decrypt_2(ans, vv[i]);
}
Plaintext mess2(PTD);
mess2.set_poly_mod(ans, params.p0());
(*Msk).decrypt(output, ctx2);
for (unsigned int i= 0; i < Rg.phi_m(); i++)
{
gfp eq= mess.element(i);
eq= eq * eq - output.element(i);
if (!eq.is_zero())
{
cout << "Something wrong in position - 3 " << i << endl;
abort();
}
}
for (unsigned int i= 0; i < Rg.phi_m(); i++)
{
gfp eq= mess.element(i);
eq= eq * eq - mess2.element(i);
if (!eq.is_zero())
{
cout << "Something wrong in position - 4 " << i << endl;
abort();
}
}
cout << "\nTesting general ZKPoK routines" << endl;
unsigned int max= 0, total= 0;
// The ZKPoK stuff (first do non-Diagonal method)
cout << "Doing Step 0/1 of ZK PoK" << endl;
vector<ZKPoK> ZK(n);
for (int i= 0; i < n; i++)
{
ZK[i].Step0(General, version, *pk, PTD, G);
ZK[i].Step1(*pk, PTD, G);
}
// Emulate the transmission of data
unsigned int len;
cout << "Emulating transmission of data" << endl;
{
for (int i= 0; i < n; i++)
{
const uint8_t *buff= ZK[i].get_vE(len);
if (len > max)
{
max= len;
}
if (i == 0)
{
total+= len;
}
for (int j= 0; j < n; j++)
{
if (i != j)
{
ZK[i].Step0_Step(buff, *pk);
}
}
}
for (int i= 0; i < n; i++)
{
const uint8_t *buff= ZK[i].get_vA(len);
if (len > max)
{
max= len;
}
if (i == 0)
{
total+= len;
}
for (int j= 0; j < n; j++)
{
if (i != j)
{
ZK[i].Step1_Step(buff, *pk);
}
}
}
}
// Generate challenge
uint8_t seed[SEED_SIZE];
for (unsigned int i= 0; i < SEED_SIZE; i++)
{
seed[i]= (uint8_t)(rand());
}
vector<int> e;
cout << "Doing Step 2 of ZK PoK" << endl;
for (int i= 0; i < n; i++)
{
ZK[i].Generate_e(e, seed);
ZK[i].Step2(e, *pk);
}
// Emulate the transmission of data
cout << "Emulating transmission of data" << endl;
{
for (int i= 0; i < n; i++)
{
const uint8_t *buff= ZK[i].get_vT_vZ(len);
if (len > max)
{
max= len;
}
if (i == 0)
{
total+= len;
}
for (int j= 0; j < n; j++)
{
if (i != j)
{
ZK[i].Step2_Step(buff, *pk);
}
}
}
}
cout << "Doing Step 3 of ZK PoK" << endl;
for (int i= 0; i < n; i++)
{
if (!ZK[i].Step3(*pk, PTD, n))
{
cout << "Player " << i << " rejects the ZKPoK" << endl;
}
cout << "Soundness Parameter for Player " << i << " is " << ZK[i].get_sound_sec() << endl;
}
cout << "\nLargest message has size " << max << " bytes\n";
cout << "\nTotal message size sent per player " << total << " bytes\n\n";
cout << "\nTesting Diagonal ZKPoK routines" << endl;
// The ZKPoK stuff doing Diagonal method
cout << "Doing Step 1 of ZK PoK" << endl;
vector<gfp> alpha(1);
alpha[0].randomize(G);
for (int i= 0; i < n; i++)
{
ZK[i].Step0(Diagonal, version, *pk, PTD, G, alpha);
ZK[i].Step1(*pk, PTD, G);
}
// Emulate the transmission of data
cout << "Emulating transmission of data" << endl;
{
for (int i= 0; i < n; i++)
{
const uint8_t *buff= ZK[i].get_vE(len);
if (len > max)
{
max= len;
}
if (i == 0)
{
total+= len;
}
for (int j= 0; j < n; j++)
{
if (i != j)
{
ZK[i].Step0_Step(buff, *pk);
}
}
}
for (int i= 0; i < n; i++)
{
const uint8_t *buff= ZK[i].get_vA(len);
if (len > max)
{
max= len;
}
if (i == 0)
{
total+= len;
}
for (int j= 0; j < n; j++)
{
if (i != j)
{
ZK[i].Step1_Step(buff, *pk);
}
}
}
}
// Generate challenge
for (unsigned int i= 0; i < SEED_SIZE; i++)
{
seed[i]= (uint8_t)(rand());
}
cout << "Doing Step 2 of ZK PoK" << endl;
for (int i= 0; i < n; i++)
{
ZK[i].Generate_e(e, seed);
ZK[i].Step2(e, *pk);
}
// Emulate the transmission of data
{
cout << "Emulating transmission of data" << endl;
for (int i= 0; i < n; i++)
{
const uint8_t *buff= ZK[i].get_vT_vZ(len);
if (len > max)
{
max= len;
}
if (i == 0)
{
total+= len;
}
for (int j= 0; j < n; j++)
{
if (i != j)
{
ZK[i].Step2_Step(buff, *pk);
}
}
}
}
cout << "Doing Step 3 of ZK PoK" << endl;
for (int i= 0; i < n; i++)
{
if (!ZK[i].Step3(*pk, PTD, n))
{
cout << "Player " << i << " rejects the ZKPoK" << endl;
}
cout << "Soundness Parameter for Player " << i << " is " << ZK[i].get_sound_sec() << endl;
}
}
int main()
{
int n;
Ring Rg;
FFT_Data PTD;
FHE_Params params;
FHE_PK *pk;
FHE_SK **sk;
FHE_SK *Msk;
cout << "First testing TopGear" << endl;
Gen_FHE_Data(n, Rg, PTD, params, pk, sk, Msk, TopGear);
Test_All(n, Rg, PTD, params, pk, sk, Msk, TopGear);
cout << "\n\n\nThen testing HighGear" << endl;
Gen_FHE_Data(n, Rg, PTD, params, pk, sk, Msk, HighGear);
Test_All(n, Rg, PTD, params, pk, sk, Msk, HighGear);
delete pk;
for (int i= 0; i < n; i++)
{
delete sk[i];
}
delete[] sk;
return 0;
}
|