-
Notifications
You must be signed in to change notification settings - Fork 48
/
Copy pathpicnic_types.c
370 lines (309 loc) · 10.6 KB
/
picnic_types.c
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
/*! @file picnic_types.c
* @brief Functions to allocate/free data types used in the Picnic signature
* scheme implementation.
*
* This file is part of the reference implementation of the Picnic signature scheme.
* See the accompanying documentation for complete details.
*
* The code is provided under the MIT license, see LICENSE for
* more details.
* SPDX-License-Identifier: MIT
*/
#include "picnic_types.h"
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <assert.h>
shares_t* allocateShares(size_t count)
{
shares_t* shares = malloc(sizeof(shares_t));
shares->shares = calloc(count, sizeof(uint16_t));
shares->numWords = count;
return shares;
}
void freeShares(shares_t* shares)
{
free(shares->shares);
free(shares);
}
/* Allocate/free functions for dynamically sized types */
void allocateView(view_t* view, paramset_t* params)
{
view->inputShare = calloc(params->stateSizeBytes, 1);
view->communicatedBits = calloc(params->andSizeBytes, 1);
view->outputShare = calloc(params->stateSizeBytes, 1);
}
void freeView(view_t* view)
{
free(view->inputShare);
free(view->communicatedBits);
free(view->outputShare);
}
size_t getTapeSizeBytes(const paramset_t* params)
{
return 2*params->andSizeBytes;
}
void allocateRandomTape(randomTape_t* tape, paramset_t* params)
{
tape->nTapes = params->numMPCParties;
tape->tape = malloc(tape->nTapes * sizeof(uint8_t*));
size_t tapeSizeBytes = getTapeSizeBytes(params);
uint8_t* slab = calloc(1, tape->nTapes * tapeSizeBytes);
for (uint8_t i = 0; i < tape->nTapes; i++) {
tape->tape[i] = slab;
slab += tapeSizeBytes;
}
tape->pos = 0;
}
void freeRandomTape(randomTape_t* tape)
{
if (tape != NULL) {
free(tape->tape[0]);
free(tape->tape);
}
}
void allocateProof2(proof2_t* proof, paramset_t* params)
{
memset(proof, 0, sizeof(proof2_t));
proof->seedInfo = NULL; // Sign/verify code sets it
proof->seedInfoLen = 0;
proof->C = malloc(params->digestSizeBytes);
proof->input = calloc(1, params->stateSizeBytes);
proof->aux = calloc(1, params->andSizeBytes);
proof->msgs = calloc(1, params->andSizeBytes);
}
void freeProof2(proof2_t* proof)
{
free(proof->seedInfo);
free(proof->C);
free(proof->input);
free(proof->aux);
free(proof->msgs);
}
void allocateProof(proof_t* proof, paramset_t* params)
{
proof->seed1 = malloc(params->seedSizeBytes);
proof->seed2 = malloc(params->seedSizeBytes);
proof->inputShare = malloc(params->stateSizeBytes);
proof->communicatedBits = malloc(params->andSizeBytes);
proof->view3Commitment = malloc(params->digestSizeBytes);
if (params->UnruhGWithInputBytes > 0) {
proof->view3UnruhG = malloc(params->UnruhGWithInputBytes);
}
else {
proof->view3UnruhG = NULL;
}
}
void freeProof(proof_t* proof)
{
free(proof->seed1);
free(proof->seed2);
free(proof->inputShare);
free(proof->communicatedBits);
free(proof->view3Commitment);
free(proof->view3UnruhG);
}
void allocateSignature(signature_t* sig, paramset_t* params)
{
sig->proofs = (proof_t*)malloc(params->numMPCRounds * sizeof(proof_t));
for (size_t i = 0; i < params->numMPCRounds; i++) {
allocateProof(&(sig->proofs[i]), params);
}
sig->challengeBits = (uint8_t*)malloc(numBytes(2 * params->numMPCRounds));
sig->salt = (uint8_t*)malloc(params->saltSizeBytes);
}
void freeSignature(signature_t* sig, paramset_t* params)
{
for (size_t i = 0; i < params->numMPCRounds; i++) {
freeProof(&(sig->proofs[i]));
}
free(sig->proofs);
free(sig->challengeBits);
free(sig->salt);
}
void allocateSignature2(signature2_t* sig, paramset_t* params)
{
sig->salt = (uint8_t*)malloc(params->saltSizeBytes);
sig->iSeedInfo = NULL;
sig->iSeedInfoLen = 0;
sig->cvInfo = NULL; // Sign/verify code sets it
sig->cvInfoLen = 0;
sig->challengeC = (uint16_t*)malloc(params->numOpenedRounds * sizeof(uint16_t));
sig->challengeP = (uint16_t*)malloc(params->numOpenedRounds * sizeof(uint16_t));
sig->challengeHash = (uint8_t*)malloc(params->digestSizeBytes);
sig->proofs = calloc(params->numMPCRounds, sizeof(proof2_t));
// Individual proofs are allocated during signature generation, only for rounds when neeeded
}
void freeSignature2(signature2_t* sig, paramset_t* params)
{
free(sig->salt);
free(sig->iSeedInfo);
free(sig->cvInfo);
free(sig->challengeC);
free(sig->challengeP);
free(sig->challengeHash);
for (size_t i = 0; i < params->numMPCRounds; i++) {
freeProof2(&sig->proofs[i]);
}
free(sig->proofs);
}
seeds_t* allocateSeeds(paramset_t* params)
{
seeds_t* seeds = malloc((params->numMPCRounds + 1) * sizeof(seeds_t));
size_t nSeeds = params->numMPCParties;
uint8_t* slab1 = malloc((params->numMPCRounds * nSeeds) * params->seedSizeBytes + params->saltSizeBytes); // Seeds
uint8_t* slab2 = malloc(params->numMPCRounds * nSeeds * sizeof(uint8_t*) + sizeof(uint8_t*) + params->numMPCRounds * sizeof(uint8_t*) ); // pointers to seeds
uint8_t* slab3 = malloc((params->numMPCRounds) * params->seedSizeBytes + params->saltSizeBytes); // iSeeds, used to derive seeds
// We need multiple slabs here, because the seeds are generated with one call to the KDF;
// they must be stored contiguously
for (uint32_t i = 0; i < params->numMPCRounds; i++) {
seeds[i].seed = (uint8_t**)slab2;
slab2 += nSeeds * sizeof(uint8_t*);
seeds[i].iSeed = slab3;
slab3 += params->seedSizeBytes;
for (uint32_t j = 0; j < nSeeds; j++) {
seeds[i].seed[j] = slab1;
slab1 += params->seedSizeBytes;
}
}
// The salt is the last seed value
// Accessed by seeds[params->numMPCRounds].iSeed
seeds[params->numMPCRounds].seed = NULL;
if (params->numMPCParties == 3) {
seeds[params->numMPCRounds].iSeed = slab1; // For ZKB parameter sets, the salt must be derived with the seeds
}
else {
seeds[params->numMPCRounds].iSeed = slab3; // For Pincic2 paramter sets, the salt is dervied with the initial seeds
}
return seeds;
}
void freeSeeds(seeds_t* seeds)
{
free(seeds[0].seed[0]); // Frees slab1
free(seeds[0].iSeed); // Frees slab3
free(seeds[0].seed); // frees slab2
free(seeds);
}
commitments_t* allocateCommitments(paramset_t* params, size_t numCommitments)
{
commitments_t* commitments = malloc(params->numMPCRounds * sizeof(commitments_t));
commitments->nCommitments = (numCommitments) ? numCommitments : params->numMPCParties;
uint8_t* slab = malloc(params->numMPCRounds * (commitments->nCommitments * params->digestSizeBytes +
commitments->nCommitments * sizeof(uint8_t*)) );
for (uint32_t i = 0; i < params->numMPCRounds; i++) {
commitments[i].hashes = (uint8_t**)slab;
slab += commitments->nCommitments * sizeof(uint8_t*);
for (uint32_t j = 0; j < commitments->nCommitments; j++) {
commitments[i].hashes[j] = slab;
slab += params->digestSizeBytes;
}
}
return commitments;
}
void freeCommitments(commitments_t* commitments)
{
free(commitments[0].hashes);
free(commitments);
}
/* Allocate one commitments_t object with capacity for numCommitments values */
void allocateCommitments2(commitments_t* commitments, paramset_t* params, size_t numCommitments)
{
commitments->nCommitments = numCommitments;
uint8_t* slab = malloc(numCommitments * params->digestSizeBytes + numCommitments * sizeof(uint8_t*));
commitments->hashes = (uint8_t**)slab;
slab += numCommitments * sizeof(uint8_t*);
for (size_t i = 0; i < numCommitments; i++) {
commitments->hashes[i] = slab;
slab += params->digestSizeBytes;
}
}
void freeCommitments2(commitments_t* commitments)
{
if (commitments != NULL) {
if(commitments->hashes != NULL) {
free(commitments->hashes);
}
}
}
inputs_t allocateInputs(paramset_t* params)
{
uint8_t* slab = calloc(1, params->numMPCRounds * (params->stateSizeWords*sizeof(uint32_t) + sizeof(uint8_t*)));
inputs_t inputs = (uint8_t**)slab;
slab += params->numMPCRounds * sizeof(uint8_t*);
for (uint32_t i = 0; i < params->numMPCRounds; i++) {
inputs[i] = (uint8_t*)slab;
slab += params->stateSizeWords * sizeof(uint32_t);
}
return inputs;
}
void freeInputs(inputs_t inputs)
{
free(inputs);
}
msgs_t* allocateMsgs(paramset_t* params)
{
msgs_t* msgs = malloc(params->numMPCRounds * sizeof(msgs_t));
size_t msgsSize = params->andSizeBytes;
uint8_t* slab = calloc(1, params->numMPCRounds * (params->numMPCParties * msgsSize +
params->numMPCParties * sizeof(uint8_t*)));
for (uint32_t i = 0; i < params->numMPCRounds; i++) {
msgs[i].pos = 0;
msgs[i].unopened = -1;
msgs[i].msgs = (uint8_t**)slab;
slab += params->numMPCParties * sizeof(uint8_t*);
for (uint32_t j = 0; j < params->numMPCParties; j++) {
msgs[i].msgs[j] = slab;
slab += msgsSize;
}
}
return msgs;
}
void freeMsgs(msgs_t* msgs)
{
free(msgs[0].msgs);
free(msgs);
}
view_t** allocateViews(paramset_t* params)
{
// 3 views per round
view_t** views = malloc(params->numMPCRounds * sizeof(view_t *));
for (size_t i = 0; i < params->numMPCRounds; i++) {
views[i] = calloc(3, sizeof(view_t));
for (size_t j = 0; j < 3; j++) {
allocateView(&views[i][j], params);
}
}
return views;
}
void freeViews(view_t** views, paramset_t* params)
{
for (size_t i = 0; i < params->numMPCRounds; i++) {
for (size_t j = 0; j < 3; j++) {
freeView(&views[i][j]);
}
free(views[i]);
}
free(views);
}
g_commitments_t* allocateGCommitments(paramset_t* params)
{
g_commitments_t* gs = NULL;
if (params->transform == TRANSFORM_UR) {
gs = malloc(params->numMPCRounds * sizeof(g_commitments_t));
uint8_t* slab = malloc(params->UnruhGWithInputBytes * params->numMPCRounds * 3);
for (uint32_t i = 0; i < params->numMPCRounds; i++) {
for (uint8_t j = 0; j < 3; j++) {
gs[i].G[j] = slab;
slab += params->UnruhGWithInputBytes;
}
}
}
return gs;
}
void freeGCommitments(g_commitments_t* gs)
{
if (gs != NULL) {
free(gs[0].G[0]);
free(gs);
}
}