-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQuery4Handler.cpp
More file actions
406 lines (384 loc) · 12.6 KB
/
Query4Handler.cpp
File metadata and controls
406 lines (384 loc) · 12.6 KB
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
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/*
* File: Query4Handler.cpp
* Author: mahdi
*
* Created on November 24, 2019, 4:29 PM
*/
#include <cstring>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <cmath>
#include <random>
#include <iostream>
#include <fstream>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netdb.h>
#include <string>
#include <chrono>
#include <ctime>
#include <thread>
#include <iomanip>
#include <openssl/bn.h>
#include <openssl/rand.h>
#include "Query4Handler.hpp"
#include "lib.hpp"
using namespace std;
Query4Handler::Query4Handler() {}
Query4Handler::Query4Handler(DBManager* t_DB, const int t_nthreads, const int t_socket, const int t_verbose) :
m_DB(t_DB), m_nthreads(t_nthreads), m_clientSocket(t_socket), m_verbose(t_verbose) {
m_db_buffer = m_DB->getDBbuffer();
m_N = m_DB->getN();
m_M = m_DB->getM();
initializeParameters();
}
Query4Handler::Query4Handler(unsigned char* t_db_buffer, size_t t_N, size_t t_M, int t_nthreads, const int t_socket, const int t_verbose) :
m_db_buffer(t_db_buffer), m_N(t_N), m_M(t_M), m_nthreads(t_nthreads), m_clientSocket(t_socket), m_verbose(t_verbose) {
initializeParameters();
}
int Query4Handler::initializeParameters() {
m_querySize = m_N * K_512 + K_512/8 + 1; // K/8 to send p with the query; last byte for query aggregation
m_p = BN_new();
Q = (uint512 *)malloc(m_N * 256 * sizeof(uint512));
q = (uint512 *)malloc(m_N * 8 * sizeof(uint512));
n = (uint512 *)calloc(m_M, sizeof(uint512));
query_nelems_per_thread = m_N / m_nthreads;
setNbrCharsPerCipher(default_chars_per_ciphertext);
return 0;
}
int Query4Handler::setNbrCharsPerCipher(int t_chars_per_ciphertext) {
chars_per_ciphertext = t_chars_per_ciphertext;
ciphertext_count = m_M/chars_per_ciphertext;
if (m_M % chars_per_ciphertext != 0) ciphertext_count++;
m_replySize = ciphertext_count * K_512/8;
m_reply = (unsigned char*) calloc (m_replySize, sizeof(unsigned char));
res = (BIGNUM **)malloc(ciphertext_count * sizeof(BIGNUM *));
for (size_t i = 0; i < ciphertext_count; i++)
res[i] = BN_new();
reply_nelems_per_thread = m_M / m_nthreads / chars_per_ciphertext * chars_per_ciphertext; // always multiple of files_per_ciphertext
return 0;
}
int Query4Handler::processOneQuery(unsigned char* t_query) {
m_query = t_query;
if (m_query[m_N * K_512 + K_512/8] == 0x1) ; // without query aggregation
else if (m_query[m_N * K_512 + K_512/8] == 0x2) // query aggregation
setNbrCharsPerCipher(1);
else
error("Query4Handler::processOneQuery: Incorrect query aggregation version");
BN_bin2bn(&m_query[m_N*K_512], K_512/8, m_p); // setting p
thread tid[MAXTHREADS];
unsigned int v, myid[MAXTHREADS];
for (v = 0; v < m_nthreads; v++) {
myid[v] = v;
tid[v] = thread(&Query4Handler::expand_sub_query, this, v);
}
for (v = 0; v < m_nthreads; v++)
tid[v].join();
for (v = 0; v < m_nthreads; v++) {
myid[v] = v;
tid[v] = thread(&Query4Handler::process_sub_query, this, v);
}
for (v = 0; v < m_nthreads; v++)
tid[v].join();
return 0;
}
void Query4Handler::expand_sub_query(unsigned int myid) {
size_t start = myid * query_nelems_per_thread;
size_t end = (myid != m_nthreads-1) ? start + query_nelems_per_thread : m_N;
size_t i, j, m, l;
BIGNUM *r, *b;
r = BN_new();
b = BN_new();
for (i = start; i < end; i++) {
for (j = 0; j < 8; j++) {
m = i*8+j;
BN_bin2bn(&m_query[m * K_512/8], K_512/8, r);
BN_copy(b, r);
BN_mask_bits(b, 40);
q[m].a0 = BN_get_word(b);
BN_rshift(b, r, 40);
BN_mask_bits(b, 40);
q[m].a1 = BN_get_word(b);
BN_rshift(b, r, 80);
BN_mask_bits(b, 40);
q[m].a2 = BN_get_word(b);
BN_rshift(b, r, 120);
BN_mask_bits(b, 40);
q[m].a3 = BN_get_word(b);
BN_rshift(b, r, 160);
BN_mask_bits(b, 40);
q[m].a4 = BN_get_word(b);
BN_rshift(b, r, 200);
BN_mask_bits(b, 40);
q[m].a5 = BN_get_word(b);
BN_rshift(b, r, 240);
BN_mask_bits(b, 40);
q[m].a6 = BN_get_word(b);
BN_rshift(b, r, 280);
BN_mask_bits(b, 40);
q[m].a7 = BN_get_word(b);
}
}
m = end << 3;
for (i = start << 3; i < m; i += 8) {
for (j = 0; j < 256; j++) {
l = (i << 5) + j;
memset(&Q[l], 0, sizeof(uint512));
if (j & 0x01) {
Q[l].a0 += q[i].a0;
Q[l].a1 += q[i].a1;
Q[l].a2 += q[i].a2;
Q[l].a3 += q[i].a3;
Q[l].a4 += q[i].a4;
Q[l].a5 += q[i].a5;
Q[l].a6 += q[i].a6;
Q[l].a7 += q[i].a7;
}
if (j & 0x02) {
Q[l].a0 += q[i+1].a0;
Q[l].a1 += q[i+1].a1;
Q[l].a2 += q[i+1].a2;
Q[l].a3 += q[i+1].a3;
Q[l].a4 += q[i+1].a4;
Q[l].a5 += q[i+1].a5;
Q[l].a6 += q[i+1].a6;
Q[l].a7 += q[i+1].a7;
}
if (j & 0x04) {
Q[l].a0 += q[i+2].a0;
Q[l].a1 += q[i+2].a1;
Q[l].a2 += q[i+2].a2;
Q[l].a3 += q[i+2].a3;
Q[l].a4 += q[i+2].a4;
Q[l].a5 += q[i+2].a5;
Q[l].a6 += q[i+2].a6;
Q[l].a7 += q[i+2].a7;
}
if (j & 0x08) {
Q[l].a0 += q[i+3].a0;
Q[l].a1 += q[i+3].a1;
Q[l].a2 += q[i+3].a2;
Q[l].a3 += q[i+3].a3;
Q[l].a4 += q[i+3].a4;
Q[l].a5 += q[i+3].a5;
Q[l].a6 += q[i+3].a6;
Q[l].a7 += q[i+3].a7;
}
if (j & 0x10) {
Q[l].a0 += q[i+4].a0;
Q[l].a1 += q[i+4].a1;
Q[l].a2 += q[i+4].a2;
Q[l].a3 += q[i+4].a3;
Q[l].a4 += q[i+4].a4;
Q[l].a5 += q[i+4].a5;
Q[l].a6 += q[i+4].a6;
Q[l].a7 += q[i+4].a7;
}
if (j & 0x20) {
Q[l].a0 += q[i+5].a0;
Q[l].a1 += q[i+5].a1;
Q[l].a2 += q[i+5].a2;
Q[l].a3 += q[i+5].a3;
Q[l].a4 += q[i+5].a4;
Q[l].a5 += q[i+5].a5;
Q[l].a6 += q[i+5].a6;
Q[l].a7 += q[i+5].a7;
}
if (j & 0x40) {
Q[l].a0 += q[i+6].a0;
Q[l].a1 += q[i+6].a1;
Q[l].a2 += q[i+6].a2;
Q[l].a3 += q[i+6].a3;
Q[l].a4 += q[i+6].a4;
Q[l].a5 += q[i+6].a5;
Q[l].a6 += q[i+6].a6;
Q[l].a7 += q[i+6].a7;
}
if (j & 0x80) {
Q[l].a0 += q[i+7].a0;
Q[l].a1 += q[i+7].a1;
Q[l].a2 += q[i+7].a2;
Q[l].a3 += q[i+7].a3;
Q[l].a4 += q[i+7].a4;
Q[l].a5 += q[i+7].a5;
Q[l].a6 += q[i+7].a6;
Q[l].a7 += q[i+7].a7;
}
}
}
}
void Query4Handler::process_sub_query(unsigned int myid) {
size_t start = myid * reply_nelems_per_thread;
size_t end = (myid != m_nthreads-1) ? start + reply_nelems_per_thread : m_M;
unsigned long long i, j, k, current_ct;
unsigned char *ptr1, *ptr2;
unsigned long long m1, l1, m2, l2, m, l;
unsigned char bn[43];
BIGNUM *temp_res = BN_new();
BN_CTX *ctx = BN_CTX_new();
m = start;
l = m_M<<1;
size_t last_even_N = (m_N%2==0) ? m_N : m_N-1;
for (i = 0; i < last_even_N; i += 2) {
m1 = i << 8;
m2 = m1 + 256;
ptr1 = &m_db_buffer[m];
ptr2 = &m_db_buffer[m+m_M];
for (j = start; j < end; j++) {
l1 = m1 + *(ptr1++);
l2 = m2 + *(ptr2++);
n[j].a0 += Q[l1].a0;
n[j].a1 += Q[l1].a1;
n[j].a2 += Q[l1].a2;
n[j].a3 += Q[l1].a3;
n[j].a4 += Q[l1].a4;
n[j].a5 += Q[l1].a5;
n[j].a6 += Q[l1].a6;
n[j].a7 += Q[l1].a7;
n[j].a0 += Q[l2].a0;
n[j].a1 += Q[l2].a1;
n[j].a2 += Q[l2].a2;
n[j].a3 += Q[l2].a3;
n[j].a4 += Q[l2].a4;
n[j].a5 += Q[l2].a5;
n[j].a6 += Q[l2].a6;
n[j].a7 += Q[l2].a7;
}
m += l;
}
if (m_N%2) {
m1 = i << 8;
m2 = m1 + 256;
ptr1 = (unsigned char *)&m_db_buffer[m];
for (j = start; j < end; j++) {
l1 = m1 + *(ptr1++);
n[j].a0 += Q[l1].a0;
n[j].a1 += Q[l1].a1;
n[j].a2 += Q[l1].a2;
n[j].a3 += Q[l1].a3;
n[j].a4 += Q[l1].a4;
n[j].a5 += Q[l1].a5;
n[j].a6 += Q[l1].a6;
n[j].a7 += Q[l1].a7;
}
m += l;
}
// merge ints and reduce mod p
for (i = start; i+chars_per_ciphertext <= end; i+=chars_per_ciphertext) {
current_ct = i/chars_per_ciphertext;
process_one_char(i, n, bn);
BN_bin2bn(bn, 43, res[current_ct]);
BN_lshift(res[current_ct], res[current_ct], (chars_per_ciphertext-1)*8);
for (k = 1; k < chars_per_ciphertext; k++) {
process_one_char(i+k, n, bn);
BN_bin2bn(bn, 43, temp_res);
BN_lshift(temp_res, temp_res, (chars_per_ciphertext-k-1)*8);
BN_add(res[current_ct], res[current_ct], temp_res);
}
BN_mod(res[current_ct], res[current_ct], m_p, ctx);
bn2binpad(res[current_ct], &m_reply[current_ct*K_512/8], K_512/8);
}
if (i < end) {
current_ct = i/chars_per_ciphertext;
process_one_char(i, n, bn);
BN_bin2bn(bn, 43, res[current_ct]);
BN_lshift(res[current_ct], res[current_ct], (end-i-1)*8);
for (k = 1; i+k < end; k++) {
process_one_char(i+k, n, bn);
BN_bin2bn(bn, 43, temp_res);
BN_lshift(temp_res, temp_res, (end-i-k-1)*8);
BN_add(res[current_ct], res[current_ct], temp_res);
}
BN_mod(res[current_ct], res[current_ct], m_p, ctx);
bn2binpad(res[current_ct], &m_reply[current_ct*K_512/8], K_512/8);
}
}
void Query4Handler::process_one_char(unsigned long long i, uint512 *n, unsigned char *bn) {
unsigned long long j, carry;
unsigned char *nptr, *bptr;
carry = n[i].a0 >> 40;
n[i].a1 += carry;
n[i].a0 &= u40;
carry = n[i].a1 >> 40;
n[i].a2 += carry;
n[i].a1 &= u40;
carry = n[i].a2 >> 40;
n[i].a3 += carry;
n[i].a2 &= u40;
carry = n[i].a3 >> 40;
n[i].a4 += carry;
n[i].a3 &= u40;
carry = n[i].a4 >> 40;
n[i].a5 += carry;
n[i].a4 &= u40;
carry = n[i].a5 >> 40;
n[i].a6 += carry;
n[i].a5 &= u40;
carry = n[i].a6 >> 40;
n[i].a7 += carry;
n[i].a6 &= u40;
bptr = bn;
nptr = ((unsigned char *) &n[i].a7) + 7;
for (j = 0; j < 8; j++) {
memcpy(bptr, nptr, 1);
nptr--;
bptr++;
}
nptr = ((unsigned char *) &n[i].a6) + 4;
for (j = 0; j < 5; j++) {
memcpy(bptr, nptr, 1);
nptr--;
bptr++;
}
nptr = ((unsigned char *) &n[i].a5) + 4;
for (j = 0; j < 5; j++) {
memcpy(bptr, nptr, 1);
nptr--;
bptr++;
}
nptr = ((unsigned char *) &n[i].a4) + 4;
for (j = 0; j < 5; j++) {
memcpy(bptr, nptr, 1);
nptr--;
bptr++;
}
nptr = ((unsigned char *) &n[i].a3) + 4;
for (j = 0; j < 5; j++) {
memcpy(bptr, nptr, 1);
nptr--;
bptr++;
}
nptr = ((unsigned char *) &n[i].a2) + 4;
for (j = 0; j < 5; j++) {
memcpy(bptr, nptr, 1);
nptr--;
bptr++;
}
nptr = ((unsigned char *) &n[i].a1) + 4;
for (j = 0; j < 5; j++) {
memcpy(bptr, nptr, 1);
nptr--;
bptr++;
}
nptr = ((unsigned char *) &n[i].a0) + 4;
for (j = 0; j < 5; j++) {
memcpy(bptr, nptr, 1);
nptr--;
bptr++;
}
}
unsigned char* Query4Handler::getReply() { return m_reply; }
size_t Query4Handler::getReplySize() { return m_replySize; }
size_t Query4Handler::getQuerySize() { return m_querySize; }
Query4Handler::Query4Handler(const Query4Handler& orig) {}
Query4Handler::~Query4Handler() {}