server.rs 38 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129
  1. #[cfg(target_feature = "avx2")]
  2. use std::arch::x86_64::*;
  3. use std::fs::File;
  4. use std::io::BufReader;
  5. use std::io::Read;
  6. use std::io::Seek;
  7. use std::io::SeekFrom;
  8. use std::time::Instant;
  9. use crate::aligned_memory::*;
  10. use crate::arith::*;
  11. use crate::client::PublicParameters;
  12. use crate::client::Query;
  13. use crate::gadget::*;
  14. use crate::params::*;
  15. use crate::poly::*;
  16. use crate::util::*;
  17. use rayon::prelude::*;
  18. pub fn coefficient_expansion(
  19. v: &mut Vec<PolyMatrixNTT>,
  20. g: usize,
  21. stop_round: usize,
  22. params: &Params,
  23. v_w_left: &Vec<PolyMatrixNTT>,
  24. v_w_right: &Vec<PolyMatrixNTT>,
  25. v_neg1: &Vec<PolyMatrixNTT>,
  26. max_bits_to_gen_right: usize,
  27. ) {
  28. let poly_len = params.poly_len;
  29. for r in 0..g {
  30. let num_in = 1 << r;
  31. let num_out = 2 * num_in;
  32. let t = (poly_len / (1 << r)) + 1;
  33. let neg1 = &v_neg1[r];
  34. let action_expand = |(i, v_i): (usize, &mut PolyMatrixNTT)| {
  35. if (stop_round > 0 && r > stop_round && (i % 2) == 1)
  36. || (stop_round > 0
  37. && r == stop_round
  38. && (i % 2) == 1
  39. && (i / 2) >= max_bits_to_gen_right)
  40. {
  41. return;
  42. }
  43. let mut ct = PolyMatrixRaw::zero(params, 2, 1);
  44. let mut ct_auto = PolyMatrixRaw::zero(params, 2, 1);
  45. let mut ct_auto_1 = PolyMatrixRaw::zero(params, 1, 1);
  46. let mut ct_auto_1_ntt = PolyMatrixNTT::zero(params, 1, 1);
  47. let mut w_times_ginv_ct = PolyMatrixNTT::zero(params, 2, 1);
  48. let mut ginv_ct_left = PolyMatrixRaw::zero(params, params.t_exp_left, 1);
  49. let mut ginv_ct_left_ntt = PolyMatrixNTT::zero(params, params.t_exp_left, 1);
  50. let mut ginv_ct_right = PolyMatrixRaw::zero(params, params.t_exp_right, 1);
  51. let mut ginv_ct_right_ntt = PolyMatrixNTT::zero(params, params.t_exp_right, 1);
  52. let (w, _gadget_dim, gi_ct, gi_ct_ntt) = match i % 2 {
  53. 0 => (
  54. &v_w_left[r],
  55. params.t_exp_left,
  56. &mut ginv_ct_left,
  57. &mut ginv_ct_left_ntt,
  58. ),
  59. 1 | _ => (
  60. &v_w_right[r],
  61. params.t_exp_right,
  62. &mut ginv_ct_right,
  63. &mut ginv_ct_right_ntt,
  64. ),
  65. };
  66. // if i < num_in {
  67. // let (src, dest) = v.split_at_mut(num_in);
  68. // scalar_multiply(&mut dest[i], neg1, &src[i]);
  69. // }
  70. from_ntt(&mut ct, &v_i);
  71. automorph(&mut ct_auto, &ct, t);
  72. gadget_invert_rdim(gi_ct, &ct_auto, 1);
  73. to_ntt_no_reduce(gi_ct_ntt, &gi_ct);
  74. ct_auto_1
  75. .data
  76. .as_mut_slice()
  77. .copy_from_slice(ct_auto.get_poly(1, 0));
  78. to_ntt(&mut ct_auto_1_ntt, &ct_auto_1);
  79. multiply(&mut w_times_ginv_ct, w, &gi_ct_ntt);
  80. let mut idx = 0;
  81. for j in 0..2 {
  82. for n in 0..params.crt_count {
  83. for z in 0..poly_len {
  84. let sum = (*v_i).data[idx]
  85. + w_times_ginv_ct.data[idx]
  86. + j * ct_auto_1_ntt.data[n * poly_len + z];
  87. (*v_i).data[idx] = barrett_coeff_u64(params, sum, n);
  88. idx += 1;
  89. }
  90. }
  91. }
  92. };
  93. let (src, dest) = v.split_at_mut(num_in);
  94. src.par_iter_mut()
  95. .zip(dest.par_iter_mut())
  96. .for_each(|(s, d)| {
  97. scalar_multiply(d, neg1, s);
  98. });
  99. v[0..num_in]
  100. .par_iter_mut()
  101. .enumerate()
  102. .for_each(action_expand);
  103. v[num_in..num_out]
  104. .par_iter_mut()
  105. .enumerate()
  106. .for_each(action_expand);
  107. }
  108. }
  109. pub fn regev_to_gsw<'a>(
  110. v_gsw: &mut Vec<PolyMatrixNTT<'a>>,
  111. v_inp: &Vec<PolyMatrixNTT<'a>>,
  112. v: &PolyMatrixNTT<'a>,
  113. params: &'a Params,
  114. idx_factor: usize,
  115. idx_offset: usize,
  116. ) {
  117. assert!(v.rows == 2);
  118. assert!(v.cols == 2 * params.t_conv);
  119. v_gsw.par_iter_mut().enumerate().for_each(|(i, ct)| {
  120. let mut ginv_c_inp = PolyMatrixRaw::zero(params, 2 * params.t_conv, 1);
  121. let mut ginv_c_inp_ntt = PolyMatrixNTT::zero(params, 2 * params.t_conv, 1);
  122. let mut tmp_ct_raw = PolyMatrixRaw::zero(params, 2, 1);
  123. let mut tmp_ct = PolyMatrixNTT::zero(params, 2, 1);
  124. for j in 0..params.t_gsw {
  125. let idx_ct = i * params.t_gsw + j;
  126. let idx_inp = idx_factor * (idx_ct) + idx_offset;
  127. ct.copy_into(&v_inp[idx_inp], 0, 2 * j + 1);
  128. from_ntt(&mut tmp_ct_raw, &v_inp[idx_inp]);
  129. gadget_invert(&mut ginv_c_inp, &tmp_ct_raw);
  130. to_ntt(&mut ginv_c_inp_ntt, &ginv_c_inp);
  131. multiply(&mut tmp_ct, v, &ginv_c_inp_ntt);
  132. ct.copy_into(&tmp_ct, 0, 2 * j);
  133. }
  134. });
  135. }
  136. pub const MAX_SUMMED: usize = 1 << 6;
  137. pub const PACKED_OFFSET_2: i32 = 32;
  138. #[cfg(target_feature = "avx2")]
  139. pub fn multiply_reg_by_database(
  140. out: &mut Vec<PolyMatrixNTT>,
  141. db: &[u64],
  142. v_firstdim: &[u64],
  143. params: &Params,
  144. dim0: usize,
  145. num_per: usize,
  146. ) {
  147. let ct_rows = 2;
  148. let ct_cols = 1;
  149. let pt_rows = 1;
  150. let pt_cols = 1;
  151. assert!(dim0 * ct_rows >= MAX_SUMMED);
  152. let mut sums_out_n0_u64 = AlignedMemory64::new(4);
  153. let mut sums_out_n2_u64 = AlignedMemory64::new(4);
  154. for z in 0..params.poly_len {
  155. let idx_a_base = z * (ct_cols * dim0 * ct_rows);
  156. let mut idx_b_base = z * (num_per * pt_cols * dim0 * pt_rows);
  157. for i in 0..num_per {
  158. for c in 0..pt_cols {
  159. let inner_limit = MAX_SUMMED;
  160. let outer_limit = dim0 * ct_rows / inner_limit;
  161. let mut sums_out_n0_u64_acc = [0u64, 0, 0, 0];
  162. let mut sums_out_n2_u64_acc = [0u64, 0, 0, 0];
  163. for o_jm in 0..outer_limit {
  164. unsafe {
  165. let mut sums_out_n0 = _mm256_setzero_si256();
  166. let mut sums_out_n2 = _mm256_setzero_si256();
  167. for i_jm in 0..inner_limit / 4 {
  168. let jm = o_jm * inner_limit + (4 * i_jm);
  169. let b_inp_1 = *db.get_unchecked(idx_b_base) as i64;
  170. idx_b_base += 1;
  171. let b_inp_2 = *db.get_unchecked(idx_b_base) as i64;
  172. idx_b_base += 1;
  173. let b = _mm256_set_epi64x(b_inp_2, b_inp_2, b_inp_1, b_inp_1);
  174. let v_a = v_firstdim.get_unchecked(idx_a_base + jm) as *const u64;
  175. let a = _mm256_load_si256(v_a as *const __m256i);
  176. let a_lo = a;
  177. let a_hi_hi = _mm256_srli_epi64(a, PACKED_OFFSET_2);
  178. let b_lo = b;
  179. let b_hi_hi = _mm256_srli_epi64(b, PACKED_OFFSET_2);
  180. sums_out_n0 =
  181. _mm256_add_epi64(sums_out_n0, _mm256_mul_epu32(a_lo, b_lo));
  182. sums_out_n2 =
  183. _mm256_add_epi64(sums_out_n2, _mm256_mul_epu32(a_hi_hi, b_hi_hi));
  184. }
  185. // reduce here, otherwise we will overflow
  186. _mm256_store_si256(
  187. sums_out_n0_u64.as_mut_ptr() as *mut __m256i,
  188. sums_out_n0,
  189. );
  190. _mm256_store_si256(
  191. sums_out_n2_u64.as_mut_ptr() as *mut __m256i,
  192. sums_out_n2,
  193. );
  194. for idx in 0..4 {
  195. let val = sums_out_n0_u64[idx];
  196. sums_out_n0_u64_acc[idx] =
  197. barrett_coeff_u64(params, val + sums_out_n0_u64_acc[idx], 0);
  198. }
  199. for idx in 0..4 {
  200. let val = sums_out_n2_u64[idx];
  201. sums_out_n2_u64_acc[idx] =
  202. barrett_coeff_u64(params, val + sums_out_n2_u64_acc[idx], 1);
  203. }
  204. }
  205. }
  206. for idx in 0..4 {
  207. sums_out_n0_u64_acc[idx] =
  208. barrett_coeff_u64(params, sums_out_n0_u64_acc[idx], 0);
  209. sums_out_n2_u64_acc[idx] =
  210. barrett_coeff_u64(params, sums_out_n2_u64_acc[idx], 1);
  211. }
  212. // output n0
  213. let (crt_count, poly_len) = (params.crt_count, params.poly_len);
  214. let mut n = 0;
  215. let mut idx_c = c * (crt_count * poly_len) + n * (poly_len) + z;
  216. out[i].data[idx_c] =
  217. barrett_coeff_u64(params, sums_out_n0_u64_acc[0] + sums_out_n0_u64_acc[2], 0);
  218. idx_c += pt_cols * crt_count * poly_len;
  219. out[i].data[idx_c] =
  220. barrett_coeff_u64(params, sums_out_n0_u64_acc[1] + sums_out_n0_u64_acc[3], 0);
  221. // output n1
  222. n = 1;
  223. idx_c = c * (crt_count * poly_len) + n * (poly_len) + z;
  224. out[i].data[idx_c] =
  225. barrett_coeff_u64(params, sums_out_n2_u64_acc[0] + sums_out_n2_u64_acc[2], 1);
  226. idx_c += pt_cols * crt_count * poly_len;
  227. out[i].data[idx_c] =
  228. barrett_coeff_u64(params, sums_out_n2_u64_acc[1] + sums_out_n2_u64_acc[3], 1);
  229. }
  230. }
  231. }
  232. }
  233. #[cfg(not(target_feature = "avx2"))]
  234. pub fn multiply_reg_by_database(
  235. out: &mut Vec<PolyMatrixNTT>,
  236. db: &[u64],
  237. v_firstdim: &[u64],
  238. params: &Params,
  239. dim0: usize,
  240. num_per: usize,
  241. ) {
  242. let ct_rows = 2;
  243. let ct_cols = 1;
  244. let pt_rows = 1;
  245. let pt_cols = 1;
  246. for z in 0..params.poly_len {
  247. let idx_a_base = z * (ct_cols * dim0 * ct_rows);
  248. let mut idx_b_base = z * (num_per * pt_cols * dim0 * pt_rows);
  249. for i in 0..num_per {
  250. for c in 0..pt_cols {
  251. let mut sums_out_n0_0 = 0u128;
  252. let mut sums_out_n0_1 = 0u128;
  253. let mut sums_out_n1_0 = 0u128;
  254. let mut sums_out_n1_1 = 0u128;
  255. for jm in 0..(dim0 * pt_rows) {
  256. let b = db[idx_b_base];
  257. idx_b_base += 1;
  258. let v_a0 = v_firstdim[idx_a_base + jm * ct_rows];
  259. let v_a1 = v_firstdim[idx_a_base + jm * ct_rows + 1];
  260. let b_lo = b as u32;
  261. let b_hi = (b >> 32) as u32;
  262. let v_a0_lo = v_a0 as u32;
  263. let v_a0_hi = (v_a0 >> 32) as u32;
  264. let v_a1_lo = v_a1 as u32;
  265. let v_a1_hi = (v_a1 >> 32) as u32;
  266. // do n0
  267. sums_out_n0_0 += ((v_a0_lo as u64) * (b_lo as u64)) as u128;
  268. sums_out_n0_1 += ((v_a1_lo as u64) * (b_lo as u64)) as u128;
  269. // do n1
  270. sums_out_n1_0 += ((v_a0_hi as u64) * (b_hi as u64)) as u128;
  271. sums_out_n1_1 += ((v_a1_hi as u64) * (b_hi as u64)) as u128;
  272. }
  273. // output n0
  274. let (crt_count, poly_len) = (params.crt_count, params.poly_len);
  275. let mut n = 0;
  276. let mut idx_c = c * (crt_count * poly_len) + n * (poly_len) + z;
  277. out[i].data[idx_c] = (sums_out_n0_0 % (params.moduli[0] as u128)) as u64;
  278. idx_c += pt_cols * crt_count * poly_len;
  279. out[i].data[idx_c] = (sums_out_n0_1 % (params.moduli[0] as u128)) as u64;
  280. // output n1
  281. n = 1;
  282. idx_c = c * (crt_count * poly_len) + n * (poly_len) + z;
  283. out[i].data[idx_c] = (sums_out_n1_0 % (params.moduli[1] as u128)) as u64;
  284. idx_c += pt_cols * crt_count * poly_len;
  285. out[i].data[idx_c] = (sums_out_n1_1 % (params.moduli[1] as u128)) as u64;
  286. }
  287. }
  288. }
  289. }
  290. pub fn generate_random_db_and_get_item<'a>(
  291. params: &'a Params,
  292. item_idx: usize,
  293. ) -> (PolyMatrixRaw<'a>, AlignedMemory64) {
  294. let mut rng = get_seeded_rng();
  295. let instances = params.instances;
  296. let trials = params.n * params.n;
  297. let dim0 = 1 << params.db_dim_1;
  298. let num_per = 1 << params.db_dim_2;
  299. let num_items = dim0 * num_per;
  300. let db_size_words = instances * trials * num_items * params.poly_len;
  301. let mut v = AlignedMemory64::new(db_size_words);
  302. let mut item = PolyMatrixRaw::zero(params, params.n, params.n);
  303. for instance in 0..instances {
  304. println!("Instance {:?}", instance);
  305. for trial in 0..trials {
  306. println!("Trial {:?}", trial);
  307. for i in 0..num_items {
  308. let ii = i % num_per;
  309. let j = i / num_per;
  310. let mut db_item = PolyMatrixRaw::random_rng(params, 1, 1, &mut rng);
  311. db_item.reduce_mod(params.pt_modulus);
  312. if i == item_idx && instance == 0 {
  313. item.copy_into(&db_item, trial / params.n, trial % params.n);
  314. }
  315. for z in 0..params.poly_len {
  316. db_item.data[z] =
  317. recenter_mod(db_item.data[z], params.pt_modulus, params.modulus);
  318. }
  319. let db_item_ntt = db_item.ntt();
  320. for z in 0..params.poly_len {
  321. let idx_dst = calc_index(
  322. &[instance, trial, z, ii, j],
  323. &[instances, trials, params.poly_len, num_per, dim0],
  324. );
  325. v[idx_dst] = db_item_ntt.data[z]
  326. | (db_item_ntt.data[params.poly_len + z] << PACKED_OFFSET_2);
  327. }
  328. }
  329. }
  330. }
  331. (item, v)
  332. }
  333. pub fn load_item_from_file<'a>(
  334. params: &'a Params,
  335. file: &mut File,
  336. instance: usize,
  337. trial: usize,
  338. item_idx: usize,
  339. ) -> PolyMatrixRaw<'a> {
  340. let db_item_size = params.db_item_size;
  341. let instances = params.instances;
  342. let trials = params.n * params.n;
  343. let chunks = instances * trials;
  344. let bytes_per_chunk = f64::ceil(db_item_size as f64 / chunks as f64) as usize;
  345. let logp = f64::ceil(f64::log2(params.pt_modulus as f64)) as usize;
  346. let modp_words_per_chunk = f64::ceil((bytes_per_chunk * 8) as f64 / logp as f64) as usize;
  347. assert!(modp_words_per_chunk <= params.poly_len);
  348. let idx_item_in_file = item_idx * db_item_size;
  349. let idx_chunk = instance * trials + trial;
  350. let idx_poly_in_file = idx_item_in_file + idx_chunk * bytes_per_chunk;
  351. let mut out = PolyMatrixRaw::zero(params, 1, 1);
  352. let seek_result = file.seek(SeekFrom::Start(idx_poly_in_file as u64));
  353. if seek_result.is_err() {
  354. return out;
  355. }
  356. let mut data = vec![0u8; 2 * bytes_per_chunk];
  357. let bytes_read = file
  358. .read(&mut data.as_mut_slice()[0..bytes_per_chunk])
  359. .unwrap();
  360. let modp_words_read = f64::ceil((bytes_read * 8) as f64 / logp as f64) as usize;
  361. assert!(modp_words_read <= params.poly_len);
  362. for i in 0..modp_words_read {
  363. out.data[i] = read_arbitrary_bits(&data, i * logp, logp);
  364. assert!(out.data[i] <= params.pt_modulus);
  365. }
  366. out
  367. }
  368. pub fn load_db_from_file(params: &Params, file: &mut File) -> AlignedMemory64 {
  369. let instances = params.instances;
  370. let trials = params.n * params.n;
  371. let dim0 = 1 << params.db_dim_1;
  372. let num_per = 1 << params.db_dim_2;
  373. let num_items = dim0 * num_per;
  374. let db_size_words = instances * trials * num_items * params.poly_len;
  375. let mut v = AlignedMemory64::new(db_size_words);
  376. for instance in 0..instances {
  377. println!("Instance {:?}", instance);
  378. for trial in 0..trials {
  379. println!("Trial {:?}", trial);
  380. for i in 0..num_items {
  381. if i % 8192 == 0 {
  382. println!("item {:?}", i);
  383. }
  384. let ii = i % num_per;
  385. let j = i / num_per;
  386. let mut db_item = load_item_from_file(params, file, instance, trial, i);
  387. // db_item.reduce_mod(params.pt_modulus);
  388. for z in 0..params.poly_len {
  389. db_item.data[z] =
  390. recenter_mod(db_item.data[z], params.pt_modulus, params.modulus);
  391. }
  392. let db_item_ntt = db_item.ntt();
  393. for z in 0..params.poly_len {
  394. let idx_dst = calc_index(
  395. &[instance, trial, z, ii, j],
  396. &[instances, trials, params.poly_len, num_per, dim0],
  397. );
  398. v[idx_dst] = db_item_ntt.data[z]
  399. | (db_item_ntt.data[params.poly_len + z] << PACKED_OFFSET_2);
  400. }
  401. }
  402. }
  403. }
  404. v
  405. }
  406. pub fn load_file_unsafe(data: &mut [u64], file: &mut File) {
  407. let data_as_u8_mut = unsafe { data.align_to_mut::<u8>().1 };
  408. file.read_exact(data_as_u8_mut).unwrap();
  409. }
  410. pub fn load_file(data: &mut [u64], file: &mut File) {
  411. let mut reader = BufReader::with_capacity(1 << 24, file);
  412. let mut buf = [0u8; 8];
  413. for i in 0..data.len() {
  414. reader.read(&mut buf).unwrap();
  415. data[i] = u64::from_ne_bytes(buf);
  416. }
  417. }
  418. pub fn load_preprocessed_db_from_file(params: &Params, file: &mut File) -> AlignedMemory64 {
  419. let instances = params.instances;
  420. let trials = params.n * params.n;
  421. let dim0 = 1 << params.db_dim_1;
  422. let num_per = 1 << params.db_dim_2;
  423. let num_items = dim0 * num_per;
  424. let db_size_words = instances * trials * num_items * params.poly_len;
  425. let mut v = AlignedMemory64::new(db_size_words);
  426. let v_mut_slice = v.as_mut_slice();
  427. let now = Instant::now();
  428. load_file(v_mut_slice, file);
  429. println!("Done loading ({} ms).", now.elapsed().as_millis());
  430. v
  431. }
  432. pub fn fold_ciphertexts(
  433. params: &Params,
  434. v_cts: &mut Vec<PolyMatrixRaw>,
  435. v_folding: &Vec<PolyMatrixNTT>,
  436. v_folding_neg: &Vec<PolyMatrixNTT>,
  437. ) {
  438. let further_dims = log2(v_cts.len() as u64) as usize;
  439. let ell = v_folding[0].cols / 2;
  440. let mut ginv_c = PolyMatrixRaw::zero(&params, 2 * ell, 1);
  441. let mut ginv_c_ntt = PolyMatrixNTT::zero(&params, 2 * ell, 1);
  442. let mut prod = PolyMatrixNTT::zero(&params, 2, 1);
  443. let mut sum = PolyMatrixNTT::zero(&params, 2, 1);
  444. let mut num_per = v_cts.len();
  445. for cur_dim in 0..further_dims {
  446. num_per = num_per / 2;
  447. for i in 0..num_per {
  448. gadget_invert(&mut ginv_c, &v_cts[i]);
  449. to_ntt(&mut ginv_c_ntt, &ginv_c);
  450. multiply(
  451. &mut prod,
  452. &v_folding_neg[further_dims - 1 - cur_dim],
  453. &ginv_c_ntt,
  454. );
  455. gadget_invert(&mut ginv_c, &v_cts[num_per + i]);
  456. to_ntt(&mut ginv_c_ntt, &ginv_c);
  457. multiply(
  458. &mut sum,
  459. &v_folding[further_dims - 1 - cur_dim],
  460. &ginv_c_ntt,
  461. );
  462. add_into(&mut sum, &prod);
  463. from_ntt(&mut v_cts[i], &sum);
  464. }
  465. }
  466. }
  467. pub fn pack<'a>(
  468. params: &'a Params,
  469. v_ct: &Vec<PolyMatrixRaw>,
  470. v_w: &Vec<PolyMatrixNTT>,
  471. ) -> PolyMatrixNTT<'a> {
  472. assert!(v_ct.len() >= params.n * params.n);
  473. assert!(v_w.len() == params.n);
  474. assert!(v_ct[0].rows == 2);
  475. assert!(v_ct[0].cols == 1);
  476. assert!(v_w[0].rows == (params.n + 1));
  477. assert!(v_w[0].cols == params.t_conv);
  478. let mut result = PolyMatrixNTT::zero(params, params.n + 1, params.n);
  479. let mut ginv = PolyMatrixRaw::zero(params, params.t_conv, 1);
  480. let mut ginv_nttd = PolyMatrixNTT::zero(params, params.t_conv, 1);
  481. let mut prod = PolyMatrixNTT::zero(params, params.n + 1, 1);
  482. let mut ct_1 = PolyMatrixRaw::zero(params, 1, 1);
  483. let mut ct_2 = PolyMatrixRaw::zero(params, 1, 1);
  484. let mut ct_2_ntt = PolyMatrixNTT::zero(params, 1, 1);
  485. for c in 0..params.n {
  486. let mut v_int = PolyMatrixNTT::zero(&params, params.n + 1, 1);
  487. for r in 0..params.n {
  488. let w = &v_w[r];
  489. let ct = &v_ct[r * params.n + c];
  490. ct_1.get_poly_mut(0, 0).copy_from_slice(ct.get_poly(0, 0));
  491. ct_2.get_poly_mut(0, 0).copy_from_slice(ct.get_poly(1, 0));
  492. to_ntt(&mut ct_2_ntt, &ct_2);
  493. gadget_invert(&mut ginv, &ct_1);
  494. to_ntt(&mut ginv_nttd, &ginv);
  495. multiply(&mut prod, &w, &ginv_nttd);
  496. add_into_at(&mut v_int, &ct_2_ntt, 1 + r, 0);
  497. add_into(&mut v_int, &prod);
  498. }
  499. result.copy_into(&v_int, 0, c);
  500. }
  501. result
  502. }
  503. pub fn encode(params: &Params, v_packed_ct: &Vec<PolyMatrixRaw>) -> Vec<u8> {
  504. let q1 = 4 * params.pt_modulus;
  505. let q1_bits = log2_ceil(q1) as usize;
  506. let q2 = Q2_VALUES[params.q2_bits as usize];
  507. let q2_bits = params.q2_bits as usize;
  508. let num_bits = params.instances
  509. * ((q2_bits * params.n * params.poly_len)
  510. + (q1_bits * params.n * params.n * params.poly_len));
  511. let round_to = 64;
  512. let num_bytes_rounded_up = ((num_bits + round_to - 1) / round_to) * round_to / 8;
  513. let mut result = vec![0u8; num_bytes_rounded_up];
  514. let mut bit_offs = 0;
  515. for instance in 0..params.instances {
  516. let packed_ct = &v_packed_ct[instance];
  517. let mut first_row = packed_ct.submatrix(0, 0, 1, packed_ct.cols);
  518. let mut rest_rows = packed_ct.submatrix(1, 0, packed_ct.rows - 1, packed_ct.cols);
  519. first_row.apply_func(|x| rescale(x, params.modulus, q2));
  520. rest_rows.apply_func(|x| rescale(x, params.modulus, q1));
  521. let data = result.as_mut_slice();
  522. for i in 0..params.n * params.poly_len {
  523. write_arbitrary_bits(data, first_row.data[i], bit_offs, q2_bits);
  524. bit_offs += q2_bits;
  525. }
  526. for i in 0..params.n * params.n * params.poly_len {
  527. write_arbitrary_bits(data, rest_rows.data[i], bit_offs, q1_bits);
  528. bit_offs += q1_bits;
  529. }
  530. }
  531. result
  532. }
  533. pub fn get_v_folding_neg<'a>(
  534. params: &'a Params,
  535. v_folding: &Vec<PolyMatrixNTT<'a>>,
  536. ) -> Vec<PolyMatrixNTT<'a>> {
  537. let gadget_ntt = build_gadget(params, 2, 2 * params.t_gsw).ntt(); // TODO: make this better
  538. let v_folding_neg = (0..params.db_dim_2)
  539. .into_par_iter()
  540. .map(|i| {
  541. let mut ct_gsw_inv = PolyMatrixRaw::zero(params, 2, 2 * params.t_gsw);
  542. invert(&mut ct_gsw_inv, &v_folding[i].raw());
  543. let mut ct_gsw_neg = PolyMatrixNTT::zero(params, 2, 2 * params.t_gsw);
  544. add(&mut ct_gsw_neg, &gadget_ntt, &ct_gsw_inv.ntt());
  545. ct_gsw_neg
  546. })
  547. .collect();
  548. v_folding_neg
  549. }
  550. pub fn expand_query<'a>(
  551. params: &'a Params,
  552. public_params: &PublicParameters<'a>,
  553. query: &Query<'a>,
  554. ) -> (AlignedMemory64, Vec<PolyMatrixNTT<'a>>) {
  555. let dim0 = 1 << params.db_dim_1;
  556. let further_dims = params.db_dim_2;
  557. let mut v_reg_reoriented;
  558. let mut v_folding;
  559. let num_bits_to_gen = params.t_gsw * further_dims + dim0;
  560. let g = log2_ceil_usize(num_bits_to_gen);
  561. let right_expanded = params.t_gsw * further_dims;
  562. let stop_round = log2_ceil_usize(right_expanded);
  563. let mut v = Vec::new();
  564. for _ in 0..(1 << g) {
  565. v.push(PolyMatrixNTT::zero(params, 2, 1));
  566. }
  567. v[0].copy_into(&query.ct.as_ref().unwrap().ntt(), 0, 0);
  568. let v_conversion = &public_params.v_conversion.as_ref().unwrap()[0];
  569. let v_w_left = public_params.v_expansion_left.as_ref().unwrap();
  570. let v_w_right = public_params.v_expansion_right.as_ref().unwrap();
  571. let v_neg1 = params.get_v_neg1();
  572. coefficient_expansion(
  573. &mut v,
  574. g,
  575. stop_round,
  576. params,
  577. &v_w_left,
  578. &v_w_right,
  579. &v_neg1,
  580. params.t_gsw * params.db_dim_2,
  581. );
  582. let mut v_reg_inp = Vec::with_capacity(dim0);
  583. for i in 0..dim0 {
  584. v_reg_inp.push(v[2 * i].clone());
  585. }
  586. let mut v_gsw_inp = Vec::with_capacity(right_expanded);
  587. for i in 0..right_expanded {
  588. v_gsw_inp.push(v[2 * i + 1].clone());
  589. }
  590. let v_reg_sz = dim0 * 2 * params.poly_len;
  591. v_reg_reoriented = AlignedMemory64::new(v_reg_sz);
  592. reorient_reg_ciphertexts(params, v_reg_reoriented.as_mut_slice(), &v_reg_inp);
  593. v_folding = Vec::new();
  594. for _ in 0..params.db_dim_2 {
  595. v_folding.push(PolyMatrixNTT::zero(params, 2, 2 * params.t_gsw));
  596. }
  597. regev_to_gsw(&mut v_folding, &v_gsw_inp, &v_conversion, params, 1, 0);
  598. (v_reg_reoriented, v_folding)
  599. }
  600. pub fn process_query(
  601. params: &Params,
  602. public_params: &PublicParameters,
  603. query: &Query,
  604. db: &[u64],
  605. ) -> Vec<u8> {
  606. let dim0 = 1 << params.db_dim_1;
  607. let num_per = 1 << params.db_dim_2;
  608. let db_slice_sz = dim0 * num_per * params.poly_len;
  609. let v_packing = public_params.v_packing.as_ref();
  610. let mut v_reg_reoriented;
  611. let v_folding;
  612. if params.expand_queries {
  613. (v_reg_reoriented, v_folding) = expand_query(params, public_params, query);
  614. } else {
  615. v_reg_reoriented = AlignedMemory64::new(query.v_buf.as_ref().unwrap().len());
  616. v_reg_reoriented
  617. .as_mut_slice()
  618. .copy_from_slice(query.v_buf.as_ref().unwrap());
  619. v_folding = query
  620. .v_ct
  621. .as_ref()
  622. .unwrap()
  623. .iter()
  624. .map(|x| x.ntt())
  625. .collect();
  626. }
  627. let v_folding_neg = get_v_folding_neg(params, &v_folding);
  628. let v_packed_ct = (0..params.instances)
  629. .into_par_iter()
  630. .map(|instance| {
  631. let mut intermediate = Vec::with_capacity(num_per);
  632. let mut intermediate_raw = Vec::with_capacity(num_per);
  633. for _ in 0..num_per {
  634. intermediate.push(PolyMatrixNTT::zero(params, 2, 1));
  635. intermediate_raw.push(PolyMatrixRaw::zero(params, 2, 1));
  636. }
  637. let mut v_ct = Vec::new();
  638. for trial in 0..(params.n * params.n) {
  639. let idx = (instance * (params.n * params.n) + trial) * db_slice_sz;
  640. let cur_db = &db[idx..(idx + db_slice_sz)];
  641. multiply_reg_by_database(
  642. &mut intermediate,
  643. cur_db,
  644. v_reg_reoriented.as_slice(),
  645. params,
  646. dim0,
  647. num_per,
  648. );
  649. for i in 0..intermediate.len() {
  650. from_ntt(&mut intermediate_raw[i], &intermediate[i]);
  651. }
  652. fold_ciphertexts(params, &mut intermediate_raw, &v_folding, &v_folding_neg);
  653. v_ct.push(intermediate_raw[0].clone());
  654. }
  655. let packed_ct = pack(params, &v_ct, &v_packing);
  656. packed_ct.raw()
  657. })
  658. .collect();
  659. encode(params, &v_packed_ct)
  660. }
  661. #[cfg(test)]
  662. mod test {
  663. use super::*;
  664. use crate::client::*;
  665. use rand::{prelude::SmallRng, Rng};
  666. const TEST_PREPROCESSED_DB_PATH: &'static str = "/home/samir/wiki/enwiki-20220320.dbp";
  667. fn get_params() -> Params {
  668. get_fast_expansion_testing_params()
  669. }
  670. fn dec_reg<'a>(
  671. params: &'a Params,
  672. ct: &PolyMatrixNTT<'a>,
  673. client: &mut Client<'a, SmallRng>,
  674. scale_k: u64,
  675. ) -> u64 {
  676. let dec = client.decrypt_matrix_reg(ct).raw();
  677. let mut val = dec.data[0] as i64;
  678. if val >= (params.modulus / 2) as i64 {
  679. val -= params.modulus as i64;
  680. }
  681. let val_rounded = f64::round(val as f64 / scale_k as f64) as i64;
  682. if val_rounded == 0 {
  683. 0
  684. } else {
  685. 1
  686. }
  687. }
  688. fn dec_gsw<'a>(
  689. params: &'a Params,
  690. ct: &PolyMatrixNTT<'a>,
  691. client: &mut Client<'a, SmallRng>,
  692. ) -> u64 {
  693. let dec = client.decrypt_matrix_reg(ct).raw();
  694. let idx = 2 * (params.t_gsw - 1) * params.poly_len + params.poly_len; // this offset should encode a large value
  695. let mut val = dec.data[idx] as i64;
  696. if val >= (params.modulus / 2) as i64 {
  697. val -= params.modulus as i64;
  698. }
  699. if i64::abs(val) < (1i64 << 10) {
  700. 0
  701. } else {
  702. 1
  703. }
  704. }
  705. #[test]
  706. fn coefficient_expansion_is_correct() {
  707. let params = get_params();
  708. let v_neg1 = params.get_v_neg1();
  709. let mut seeded_rng = get_seeded_rng();
  710. let mut client = Client::init(&params, &mut seeded_rng);
  711. let public_params = client.generate_keys();
  712. let mut v = Vec::new();
  713. for _ in 0..(1 << (params.db_dim_1 + 1)) {
  714. v.push(PolyMatrixNTT::zero(&params, 2, 1));
  715. }
  716. let target = 7;
  717. let scale_k = params.modulus / params.pt_modulus;
  718. let mut sigma = PolyMatrixRaw::zero(&params, 1, 1);
  719. sigma.data[target] = scale_k;
  720. v[0] = client.encrypt_matrix_reg(&sigma.ntt());
  721. let test_ct = client.encrypt_matrix_reg(&sigma.ntt());
  722. let v_w_left = public_params.v_expansion_left.unwrap();
  723. let v_w_right = public_params.v_expansion_right.unwrap();
  724. coefficient_expansion(
  725. &mut v,
  726. params.g(),
  727. params.stop_round(),
  728. &params,
  729. &v_w_left,
  730. &v_w_right,
  731. &v_neg1,
  732. params.t_gsw * params.db_dim_2,
  733. );
  734. assert_eq!(dec_reg(&params, &test_ct, &mut client, scale_k), 0);
  735. for i in 0..v.len() {
  736. if i == target {
  737. assert_eq!(dec_reg(&params, &v[i], &mut client, scale_k), 1);
  738. } else {
  739. assert_eq!(dec_reg(&params, &v[i], &mut client, scale_k), 0);
  740. }
  741. }
  742. }
  743. #[test]
  744. fn regev_to_gsw_is_correct() {
  745. let mut params = get_params();
  746. params.db_dim_2 = 1;
  747. let mut seeded_rng = get_seeded_rng();
  748. let mut client = Client::init(&params, &mut seeded_rng);
  749. let public_params = client.generate_keys();
  750. let mut enc_constant = |val| {
  751. let mut sigma = PolyMatrixRaw::zero(&params, 1, 1);
  752. sigma.data[0] = val;
  753. client.encrypt_matrix_reg(&sigma.ntt())
  754. };
  755. let v = &public_params.v_conversion.unwrap()[0];
  756. let bits_per = get_bits_per(&params, params.t_gsw);
  757. let mut v_inp_1 = Vec::new();
  758. let mut v_inp_0 = Vec::new();
  759. for i in 0..params.t_gsw {
  760. let val = 1u64 << (bits_per * i);
  761. v_inp_1.push(enc_constant(val));
  762. v_inp_0.push(enc_constant(0));
  763. }
  764. let mut v_gsw = Vec::new();
  765. v_gsw.push(PolyMatrixNTT::zero(&params, 2, 2 * params.t_gsw));
  766. regev_to_gsw(&mut v_gsw, &v_inp_1, v, &params, 1, 0);
  767. assert_eq!(dec_gsw(&params, &v_gsw[0], &mut client), 1);
  768. regev_to_gsw(&mut v_gsw, &v_inp_0, v, &params, 1, 0);
  769. assert_eq!(dec_gsw(&params, &v_gsw[0], &mut client), 0);
  770. }
  771. #[test]
  772. fn multiply_reg_by_database_is_correct() {
  773. let params = get_params();
  774. let mut seeded_rng = get_seeded_rng();
  775. let dim0 = 1 << params.db_dim_1;
  776. let num_per = 1 << params.db_dim_2;
  777. let scale_k = params.modulus / params.pt_modulus;
  778. let target_idx = seeded_rng.gen::<usize>() % (dim0 * num_per);
  779. let target_idx_dim0 = target_idx / num_per;
  780. let target_idx_num_per = target_idx % num_per;
  781. let mut client = Client::init(&params, &mut seeded_rng);
  782. _ = client.generate_keys();
  783. let (corr_item, db) = generate_random_db_and_get_item(&params, target_idx);
  784. let mut v_reg = Vec::new();
  785. for i in 0..dim0 {
  786. let val = if i == target_idx_dim0 { scale_k } else { 0 };
  787. let sigma = PolyMatrixRaw::single_value(&params, val).ntt();
  788. v_reg.push(client.encrypt_matrix_reg(&sigma));
  789. }
  790. let v_reg_sz = dim0 * 2 * params.poly_len;
  791. let mut v_reg_reoriented = AlignedMemory64::new(v_reg_sz);
  792. reorient_reg_ciphertexts(&params, v_reg_reoriented.as_mut_slice(), &v_reg);
  793. let mut out = Vec::with_capacity(num_per);
  794. for _ in 0..dim0 {
  795. out.push(PolyMatrixNTT::zero(&params, 2, 1));
  796. }
  797. multiply_reg_by_database(
  798. &mut out,
  799. db.as_slice(),
  800. v_reg_reoriented.as_slice(),
  801. &params,
  802. dim0,
  803. num_per,
  804. );
  805. // decrypt
  806. let dec = client.decrypt_matrix_reg(&out[target_idx_num_per]).raw();
  807. let mut dec_rescaled = PolyMatrixRaw::zero(&params, 1, 1);
  808. for z in 0..params.poly_len {
  809. dec_rescaled.data[z] = rescale(dec.data[z], params.modulus, params.pt_modulus);
  810. }
  811. for z in 0..params.poly_len {
  812. // println!("{:?} {:?}", dec_rescaled.data[z], corr_item.data[z]);
  813. assert_eq!(dec_rescaled.data[z], corr_item.data[z]);
  814. }
  815. }
  816. #[test]
  817. fn fold_ciphertexts_is_correct() {
  818. let params = get_params();
  819. let mut seeded_rng = get_seeded_rng();
  820. let dim0 = 1 << params.db_dim_1;
  821. let num_per = 1 << params.db_dim_2;
  822. let scale_k = params.modulus / params.pt_modulus;
  823. let target_idx = seeded_rng.gen::<usize>() % (dim0 * num_per);
  824. let target_idx_num_per = target_idx % num_per;
  825. let mut client = Client::init(&params, &mut seeded_rng);
  826. _ = client.generate_keys();
  827. let mut v_reg = Vec::new();
  828. for i in 0..num_per {
  829. let val = if i == target_idx_num_per { scale_k } else { 0 };
  830. let sigma = PolyMatrixRaw::single_value(&params, val).ntt();
  831. v_reg.push(client.encrypt_matrix_reg(&sigma));
  832. }
  833. let mut v_reg_raw = Vec::new();
  834. for i in 0..num_per {
  835. v_reg_raw.push(v_reg[i].raw());
  836. }
  837. let bits_per = get_bits_per(&params, params.t_gsw);
  838. let mut v_folding = Vec::new();
  839. for i in 0..params.db_dim_2 {
  840. let bit = ((target_idx_num_per as u64) & (1 << (i as u64))) >> (i as u64);
  841. let mut ct_gsw = PolyMatrixNTT::zero(&params, 2, 2 * params.t_gsw);
  842. for j in 0..params.t_gsw {
  843. let value = (1u64 << (bits_per * j)) * bit;
  844. let sigma = PolyMatrixRaw::single_value(&params, value);
  845. let sigma_ntt = to_ntt_alloc(&sigma);
  846. let ct = client.encrypt_matrix_reg(&sigma_ntt);
  847. ct_gsw.copy_into(&ct, 0, 2 * j + 1);
  848. let prod = &to_ntt_alloc(client.get_sk_reg()) * &sigma_ntt;
  849. let ct = &client.encrypt_matrix_reg(&prod);
  850. ct_gsw.copy_into(&ct, 0, 2 * j);
  851. }
  852. v_folding.push(ct_gsw);
  853. }
  854. let gadget_ntt = build_gadget(&params, 2, 2 * params.t_gsw).ntt();
  855. let mut v_folding_neg = Vec::new();
  856. let mut ct_gsw_inv = PolyMatrixRaw::zero(&params, 2, 2 * params.t_gsw);
  857. for i in 0..params.db_dim_2 {
  858. invert(&mut ct_gsw_inv, &v_folding[i].raw());
  859. let mut ct_gsw_neg = PolyMatrixNTT::zero(&params, 2, 2 * params.t_gsw);
  860. add(&mut ct_gsw_neg, &gadget_ntt, &ct_gsw_inv.ntt());
  861. v_folding_neg.push(ct_gsw_neg);
  862. }
  863. fold_ciphertexts(&params, &mut v_reg_raw, &v_folding, &v_folding_neg);
  864. // decrypt
  865. assert_eq!(
  866. dec_reg(&params, &v_reg_raw[0].ntt(), &mut client, scale_k),
  867. 1
  868. );
  869. }
  870. fn full_protocol_is_correct_for_params(params: &Params) {
  871. let mut seeded_rng = get_seeded_rng();
  872. let target_idx = seeded_rng.gen::<usize>() % (params.db_dim_1 + params.db_dim_2);
  873. let mut client = Client::init(params, &mut seeded_rng);
  874. let public_params = client.generate_keys();
  875. let query = client.generate_query(target_idx);
  876. let (corr_item, db) = generate_random_db_and_get_item(params, target_idx);
  877. let response = process_query(params, &public_params, &query, db.as_slice());
  878. let result = client.decode_response(response.as_slice());
  879. let p_bits = log2_ceil(params.pt_modulus) as usize;
  880. let corr_result = corr_item.to_vec(p_bits, params.modp_words_per_chunk());
  881. assert_eq!(result.len(), corr_result.len());
  882. for z in 0..corr_result.len() {
  883. assert_eq!(result[z], corr_result[z], "at {:?}", z);
  884. }
  885. }
  886. fn full_protocol_is_correct_for_params_real_db(params: &Params) {
  887. let mut seeded_rng = get_seeded_rng();
  888. let target_idx = seeded_rng.gen::<usize>() % (params.db_dim_1 + params.db_dim_2);
  889. let mut client = Client::init(params, &mut seeded_rng);
  890. let public_params = client.generate_keys();
  891. let query = client.generate_query(target_idx);
  892. let mut file = File::open(TEST_PREPROCESSED_DB_PATH).unwrap();
  893. let db = load_preprocessed_db_from_file(params, &mut file);
  894. let response = process_query(params, &public_params, &query, db.as_slice());
  895. let result = client.decode_response(response.as_slice());
  896. let corr_result = vec![0x42, 0x5a, 0x68];
  897. for z in 0..corr_result.len() {
  898. assert_eq!(result[z], corr_result[z]);
  899. }
  900. }
  901. #[test]
  902. fn full_protocol_is_correct() {
  903. full_protocol_is_correct_for_params(&get_params());
  904. }
  905. #[test]
  906. #[ignore]
  907. fn larger_full_protocol_is_correct() {
  908. let cfg_expand = r#"
  909. {
  910. 'n': 2,
  911. 'nu_1': 10,
  912. 'nu_2': 6,
  913. 'p': 512,
  914. 'q2_bits': 21,
  915. 's_e': 85.83255142749422,
  916. 't_gsw': 10,
  917. 't_conv': 4,
  918. 't_exp_left': 16,
  919. 't_exp_right': 56,
  920. 'instances': 1,
  921. 'db_item_size': 9000 }
  922. "#;
  923. let cfg = cfg_expand;
  924. let cfg = cfg.replace("'", "\"");
  925. let params = params_from_json(&cfg);
  926. full_protocol_is_correct_for_params(&params);
  927. full_protocol_is_correct_for_params_real_db(&params);
  928. }
  929. // #[test]
  930. // fn full_protocol_is_correct_20_256() {
  931. // full_protocol_is_correct_for_params(&params_from_json(&CFG_20_256.replace("'", "\"")));
  932. // }
  933. // #[test]
  934. // fn full_protocol_is_correct_16_100000() {
  935. // full_protocol_is_correct_for_params(&params_from_json(&CFG_16_100000.replace("'", "\"")));
  936. // }
  937. #[test]
  938. #[ignore]
  939. fn full_protocol_is_correct_real_db_16_100000() {
  940. full_protocol_is_correct_for_params_real_db(&params_from_json(
  941. &CFG_16_100000.replace("'", "\""),
  942. ));
  943. }
  944. }