client.rs 28 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827
  1. use crate::{
  2. arith::*, discrete_gaussian::*, gadget::*, number_theory::*, params::*, poly::*, util::*,
  3. };
  4. use rand::{thread_rng, Rng, RngCore, SeedableRng};
  5. use rand_chacha::ChaCha20Rng;
  6. use std::{iter::once, mem::size_of};
  7. pub type Seed = <ChaCha20Rng as SeedableRng>::Seed;
  8. const SEED_LENGTH: usize = 32;
  9. fn new_vec_raw<'a>(
  10. params: &'a Params,
  11. num: usize,
  12. rows: usize,
  13. cols: usize,
  14. ) -> Vec<PolyMatrixRaw<'a>> {
  15. let mut v = Vec::with_capacity(num);
  16. for _ in 0..num {
  17. v.push(PolyMatrixRaw::zero(params, rows, cols));
  18. }
  19. v
  20. }
  21. fn get_inv_from_rng(params: &Params, rng: &mut ChaCha20Rng) -> u64 {
  22. params.modulus - (rng.gen::<u64>() % params.modulus)
  23. }
  24. fn mat_sz_bytes_excl_first_row(a: &PolyMatrixRaw) -> usize {
  25. (a.rows - 1) * a.cols * a.params.poly_len * size_of::<u64>()
  26. }
  27. fn serialize_polymatrix_for_rng(vec: &mut Vec<u8>, a: &PolyMatrixRaw) {
  28. let offs = a.cols * a.params.poly_len; // skip the first row
  29. for i in 0..(a.rows - 1) * a.cols * a.params.poly_len {
  30. vec.extend_from_slice(&u64::to_ne_bytes(a.data[offs + i]));
  31. }
  32. }
  33. fn serialize_vec_polymatrix_for_rng(vec: &mut Vec<u8>, a: &Vec<PolyMatrixRaw>) {
  34. for i in 0..a.len() {
  35. serialize_polymatrix_for_rng(vec, &a[i]);
  36. }
  37. }
  38. fn deserialize_polymatrix_rng(a: &mut PolyMatrixRaw, data: &[u8], rng: &mut ChaCha20Rng) -> usize {
  39. let (first_row, rest) = a
  40. .data
  41. .as_mut_slice()
  42. .split_at_mut(a.cols * a.params.poly_len);
  43. for i in 0..first_row.len() {
  44. first_row[i] = get_inv_from_rng(a.params, rng);
  45. }
  46. for (i, chunk) in data.chunks(size_of::<u64>()).enumerate() {
  47. rest[i] = u64::from_ne_bytes(chunk.try_into().unwrap());
  48. }
  49. mat_sz_bytes_excl_first_row(a)
  50. }
  51. fn deserialize_vec_polymatrix_rng(
  52. a: &mut Vec<PolyMatrixRaw>,
  53. data: &[u8],
  54. rng: &mut ChaCha20Rng,
  55. ) -> usize {
  56. let mut chunks = data.chunks(mat_sz_bytes_excl_first_row(&a[0]));
  57. let mut bytes_read = 0;
  58. for i in 0..a.len() {
  59. bytes_read += deserialize_polymatrix_rng(&mut a[i], chunks.next().unwrap(), rng);
  60. }
  61. bytes_read
  62. }
  63. fn extract_excl_rng_data(v_buf: &[u64]) -> Vec<u64> {
  64. let mut out = Vec::new();
  65. for i in 0..v_buf.len() {
  66. if i % 2 == 1 {
  67. out.push(v_buf[i]);
  68. }
  69. }
  70. out
  71. }
  72. fn interleave_rng_data(params: &Params, v_buf: &[u64], rng: &mut ChaCha20Rng) -> Vec<u64> {
  73. let mut out = Vec::new();
  74. let mut reg_cts = Vec::new();
  75. for _ in 0..params.num_expanded() {
  76. let mut sigma = PolyMatrixRaw::zero(&params, 2, 1);
  77. for z in 0..params.poly_len {
  78. sigma.data[z] = get_inv_from_rng(params, rng);
  79. }
  80. reg_cts.push(sigma.ntt());
  81. }
  82. // reorient into server's preferred indexing
  83. let reg_cts_buf_words = params.num_expanded() * 2 * params.poly_len;
  84. let mut reg_cts_buf = vec![0u64; reg_cts_buf_words];
  85. reorient_reg_ciphertexts(params, reg_cts_buf.as_mut_slice(), &reg_cts);
  86. assert_eq!(reg_cts_buf_words, 2 * v_buf.len());
  87. for i in 0..v_buf.len() {
  88. out.push(reg_cts_buf[2 * i]);
  89. out.push(v_buf[i]);
  90. }
  91. out
  92. }
  93. pub struct PublicParameters<'a> {
  94. pub v_packing: Vec<PolyMatrixNTT<'a>>, // Ws
  95. pub v_expansion_left: Option<Vec<PolyMatrixNTT<'a>>>,
  96. pub v_expansion_right: Option<Vec<PolyMatrixNTT<'a>>>,
  97. pub v_conversion: Option<Vec<PolyMatrixNTT<'a>>>, // V
  98. pub seed: Option<Seed>,
  99. }
  100. impl<'a> PublicParameters<'a> {
  101. pub fn init(params: &'a Params) -> Self {
  102. if params.expand_queries {
  103. PublicParameters {
  104. v_packing: Vec::new(),
  105. v_expansion_left: Some(Vec::new()),
  106. v_expansion_right: Some(Vec::new()),
  107. v_conversion: Some(Vec::new()),
  108. seed: None,
  109. }
  110. } else {
  111. PublicParameters {
  112. v_packing: Vec::new(),
  113. v_expansion_left: None,
  114. v_expansion_right: None,
  115. v_conversion: None,
  116. seed: None,
  117. }
  118. }
  119. }
  120. fn from_ntt_alloc_vec(v: &Vec<PolyMatrixNTT<'a>>) -> Option<Vec<PolyMatrixRaw<'a>>> {
  121. Some(v.iter().map(from_ntt_alloc).collect())
  122. }
  123. fn from_ntt_alloc_opt_vec(
  124. v: &Option<Vec<PolyMatrixNTT<'a>>>,
  125. ) -> Option<Vec<PolyMatrixRaw<'a>>> {
  126. Some(v.as_ref()?.iter().map(from_ntt_alloc).collect())
  127. }
  128. fn to_ntt_alloc_vec(v: &Vec<PolyMatrixRaw<'a>>) -> Option<Vec<PolyMatrixNTT<'a>>> {
  129. Some(v.iter().map(to_ntt_alloc).collect())
  130. }
  131. pub fn to_raw(&self) -> Vec<Option<Vec<PolyMatrixRaw>>> {
  132. vec![
  133. Self::from_ntt_alloc_vec(&self.v_packing),
  134. Self::from_ntt_alloc_opt_vec(&self.v_expansion_left),
  135. Self::from_ntt_alloc_opt_vec(&self.v_expansion_right),
  136. Self::from_ntt_alloc_opt_vec(&self.v_conversion),
  137. ]
  138. }
  139. pub fn serialize(&self) -> Vec<u8> {
  140. let mut data = Vec::new();
  141. if self.seed.is_some() {
  142. let seed = self.seed.as_ref().unwrap();
  143. data.extend(seed);
  144. }
  145. for v in self.to_raw().iter() {
  146. if v.is_some() {
  147. serialize_vec_polymatrix_for_rng(&mut data, v.as_ref().unwrap());
  148. }
  149. }
  150. data
  151. }
  152. pub fn deserialize(params: &'a Params, data: &[u8]) -> Self {
  153. assert_eq!(SEED_LENGTH + params.setup_bytes(), data.len());
  154. let mut idx = 0;
  155. let seed = data[0..SEED_LENGTH].try_into().unwrap();
  156. let mut rng = ChaCha20Rng::from_seed(seed);
  157. idx += SEED_LENGTH;
  158. let mut v_packing = new_vec_raw(params, params.n, params.n + 1, params.t_conv);
  159. idx += deserialize_vec_polymatrix_rng(&mut v_packing, &data[idx..], &mut rng);
  160. if params.expand_queries {
  161. let mut v_expansion_left = new_vec_raw(params, params.g(), 2, params.t_exp_left);
  162. idx += deserialize_vec_polymatrix_rng(&mut v_expansion_left, &data[idx..], &mut rng);
  163. let mut v_expansion_right =
  164. new_vec_raw(params, params.stop_round() + 1, 2, params.t_exp_right);
  165. idx += deserialize_vec_polymatrix_rng(&mut v_expansion_right, &data[idx..], &mut rng);
  166. let mut v_conversion = new_vec_raw(params, 1, 2, 2 * params.t_conv);
  167. _ = deserialize_vec_polymatrix_rng(&mut v_conversion, &data[idx..], &mut rng);
  168. Self {
  169. v_packing: Self::to_ntt_alloc_vec(&v_packing).unwrap(),
  170. v_expansion_left: Self::to_ntt_alloc_vec(&v_expansion_left),
  171. v_expansion_right: Self::to_ntt_alloc_vec(&v_expansion_right),
  172. v_conversion: Self::to_ntt_alloc_vec(&v_conversion),
  173. seed: Some(seed),
  174. }
  175. } else {
  176. Self {
  177. v_packing: Self::to_ntt_alloc_vec(&v_packing).unwrap(),
  178. v_expansion_left: None,
  179. v_expansion_right: None,
  180. v_conversion: None,
  181. seed: Some(seed),
  182. }
  183. }
  184. }
  185. }
  186. pub struct Query<'a> {
  187. pub ct: Option<PolyMatrixRaw<'a>>,
  188. pub v_buf: Option<Vec<u64>>,
  189. pub v_ct: Option<Vec<PolyMatrixRaw<'a>>>,
  190. pub seed: Option<Seed>,
  191. }
  192. impl<'a> Query<'a> {
  193. pub fn empty() -> Self {
  194. Query {
  195. ct: None,
  196. v_ct: None,
  197. v_buf: None,
  198. seed: None,
  199. }
  200. }
  201. pub fn serialize(&self) -> Vec<u8> {
  202. let mut data = Vec::new();
  203. if self.seed.is_some() {
  204. let seed = self.seed.as_ref().unwrap();
  205. data.extend(seed);
  206. }
  207. if self.ct.is_some() {
  208. let ct = self.ct.as_ref().unwrap();
  209. serialize_polymatrix_for_rng(&mut data, &ct);
  210. }
  211. if self.v_buf.is_some() {
  212. let v_buf = self.v_buf.as_ref().unwrap();
  213. let v_buf_extracted = extract_excl_rng_data(&v_buf);
  214. data.extend(v_buf_extracted.iter().map(|x| x.to_ne_bytes()).flatten());
  215. }
  216. if self.v_ct.is_some() {
  217. let v_ct = self.v_ct.as_ref().unwrap();
  218. for x in v_ct {
  219. serialize_polymatrix_for_rng(&mut data, x);
  220. }
  221. }
  222. data
  223. }
  224. pub fn deserialize(params: &'a Params, mut data: &[u8]) -> Self {
  225. assert_eq!(SEED_LENGTH + params.query_bytes(), data.len());
  226. let mut out = Query::empty();
  227. let seed = data[0..SEED_LENGTH].try_into().unwrap();
  228. out.seed = Some(seed);
  229. let mut rng = ChaCha20Rng::from_seed(seed);
  230. data = &data[SEED_LENGTH..];
  231. if params.expand_queries {
  232. let mut ct = PolyMatrixRaw::zero(params, 2, 1);
  233. deserialize_polymatrix_rng(&mut ct, data, &mut rng);
  234. out.ct = Some(ct);
  235. } else {
  236. let v_buf_bytes = params.query_v_buf_bytes();
  237. let v_buf: Vec<u64> = (&data[..v_buf_bytes])
  238. .chunks(size_of::<u64>())
  239. .map(|x| u64::from_ne_bytes(x.try_into().unwrap()))
  240. .collect();
  241. let v_buf_interleaved = interleave_rng_data(params, &v_buf, &mut rng);
  242. out.v_buf = Some(v_buf_interleaved);
  243. let mut v_ct = new_vec_raw(params, params.db_dim_2, 2, 2 * params.t_gsw);
  244. deserialize_vec_polymatrix_rng(&mut v_ct, &data[v_buf_bytes..], &mut rng);
  245. out.v_ct = Some(v_ct);
  246. }
  247. out
  248. }
  249. }
  250. fn matrix_with_identity<'a>(p: &PolyMatrixRaw<'a>) -> PolyMatrixRaw<'a> {
  251. assert_eq!(p.cols, 1);
  252. let mut r = PolyMatrixRaw::zero(p.params, p.rows, p.rows + 1);
  253. r.copy_into(p, 0, 0);
  254. r.copy_into(&PolyMatrixRaw::identity(p.params, p.rows, p.rows), 0, 1);
  255. r
  256. }
  257. fn params_with_moduli(params: &Params, moduli: &Vec<u64>) -> Params {
  258. Params::init(
  259. params.poly_len,
  260. moduli,
  261. params.noise_width,
  262. params.n,
  263. params.pt_modulus,
  264. params.q2_bits,
  265. params.t_conv,
  266. params.t_exp_left,
  267. params.t_exp_right,
  268. params.t_gsw,
  269. params.expand_queries,
  270. params.db_dim_1,
  271. params.db_dim_2,
  272. params.instances,
  273. params.db_item_size,
  274. )
  275. }
  276. pub struct Client<'a> {
  277. params: &'a Params,
  278. sk_gsw: PolyMatrixRaw<'a>,
  279. sk_reg: PolyMatrixRaw<'a>,
  280. sk_gsw_full: PolyMatrixRaw<'a>,
  281. sk_reg_full: PolyMatrixRaw<'a>,
  282. dg: DiscreteGaussian,
  283. pp_seed: Seed,
  284. query_seed: Seed,
  285. }
  286. impl<'a> Client<'a> {
  287. pub fn init(params: &'a Params) -> Self {
  288. let mut root_seed = [0u8; 32];
  289. thread_rng().fill_bytes(&mut root_seed);
  290. Self::init_with_seed_impl(params, root_seed, false)
  291. }
  292. pub fn init_with_seed(params: &'a Params, root_seed: Seed) -> Self {
  293. Self::init_with_seed_impl(params, root_seed, true)
  294. }
  295. fn init_with_seed_impl(params: &'a Params, root_seed: Seed, deterministic: bool) -> Self {
  296. let sk_gsw_dims = params.get_sk_gsw();
  297. let sk_reg_dims = params.get_sk_reg();
  298. let sk_gsw = PolyMatrixRaw::zero(params, sk_gsw_dims.0, sk_gsw_dims.1);
  299. let sk_reg = PolyMatrixRaw::zero(params, sk_reg_dims.0, sk_reg_dims.1);
  300. let sk_gsw_full = matrix_with_identity(&sk_gsw);
  301. let sk_reg_full = matrix_with_identity(&sk_reg);
  302. let mut rng = ChaCha20Rng::from_seed(root_seed);
  303. let mut pp_seed = [0u8; 32];
  304. let mut query_seed = [0u8; 32];
  305. rng.fill_bytes(&mut query_seed);
  306. rng.fill_bytes(&mut pp_seed);
  307. let dg = if deterministic {
  308. DiscreteGaussian::init_with_seed(params, root_seed)
  309. } else {
  310. DiscreteGaussian::init(params)
  311. };
  312. Self {
  313. params,
  314. sk_gsw,
  315. sk_reg,
  316. sk_gsw_full,
  317. sk_reg_full,
  318. dg,
  319. pp_seed,
  320. query_seed,
  321. }
  322. }
  323. #[allow(dead_code)]
  324. pub(crate) fn get_sk_reg(&self) -> &PolyMatrixRaw<'a> {
  325. &self.sk_reg
  326. }
  327. fn get_fresh_gsw_public_key(&self, m: usize, rng: &mut ChaCha20Rng) -> PolyMatrixRaw<'a> {
  328. let params = self.params;
  329. let n = params.n;
  330. let a = PolyMatrixRaw::random_rng(params, 1, m, rng);
  331. let e = PolyMatrixRaw::noise(params, n, m, &self.dg);
  332. let a_inv = -&a;
  333. let b_p = &self.sk_gsw.ntt() * &a.ntt();
  334. let b = &e.ntt() + &b_p;
  335. let p = stack(&a_inv, &b.raw());
  336. p
  337. }
  338. fn get_regev_sample(&self, rng: &mut ChaCha20Rng) -> PolyMatrixNTT<'a> {
  339. let params = self.params;
  340. let a = PolyMatrixRaw::random_rng(params, 1, 1, rng);
  341. let e = PolyMatrixRaw::noise(params, 1, 1, &self.dg);
  342. let b_p = &self.sk_reg.ntt() * &a.ntt();
  343. let b = &e.ntt() + &b_p;
  344. let mut p = PolyMatrixNTT::zero(params, 2, 1);
  345. p.copy_into(&(-&a).ntt(), 0, 0);
  346. p.copy_into(&b, 1, 0);
  347. p
  348. }
  349. fn get_fresh_reg_public_key(&self, m: usize, rng: &mut ChaCha20Rng) -> PolyMatrixNTT<'a> {
  350. let params = self.params;
  351. let mut p = PolyMatrixNTT::zero(params, 2, m);
  352. for i in 0..m {
  353. p.copy_into(&self.get_regev_sample(rng), 0, i);
  354. }
  355. p
  356. }
  357. fn encrypt_matrix_gsw(
  358. &self,
  359. ag: &PolyMatrixNTT<'a>,
  360. rng: &mut ChaCha20Rng,
  361. ) -> PolyMatrixNTT<'a> {
  362. let mx = ag.cols;
  363. let p = self.get_fresh_gsw_public_key(mx, rng);
  364. let res = &(p.ntt()) + &(ag.pad_top(1));
  365. res
  366. }
  367. pub fn encrypt_matrix_reg(
  368. &self,
  369. a: &PolyMatrixNTT<'a>,
  370. rng: &mut ChaCha20Rng,
  371. ) -> PolyMatrixNTT<'a> {
  372. let m = a.cols;
  373. let p = self.get_fresh_reg_public_key(m, rng);
  374. &p + &a.pad_top(1)
  375. }
  376. pub fn decrypt_matrix_reg(&self, a: &PolyMatrixNTT<'a>) -> PolyMatrixNTT<'a> {
  377. &self.sk_reg_full.ntt() * a
  378. }
  379. pub fn decrypt_matrix_gsw(&self, a: &PolyMatrixNTT<'a>) -> PolyMatrixNTT<'a> {
  380. &self.sk_gsw_full.ntt() * a
  381. }
  382. fn generate_expansion_params(
  383. &self,
  384. num_exp: usize,
  385. m_exp: usize,
  386. rng: &mut ChaCha20Rng,
  387. ) -> Vec<PolyMatrixNTT<'a>> {
  388. let params = self.params;
  389. let g_exp = build_gadget(params, 1, m_exp);
  390. let g_exp_ntt = g_exp.ntt();
  391. let mut res = Vec::new();
  392. for i in 0..num_exp {
  393. let t = (params.poly_len / (1 << i)) + 1;
  394. let tau_sk_reg = automorph_alloc(&self.sk_reg, t);
  395. let prod = &tau_sk_reg.ntt() * &g_exp_ntt;
  396. let w_exp_i = self.encrypt_matrix_reg(&prod, rng);
  397. res.push(w_exp_i);
  398. }
  399. res
  400. }
  401. pub fn generate_keys(&mut self) -> PublicParameters<'a> {
  402. let params = self.params;
  403. self.dg.sample_matrix(&mut self.sk_gsw);
  404. self.dg.sample_matrix(&mut self.sk_reg);
  405. self.sk_gsw_full = matrix_with_identity(&self.sk_gsw);
  406. self.sk_reg_full = matrix_with_identity(&self.sk_reg);
  407. let sk_reg_ntt = to_ntt_alloc(&self.sk_reg);
  408. let mut pp = PublicParameters::init(params);
  409. pp.seed = Some(self.pp_seed);
  410. let mut rng = ChaCha20Rng::from_seed(self.pp_seed);
  411. // Params for packing
  412. let gadget_conv = build_gadget(params, 1, params.t_conv);
  413. let gadget_conv_ntt = to_ntt_alloc(&gadget_conv);
  414. for i in 0..params.n {
  415. let scaled = scalar_multiply_alloc(&sk_reg_ntt, &gadget_conv_ntt);
  416. let mut ag = PolyMatrixNTT::zero(params, params.n, params.t_conv);
  417. ag.copy_into(&scaled, i, 0);
  418. let w = self.encrypt_matrix_gsw(&ag, &mut rng);
  419. pp.v_packing.push(w);
  420. }
  421. if params.expand_queries {
  422. // Params for expansion
  423. pp.v_expansion_left =
  424. Some(self.generate_expansion_params(params.g(), params.t_exp_left, &mut rng));
  425. pp.v_expansion_right = Some(self.generate_expansion_params(
  426. params.stop_round() + 1,
  427. params.t_exp_right,
  428. &mut rng,
  429. ));
  430. // Params for converison
  431. let g_conv = build_gadget(params, 2, 2 * params.t_conv);
  432. let sk_reg_ntt = self.sk_reg.ntt();
  433. let sk_reg_squared_ntt = &sk_reg_ntt * &sk_reg_ntt;
  434. pp.v_conversion = Some(Vec::from_iter(once(PolyMatrixNTT::zero(
  435. params,
  436. 2,
  437. 2 * params.t_conv,
  438. ))));
  439. for i in 0..2 * params.t_conv {
  440. let sigma;
  441. if i % 2 == 0 {
  442. let val = g_conv.get_poly(0, i)[0];
  443. sigma = &sk_reg_squared_ntt * &single_poly(params, val).ntt();
  444. } else {
  445. let val = g_conv.get_poly(1, i)[0];
  446. sigma = &sk_reg_ntt * &single_poly(params, val).ntt();
  447. }
  448. let ct = self.encrypt_matrix_reg(&sigma, &mut rng);
  449. pp.v_conversion.as_mut().unwrap()[0].copy_into(&ct, 0, i);
  450. }
  451. }
  452. pp
  453. }
  454. pub fn generate_query(&self, idx_target: usize) -> Query<'a> {
  455. let params = self.params;
  456. let further_dims = params.db_dim_2;
  457. let idx_dim0 = idx_target / (1 << further_dims);
  458. let idx_further = idx_target % (1 << further_dims);
  459. let scale_k = params.modulus / params.pt_modulus;
  460. let bits_per = get_bits_per(params, params.t_gsw);
  461. let mut query = Query::empty();
  462. query.seed = Some(self.query_seed);
  463. let mut rng = ChaCha20Rng::from_seed(self.query_seed);
  464. if params.expand_queries {
  465. // pack query into single ciphertext
  466. let mut sigma = PolyMatrixRaw::zero(params, 1, 1);
  467. let inv_2_g_first = invert_uint_mod(1 << params.g(), params.modulus).unwrap();
  468. let inv_2_g_rest =
  469. invert_uint_mod(1 << (params.stop_round() + 1), params.modulus).unwrap();
  470. if params.db_dim_2 == 0 {
  471. sigma.data[idx_dim0] = scale_k;
  472. for i in 0..params.poly_len {
  473. sigma.data[i] = multiply_uint_mod(sigma.data[i], inv_2_g_first, params.modulus);
  474. }
  475. } else {
  476. sigma.data[2 * idx_dim0] = scale_k;
  477. for i in 0..further_dims as u64 {
  478. let bit: u64 = ((idx_further as u64) & (1 << i)) >> i;
  479. for j in 0..params.t_gsw {
  480. let val = (1u64 << (bits_per * j)) * bit;
  481. let idx = (i as usize) * params.t_gsw + (j as usize);
  482. sigma.data[2 * idx + 1] = val;
  483. }
  484. }
  485. for i in 0..params.poly_len / 2 {
  486. sigma.data[2 * i] =
  487. multiply_uint_mod(sigma.data[2 * i], inv_2_g_first, params.modulus);
  488. sigma.data[2 * i + 1] =
  489. multiply_uint_mod(sigma.data[2 * i + 1], inv_2_g_rest, params.modulus);
  490. }
  491. }
  492. query.ct = Some(from_ntt_alloc(
  493. &self.encrypt_matrix_reg(&to_ntt_alloc(&sigma), &mut rng),
  494. ));
  495. } else {
  496. let num_expanded = 1 << params.db_dim_1;
  497. let mut sigma_v = Vec::<PolyMatrixNTT>::new();
  498. // generate regev ciphertexts
  499. let reg_cts_buf_words = num_expanded * 2 * params.poly_len;
  500. let mut reg_cts_buf = vec![0u64; reg_cts_buf_words];
  501. let mut reg_cts = Vec::<PolyMatrixNTT>::new();
  502. for i in 0..num_expanded {
  503. let value = ((i == idx_dim0) as u64) * scale_k;
  504. let sigma = PolyMatrixRaw::single_value(&params, value);
  505. reg_cts.push(self.encrypt_matrix_reg(&to_ntt_alloc(&sigma), &mut rng));
  506. }
  507. // reorient into server's preferred indexing
  508. reorient_reg_ciphertexts(self.params, reg_cts_buf.as_mut_slice(), &reg_cts);
  509. // generate GSW ciphertexts
  510. for i in 0..further_dims {
  511. let bit = ((idx_further as u64) & (1 << (i as u64))) >> (i as u64);
  512. let mut ct_gsw = PolyMatrixNTT::zero(&params, 2, 2 * params.t_gsw);
  513. for j in 0..params.t_gsw {
  514. let value = (1u64 << (bits_per * j)) * bit;
  515. let sigma = PolyMatrixRaw::single_value(&params, value);
  516. let sigma_ntt = to_ntt_alloc(&sigma);
  517. // important to rng in the right order here
  518. let prod = &to_ntt_alloc(&self.sk_reg) * &sigma_ntt;
  519. let ct = &self.encrypt_matrix_reg(&prod, &mut rng);
  520. ct_gsw.copy_into(ct, 0, 2 * j);
  521. let ct = &self.encrypt_matrix_reg(&sigma_ntt, &mut rng);
  522. ct_gsw.copy_into(ct, 0, 2 * j + 1);
  523. }
  524. sigma_v.push(ct_gsw);
  525. }
  526. query.v_buf = Some(reg_cts_buf);
  527. query.v_ct = Some(sigma_v.iter().map(|x| from_ntt_alloc(x)).collect());
  528. }
  529. query
  530. }
  531. pub fn decode_response(&self, data: &[u8]) -> Vec<u8> {
  532. /*
  533. 0. NTT over q2 the secret key
  534. 1. read first row in q2_bit chunks
  535. 2. read rest in q1_bit chunks
  536. 3. NTT over q2 the first row
  537. 4. Multiply the results of (0) and (3)
  538. 5. Divide and round correctly
  539. */
  540. let params = self.params;
  541. let p = params.pt_modulus;
  542. let p_bits = log2_ceil(params.pt_modulus);
  543. let q1 = 4 * params.pt_modulus;
  544. let q1_bits = log2_ceil(q1) as usize;
  545. let q2 = Q2_VALUES[params.q2_bits as usize];
  546. let q2_bits = params.q2_bits as usize;
  547. let q2_params = params_with_moduli(params, &vec![q2]);
  548. // this only needs to be done during keygen
  549. let mut sk_gsw_q2 = PolyMatrixRaw::zero(&q2_params, params.n, 1);
  550. for i in 0..params.poly_len * params.n {
  551. sk_gsw_q2.data[i] = recenter(self.sk_gsw.data[i], params.modulus, q2);
  552. }
  553. let mut sk_gsw_q2_ntt = PolyMatrixNTT::zero(&q2_params, params.n, 1);
  554. to_ntt(&mut sk_gsw_q2_ntt, &sk_gsw_q2);
  555. let mut result = PolyMatrixRaw::zero(&params, params.instances * params.n, params.n);
  556. let mut bit_offs = 0;
  557. for instance in 0..params.instances {
  558. // this must be done during decoding
  559. let mut first_row = PolyMatrixRaw::zero(&q2_params, 1, params.n);
  560. let mut rest_rows = PolyMatrixRaw::zero(&params, params.n, params.n);
  561. for i in 0..params.n * params.poly_len {
  562. first_row.data[i] = read_arbitrary_bits(data, bit_offs, q2_bits);
  563. bit_offs += q2_bits;
  564. }
  565. for i in 0..params.n * params.n * params.poly_len {
  566. rest_rows.data[i] = read_arbitrary_bits(data, bit_offs, q1_bits);
  567. bit_offs += q1_bits;
  568. }
  569. let mut first_row_q2 = PolyMatrixNTT::zero(&q2_params, 1, params.n);
  570. to_ntt(&mut first_row_q2, &first_row);
  571. let sk_prod = (&sk_gsw_q2_ntt * &first_row_q2).raw();
  572. let q1_i64 = q1 as i64;
  573. let q2_i64 = q2 as i64;
  574. let p_i128 = p as i128;
  575. for i in 0..params.n * params.n * params.poly_len {
  576. let mut val_first = sk_prod.data[i] as i64;
  577. if val_first >= q2_i64 / 2 {
  578. val_first -= q2_i64;
  579. }
  580. let mut val_rest = rest_rows.data[i] as i64;
  581. if val_rest >= q1_i64 / 2 {
  582. val_rest -= q1_i64;
  583. }
  584. let denom = (q2 * (q1 / p)) as i64;
  585. let mut r = val_first * q1_i64;
  586. r += val_rest * q2_i64;
  587. // divide r by q2, rounding
  588. let sign: i64 = if r >= 0 { 1 } else { -1 };
  589. let mut res = ((r + sign * (denom / 2)) as i128) / (denom as i128);
  590. res = (res + (denom as i128 / p_i128) * (p_i128) + 2 * (p_i128)) % (p_i128);
  591. let idx = instance * params.n * params.n * params.poly_len + i;
  592. result.data[idx] = res as u64;
  593. }
  594. }
  595. // println!("{:?}", result.data.as_slice().to_vec());
  596. result.to_vec(p_bits as usize, params.modp_words_per_chunk())
  597. }
  598. }
  599. #[cfg(test)]
  600. mod test {
  601. use super::*;
  602. fn assert_first8(m: &[u64], gold: [u64; 8]) {
  603. let got: [u64; 8] = m[0..8].try_into().unwrap();
  604. assert_eq!(got, gold);
  605. }
  606. fn get_params() -> Params {
  607. get_short_keygen_params()
  608. }
  609. #[test]
  610. fn init_is_correct() {
  611. let params = get_params();
  612. let client = Client::init(&params);
  613. assert_eq!(*client.params, params);
  614. }
  615. #[test]
  616. fn keygen_is_correct() {
  617. let params = get_params();
  618. let mut client = Client::init_with_seed(&params, get_chacha_static_seed());
  619. let pub_params = client.generate_keys();
  620. assert_first8(
  621. pub_params.v_conversion.unwrap()[0].data.as_slice(),
  622. [
  623. 160400272, 10738392, 27480222, 201012452, 42036824, 3955189, 201319389, 181880730,
  624. ],
  625. );
  626. assert_first8(
  627. client.sk_gsw.data.as_slice(),
  628. [
  629. 1,
  630. 66974689739603968,
  631. 4,
  632. 3,
  633. 66974689739603965,
  634. 66974689739603967,
  635. 1,
  636. 0,
  637. ],
  638. );
  639. }
  640. fn get_vec(v: &Vec<PolyMatrixNTT>) -> Vec<u64> {
  641. v.iter().map(|d| d.as_slice().to_vec()).flatten().collect()
  642. }
  643. fn public_parameters_serialization_is_correct_for_params(params: Params) {
  644. let mut client = Client::init_with_seed(&params, get_chacha_static_seed());
  645. let pub_params = client.generate_keys();
  646. let serialized1 = pub_params.serialize();
  647. let deserialized1 = PublicParameters::deserialize(&params, &serialized1);
  648. let serialized2 = deserialized1.serialize();
  649. assert_eq!(serialized1, serialized2);
  650. assert_eq!(
  651. get_vec(&pub_params.v_packing),
  652. get_vec(&deserialized1.v_packing)
  653. );
  654. if pub_params.v_conversion.is_some() {
  655. assert_eq!(
  656. get_vec(&pub_params.v_conversion.unwrap()),
  657. get_vec(&deserialized1.v_conversion.unwrap())
  658. );
  659. }
  660. if pub_params.v_expansion_left.is_some() {
  661. assert_eq!(
  662. get_vec(&pub_params.v_expansion_left.unwrap()),
  663. get_vec(&deserialized1.v_expansion_left.unwrap())
  664. );
  665. }
  666. if pub_params.v_expansion_right.is_some() {
  667. assert_eq!(
  668. get_vec(&pub_params.v_expansion_right.unwrap()),
  669. get_vec(&deserialized1.v_expansion_right.unwrap())
  670. );
  671. }
  672. }
  673. #[test]
  674. fn public_parameters_serialization_is_correct() {
  675. public_parameters_serialization_is_correct_for_params(get_params())
  676. }
  677. #[test]
  678. fn real_public_parameters_serialization_is_correct() {
  679. let cfg_expand = r#"
  680. {'n': 2,
  681. 'nu_1': 10,
  682. 'nu_2': 6,
  683. 'p': 512,
  684. 'q2_bits': 21,
  685. 's_e': 85.83255142749422,
  686. 't_gsw': 10,
  687. 't_conv': 4,
  688. 't_exp_left': 16,
  689. 't_exp_right': 56,
  690. 'instances': 11,
  691. 'db_item_size': 100000 }
  692. "#;
  693. let cfg = cfg_expand.replace("'", "\"");
  694. let params = params_from_json(&cfg);
  695. public_parameters_serialization_is_correct_for_params(params)
  696. }
  697. #[test]
  698. fn no_expansion_public_parameters_serialization_is_correct() {
  699. public_parameters_serialization_is_correct_for_params(get_no_expansion_testing_params())
  700. }
  701. fn query_serialization_is_correct_for_params(params: Params) {
  702. let mut client = Client::init(&params);
  703. _ = client.generate_keys();
  704. let query = client.generate_query(1);
  705. let serialized1 = query.serialize();
  706. let deserialized1 = Query::deserialize(&params, &serialized1);
  707. let serialized2 = deserialized1.serialize();
  708. assert_eq!(serialized1.len(), serialized2.len());
  709. for i in 0..serialized1.len() {
  710. assert_eq!(serialized1[i], serialized2[i], "at {}", i);
  711. }
  712. }
  713. #[test]
  714. fn query_serialization_is_correct() {
  715. query_serialization_is_correct_for_params(get_params())
  716. }
  717. #[test]
  718. fn no_expansion_query_serialization_is_correct() {
  719. query_serialization_is_correct_for_params(get_no_expansion_testing_params())
  720. }
  721. }