duoram-utils.h 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597
  1. enum step
  2. {
  3. write_out = 0,
  4. num_steps
  5. };
  6. size_t duoram_progress[step::num_steps] = { 0 };
  7. // const size_t expo = 5;
  8. // const size_t db_nitems = 1ULL << expo;
  9. const size_t number_of_writes = 2;
  10. // const size_t number_of_ind_reads = 5;
  11. typedef int64_t DB_t;
  12. struct DuORAM_Write
  13. {
  14. size_t shift;
  15. DB_t CW;
  16. };
  17. size_t target_index = 2;
  18. size_t bytes_written2 =0;
  19. DB_t final_cw;
  20. DB_t * DB;
  21. DB_t * updated_DB;
  22. DB_t * blinds;
  23. DB_t * updated_blinds;
  24. DB_t * blinded_DB;
  25. DB_t * blinded_DB_recv;
  26. DB_t * updated_blinded_DB_recv;
  27. DB_t M;
  28. DB_t * reading_temp;
  29. DB_t distinguised_value[number_of_writes];
  30. DB_t * b;
  31. DB_t * c;
  32. DB_t * d;
  33. DB_t one_shareA, one_shareB, one_shareC;
  34. int8_t * reading_b;
  35. int8_t * reading_c;
  36. int8_t * reading_d;
  37. int8_t * writing_b;
  38. int8_t * writing_c;
  39. int8_t * writing_d;
  40. void generate_flags_and_standard_basis_vectors2(bool party, size_t db_nitems)
  41. {
  42. for(size_t j = 0; j < db_nitems; ++j)
  43. {
  44. reading_b[j] = 0;
  45. reading_c[j] = 0;
  46. reading_d[j] = 0;
  47. if(j > 5 && j < 42)
  48. {
  49. reading_b[j] = 1;
  50. reading_c[j] = 1;
  51. reading_d[j] = 1;
  52. }
  53. if(j > 75 && (j % 3) == 0)
  54. {
  55. reading_b[j] = 1;
  56. reading_c[j] = 1;
  57. reading_d[j] = 1;
  58. }
  59. }
  60. if(party)
  61. {
  62. reading_b[target_index] = 1;
  63. reading_c[target_index] = 1;
  64. reading_d[target_index] = 1;
  65. }
  66. if(!party)
  67. {
  68. for(size_t j = 0; j < db_nitems; ++j)
  69. {
  70. reading_b[j] = -reading_b[j];
  71. reading_c[j] = -reading_c[j];
  72. reading_d[j] = -reading_d[j];
  73. }
  74. }
  75. for(size_t j = 0; j < db_nitems; ++j)
  76. {
  77. b[j] = j;
  78. c[j] = j;
  79. d[j] = j;
  80. writing_b[j] = 0;
  81. writing_c[j] = 0;
  82. writing_d[j] = 0;
  83. if(j > 5 && j < 42)
  84. {
  85. writing_b[j] = 1;
  86. writing_c[j] = 1;
  87. writing_d[j] = 1;
  88. }
  89. if(j > 75 && (j % 3) == 0)
  90. {
  91. writing_b[j] = 1;
  92. writing_c[j] = 1;
  93. writing_d[j] = 1;
  94. }
  95. }
  96. if(party)
  97. {
  98. writing_b[target_index] = 1;
  99. writing_c[target_index] = 1;
  100. writing_d[target_index] = 1;
  101. }
  102. if(party)
  103. {
  104. // printf("PARTY 1\n");
  105. // for(size_t j = 0; j < db_nitems; ++j)
  106. // {
  107. // if(writing_b[j]) pm0 += 1;
  108. // if(writing_c[j]) pm1 += 1;
  109. // if(writing_d[j]) pm2 += 1;
  110. // }
  111. }
  112. else
  113. {
  114. // printf("PARTY 0\n");
  115. // for(size_t j = 0; j < db_nitems; ++j)
  116. // {
  117. // if(writing_b[j]) pm0 -= 1;
  118. // if(writing_c[j]) pm1 -= 1;
  119. // if(writing_d[j]) pm2 -= 1;
  120. // }
  121. for(size_t j = 0; j < db_nitems; ++j)
  122. {
  123. writing_b[j] = -writing_b[j];
  124. writing_c[j] = -writing_c[j];
  125. writing_d[j] = -writing_d[j];
  126. b[j] = -b[j];
  127. c[j] = -c[j];
  128. d[j] = -d[j];
  129. }
  130. }
  131. if(party)
  132. {
  133. b[target_index] = -47920;
  134. c[target_index] = -47920;
  135. d[target_index] = -47920;
  136. }
  137. else
  138. {
  139. b[target_index] = 0;
  140. c[target_index] = 0;
  141. d[target_index] = 0;
  142. }
  143. }
  144. void setup(DB_t * DB, DB_t * updated_DB, DB_t * blinded_DB_recv, DB_t * blinds, DB_t * updated_blinds, DB_t * updated_blinded_DB_recv, size_t db_nitems, bool party)
  145. {
  146. for(size_t j = 0; j < db_nitems; ++j)
  147. {
  148. if(party)
  149. {
  150. DB[j] = 0;
  151. updated_DB[j] = 0;
  152. blinded_DB_recv[j] = 0;
  153. }
  154. else
  155. {
  156. DB[j] = 0;
  157. updated_DB[j] = 0;
  158. blinded_DB_recv[j] = 0;
  159. }
  160. }
  161. for(size_t j = 0; j < db_nitems; ++j)
  162. {
  163. blinds[j] = 0;
  164. updated_blinds[j] = blinds[j];
  165. updated_blinded_DB_recv[j] = blinded_DB_recv[j];
  166. }
  167. }
  168. void debug_(tcp::socket& in2, tcp::socket& sb, size_t db_nitems)
  169. {
  170. for(size_t j = 0; j < db_nitems; ++j)
  171. {
  172. DB_t debug_blinds2;
  173. boost::asio::read(in2, boost::asio::buffer(&debug_blinds2, sizeof(debug_blinds2)));
  174. assert(blinds[j] == debug_blinds2);
  175. }
  176. for(size_t jj = 0; jj < db_nitems; ++jj)
  177. {
  178. DB_t debug_refresh;
  179. boost::asio::write(sb, boost::asio::buffer(&updated_blinded_DB_recv[jj], sizeof(updated_blinded_DB_recv[jj])));
  180. boost::asio::read(sb, boost::asio::buffer(&debug_refresh, sizeof(debug_refresh)));
  181. assert(debug_refresh == DB[jj] + blinds[jj]);
  182. }
  183. DB_t DB_out;
  184. boost::asio::write(sb, boost::asio::buffer(&DB[target_index], sizeof(DB[target_index])));
  185. boost::asio::read(sb, boost::asio::buffer(&DB_out, sizeof(DB_out)));
  186. DB_out = DB_out + DB[target_index];
  187. std::cout << "DB_out = " << DB_out << std::endl;
  188. }
  189. DB_t print_reconstruction(tcp::socket& sb, DB_t output)
  190. {
  191. DB_t out_reconstruction;
  192. boost::asio::write(sb, boost::asio::buffer(&output, sizeof(output)));
  193. boost::asio::read(sb, boost::asio::buffer(&out_reconstruction, sizeof(out_reconstruction)));
  194. out_reconstruction = out_reconstruction + output;
  195. return out_reconstruction;
  196. }
  197. template<typename T>
  198. void rotate_by(T * orginal_vector, T * rotated_vector, size_t rotate_by, size_t db_nitems)
  199. {
  200. for(size_t j = 0; j < db_nitems; ++j)
  201. {
  202. rotated_vector[(j + rotate_by) % db_nitems] = orginal_vector[j];
  203. }
  204. }
  205. template<typename T1, typename T2>
  206. void rotate_all( T1 * orginal_vector1, T1 * rotated_vector1,
  207. T2 * orginal_vector2, T2 * rotated_vector2,
  208. T1 * orginal_vector3, T1 * rotated_vector3,
  209. T2 * orginal_vector4, T2 * rotated_vector4,
  210. T1 * orginal_vector5, T1 * rotated_vector5,
  211. T2 * orginal_vector6, T2 * rotated_vector6,
  212. size_t rotate_by, size_t db_nitems)
  213. {
  214. for(size_t j = 0; j < db_nitems; ++j)
  215. {
  216. rotated_vector1[(j + rotate_by) % db_nitems] = orginal_vector1[j];
  217. rotated_vector2[(j + rotate_by) % db_nitems] = orginal_vector2[j];
  218. rotated_vector3[(j + rotate_by) % db_nitems] = orginal_vector3[j];
  219. rotated_vector4[(j + rotate_by) % db_nitems] = orginal_vector4[j];
  220. rotated_vector5[(j + rotate_by) % db_nitems] = orginal_vector5[j];
  221. rotated_vector6[(j + rotate_by) % db_nitems] = orginal_vector6[j];
  222. }
  223. }
  224. template<typename T1>
  225. void rotate_all( T1 * orginal_vector1, T1 * rotated_vector1,
  226. T1 * orginal_vector3, T1 * rotated_vector3,
  227. T1 * orginal_vector5, T1 * rotated_vector5,
  228. size_t rotate_by, size_t db_nitems)
  229. {
  230. for(size_t j = 0; j < db_nitems; ++j)
  231. {
  232. rotated_vector1[(j + rotate_by) % db_nitems] = orginal_vector1[j];
  233. rotated_vector3[(j + rotate_by) % db_nitems] = orginal_vector3[j];
  234. rotated_vector5[(j + rotate_by) % db_nitems] = orginal_vector5[j];
  235. }
  236. }
  237. void read_final_cws(tcp::socket& in2)
  238. {
  239. read(in2, boost::asio::buffer(&one_shareA, sizeof(one_shareA)));
  240. read(in2, boost::asio::buffer(&one_shareB, sizeof(one_shareB)));
  241. read(in2, boost::asio::buffer(&one_shareC, sizeof(one_shareC)));
  242. // in2 >> one_shareA;
  243. // in2 >> one_shareB;
  244. // in2 >> one_shareC;
  245. }
  246. int read_database_shares(bool party, size_t db_nitems)
  247. {
  248. if(party)
  249. {
  250. int const in { open( "DB1", O_RDONLY ) };
  251. size_t r = read(in, DB, db_nitems * sizeof(DB_t));
  252. if(r < 0) {
  253. perror("Read error");
  254. close(in);
  255. return 1;
  256. }
  257. }
  258. if(!party)
  259. {
  260. int const in { open( "DB0", O_RDONLY ) };
  261. size_t r = read(in, DB, db_nitems * sizeof(DB_t));
  262. if(r < 0) {
  263. perror("Read error");
  264. close(in);
  265. return 1;
  266. }
  267. }
  268. return 0;
  269. }
  270. int read_flags(bool party, size_t db_nitems)
  271. {
  272. if(!party)
  273. {
  274. int const in0 { open( "party0_read_flags_b", O_RDONLY ) };
  275. size_t r = read(in0, reading_b, db_nitems * sizeof(reading_b[0]));
  276. if(r < 0) {
  277. perror("Read error");
  278. close(in0);
  279. return 1;
  280. }
  281. int const in1 { open( "party0_read_flags_c", O_RDONLY ) };
  282. r = read(in1, reading_c, db_nitems * sizeof(reading_c[0]));
  283. if(r < 0) {
  284. perror("Read error");
  285. close(in1);
  286. return 1;
  287. }
  288. int const in2 { open( "party0_read_flags_d", O_RDONLY ) };
  289. r = read(in2, reading_d, db_nitems * sizeof(reading_d[0]));
  290. if(r < 0) {
  291. perror("Read error");
  292. close(in2);
  293. return 1;
  294. }
  295. int const in0_w { open( "party0_write_flags_b", O_RDONLY ) };
  296. r = read(in0_w, writing_b, db_nitems * sizeof(writing_b[0]));
  297. if(r < 0) {
  298. perror("Read error");
  299. close(in0_w);
  300. return 1;
  301. }
  302. int const in1_w { open( "party0_write_flags_c", O_RDONLY ) };
  303. r = read(in1_w, writing_c, db_nitems * sizeof(writing_c[0]));
  304. if(r < 0) {
  305. perror("Read error");
  306. close(in1_w);
  307. return 1;
  308. }
  309. int const in2_w { open( "party0_write_flags_d", O_RDONLY ) };
  310. r = read(in2_w, writing_d, db_nitems * sizeof(writing_d[0]));
  311. if(r < 0) {
  312. perror("Read error");
  313. close(in2_w);
  314. return 1;
  315. }
  316. int const in0_w_ { open( "party0_write_b", O_RDONLY ) };
  317. r = read(in0_w_, b, db_nitems * sizeof(b[0]));
  318. if(r < 0) {
  319. perror("Read error");
  320. close(in0_w_);
  321. return 1;
  322. }
  323. int const in1_w_ { open( "party0_write_c", O_RDONLY ) };
  324. r = read(in1_w_, c, db_nitems * sizeof(c[0]));
  325. if(r < 0) {
  326. perror("Read error");
  327. close(in1_w_);
  328. return 1;
  329. }
  330. int const in2_w_ { open( "party0_write_d", O_RDONLY ) };
  331. r = read(in2_w_, d, db_nitems * sizeof(d[0]));
  332. if(r < 0) {
  333. perror("Read error");
  334. close(in2_w_);
  335. return 1;
  336. }
  337. }
  338. if(party)
  339. {
  340. int const in0 { open( "party1_read_flags_b", O_RDONLY ) };
  341. size_t r = read(in0, reading_b, db_nitems * sizeof(reading_b[0]));
  342. if(r < 0) {
  343. perror("Read error");
  344. close(in0);
  345. return 1;
  346. }
  347. int const in1 { open( "party1_read_flags_c", O_RDONLY ) };
  348. r = read(in1, reading_c, db_nitems * sizeof(reading_c[0]));
  349. if(r < 0) {
  350. perror("Read error");
  351. close(in1);
  352. return 1;
  353. }
  354. int const in2 { open( "party1_read_flags_d", O_RDONLY ) };
  355. r = read(in2, reading_d, db_nitems * sizeof(reading_d[0]));
  356. if(r < 0) {
  357. perror("Read error");
  358. close(in2);
  359. return 1;
  360. }
  361. int const in0_w { open( "party1_write_flags_b", O_RDONLY ) };
  362. r = read(in0_w, writing_b, db_nitems * sizeof(writing_b[0]));
  363. if(r < 0) {
  364. perror("Read error");
  365. close(in0_w);
  366. return 1;
  367. }
  368. int const in1_w { open( "party1_write_flags_c", O_RDONLY ) };
  369. r = read(in1_w, writing_c, db_nitems * sizeof(writing_c[0]));
  370. if(r < 0) {
  371. perror("Read error");
  372. close(in1_w);
  373. return 1;
  374. }
  375. int const in2_w { open( "party1_write_flags_d", O_RDONLY ) };
  376. r = read(in2_w, writing_d, db_nitems * sizeof(writing_d[0]));
  377. if(r < 0) {
  378. perror("Read error");
  379. close(in2_w);
  380. return 1;
  381. }
  382. int const in0_w_ { open( "party1_write_b", O_RDONLY ) };
  383. r = read(in0_w_, b, db_nitems * sizeof(b[0]));
  384. if(r < 0) {
  385. perror("Read error");
  386. close(in0_w);
  387. return 1;
  388. }
  389. int const in1_w_ { open( "party1_write_c", O_RDONLY ) };
  390. r = read(in1_w_, c, db_nitems * sizeof(c[0]));
  391. if(r < 0) {
  392. perror("Read error");
  393. close(in1_w);
  394. return 1;
  395. }
  396. int const in2_w_ { open( "party1_write_d", O_RDONLY ) };
  397. r = read(in2_w_, d, db_nitems * sizeof(d[0]));
  398. if(r < 0) {
  399. perror("Read error");
  400. close(in2_w);
  401. return 1;
  402. }
  403. }
  404. // if(party)
  405. // {
  406. // printf("PARTY 1\n");
  407. // for(size_t j = 0; j < db_nitems; ++j)
  408. // {
  409. // if(writing_b[j]) pm0 += 1;
  410. // if(writing_c[j]) pm1 += 1;
  411. // if(writing_d[j]) pm2 += 1;
  412. // }
  413. // }
  414. // else
  415. // {
  416. // printf("PARTY 0\n");
  417. // for(size_t j = 0; j < db_nitems; ++j)
  418. // {
  419. // if(writing_b[j]) pm0 -= 1;
  420. // if(writing_c[j]) pm1 -= 1;
  421. // if(writing_d[j]) pm2 -= 1;
  422. // }
  423. // }
  424. return 0;
  425. }
  426. void generate_random_distinguished_points(bool party)
  427. {
  428. if(party)
  429. {
  430. for(size_t j = 0; j < number_of_writes; ++j)
  431. {
  432. distinguised_value[j] = j + 2;
  433. }
  434. }
  435. if(!party)
  436. {
  437. for(size_t j = 0; j < number_of_writes; ++j)
  438. {
  439. distinguised_value[j] = j + 2;
  440. }
  441. }
  442. }
  443. // template<typename T1>
  444. // void rotate_all( T1 * orginal_vector1, T1 * rotated_vector1,
  445. // T1 * orginal_vector3, T1 * rotated_vector3,
  446. // T1 * orginal_vector5, T1 * rotated_vector5,
  447. // size_t rotate_by, size_t db_nitems)
  448. // {
  449. // for(size_t j = 0; j < db_nitems; ++j)
  450. // {
  451. // rotated_vector1[(j + rotate_by) % db_nitems] = orginal_vector1[j];
  452. // rotated_vector3[(j + rotate_by) % db_nitems] = orginal_vector3[j];
  453. // rotated_vector5[(j + rotate_by) % db_nitems] = orginal_vector5[j];
  454. // }
  455. // }
  456. DB_t dot_product_with_bool(DB_t D[], int8_t flags[], size_t db_nitems, size_t rotate_by = 0)
  457. {
  458. DB_t result = 0;
  459. for(size_t j = 0; j < db_nitems; ++j)
  460. {
  461. result = result + (D[(j + rotate_by) % db_nitems] * flags[j]);
  462. }
  463. return result;
  464. }
  465. // template<typename T1, typename T2>
  466. // T1 dot_product(T1 X[], T2 Y[])
  467. // {
  468. // T1 dot = 0;
  469. // for(size_t j = 0; j < db_nitems; ++j)
  470. // {
  471. // dot ^= (X[j] & Y[j]);
  472. // }
  473. // return dot;
  474. // }
  475. // void generate_cws(DB_t M0, DB_t final_cw_w, DB_t final_cw_u)
  476. // {
  477. // final_cw_writing = M0 ^ final_cw_w;
  478. // final_cw_updating = M0 ^ final_cw_u;
  479. // }