stoffelcrypto 0.1.0

Asynchronous HoneyBadgerMPC protocols, preprocessing, and arithmetic for Stoffel.
Documentation 
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

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>

#include "../honey_badger_bindings.h"

ShareErrorCode test_create_and_recover_shamir_shares()
{
    struct U256 secret_fr = {{520, 86, 9, 18}};
    struct ShamirShareSlice output_shares;
    uintptr_t id[6] = {1, 2, 3, 4, 5, 6};
    struct UsizeSlice ids = {id, 6};
    // create a single shamir share
    ShamirShare _s = shamir_share_new(secret_fr, 9, 10, Bls12_381Fr);
    free_shamir_share(_s);
    // create an array of shamir shares with provided ids
    ShareErrorCode e = shamir_share_compute_shares(secret_fr, 4, &ids, Bls12_381Fr, &output_shares);
    if (e != ShareSuccess)
    {
        return e;
    }
    // print returned shamir shares
    for (int i = 0; i < output_shares.len; i++)
    {
        ShamirShare share = output_shares.pointer[i];
        ByteSlice bytes = field_ptr_to_bytes(share.share, true);
        U256 u256_share = be_bytes_to_u256(bytes);

	free_bytes_slice(bytes);
        printf("share_id_%zu = [ %llu, %llu, %llu, %llu ]\n",
               share.id,
               u256_share.data[0], u256_share.data[1],
               u256_share.data[2], u256_share.data[3]);
    }

    // recover the original secret with shares
    struct U256 recovered_secret;
    struct U256Slice recovered_coeff;
    e = shamir_share_recover_secret(output_shares, &recovered_secret, &recovered_coeff, Bls12_381Fr);
    if (e != ShareSuccess)
    {
        return e;
    }
    printf("original_secret = [ %llu, %llu, %llu, %llu ]\n",
           secret_fr.data[0], secret_fr.data[1],
           secret_fr.data[2], secret_fr.data[3]);
    printf("recovered_secret = [ %llu, %llu, %llu, %llu ]\n",
           recovered_secret.data[0], recovered_secret.data[1],
           recovered_secret.data[2], recovered_secret.data[3]);
    // coeff[0] == secret
    printf("recovered_coeff[0] = [ %llu, %llu, %llu, %llu ]\n",
           recovered_coeff.pointer[0].data[0], recovered_coeff.pointer[0].data[1],
           recovered_coeff.pointer[0].data[2], recovered_coeff.pointer[0].data[3]);
    int result = memcmp(recovered_secret.data, secret_fr.data, sizeof(uint64_t) * 4);
    assert(result == 0);
    // free the memory of slices in rust
    free_shamir_share_slice(output_shares);
    free_u256_slice(recovered_coeff);

    return ShareSuccess;
}

ShareErrorCode test_create_and_recover_robust_shares()
{
    struct U256 secret_fr = {{3, 3, 22, 22}};
    struct RobustShareSlice output_shares;
    // number of nodes
    uintptr_t n = 6;
    // create a single robust share
    RobustShare _s = robust_share_new(secret_fr, 9, 10, Bls12_381Fr);
    free_robust_share(_s);
    // create an array of shamir shares with provided ids
    ShareErrorCode e = robust_share_compute_shares(secret_fr, 2, n, &output_shares, Bls12_381Fr);
    if (e != ShareSuccess)
    {
        return e;
    }
    // print returned shamir shares
    for (int i = 0; i < output_shares.len; i++)
    {
        RobustShare share = output_shares.pointer[i];
        ByteSlice bytes = field_ptr_to_bytes(share.share, false);
        U256 u256_share = le_bytes_to_u256(bytes);

	free_bytes_slice(bytes);
        printf("share_id_%zu = [ %llu, %llu, %llu, %llu ]\n",
               share.id,
               u256_share.data[0], u256_share.data[1],
               u256_share.data[2], u256_share.data[3]);
    }

    // recover the original secret with shares
    struct U256 recovered_secret;
    struct U256Slice recovered_coeff;
    e = robust_share_recover_secret(output_shares, n, 1, &recovered_secret, &recovered_coeff, Bls12_381Fr);
    if (e != ShareSuccess)
    {
        return e;
    }
    printf("original_secret = [ %llu, %llu, %llu, %llu ]\n",
           secret_fr.data[0], secret_fr.data[1],
           secret_fr.data[2], secret_fr.data[3]);
    printf("recovered_secret = [ %llu, %llu, %llu, %llu ]\n",
           recovered_secret.data[0], recovered_secret.data[1],
           recovered_secret.data[2], recovered_secret.data[3]);
    // coeff[0] == secret
    printf("recovered_coeff[0] = [ %llu, %llu, %llu, %llu ]\n",
           recovered_coeff.pointer[0].data[0], recovered_coeff.pointer[0].data[1],
           recovered_coeff.pointer[0].data[2], recovered_coeff.pointer[0].data[3]);
    int result = memcmp(recovered_secret.data, secret_fr.data, sizeof(uint64_t) * 4);
    assert(result == 0);
    // free the memory of slices in rust
    free_robust_share_slice(output_shares);
    free_u256_slice(recovered_coeff);

    return ShareSuccess;
}

ShareErrorCode test_create_and_recover_non_robust_shares()
{
    struct U256 secret_fr = {{16, 33, 44, 81}};
    struct NonRobustShareSlice output_shares;
    // number of nodes
    uintptr_t n = 6;
    // create a single robust share
    NonRobustShare _s = non_robust_share_new(secret_fr, 9, 10, Bls12_381Fr);
    free_non_robust_share(_s);
    // create an array of shamir shares with provided ids
    ShareErrorCode e = non_robust_share_compute_shares(secret_fr, 5, n, &output_shares, Bls12_381Fr);
    if (e != ShareSuccess)
    {
        return e;
    }
    // print returned shamir shares
    for (int i = 0; i < output_shares.len; i++)
    {
        NonRobustShare share = output_shares.pointer[i];
        ByteSlice bytes = field_ptr_to_bytes(share.share, false);
        U256 u256_share = le_bytes_to_u256(bytes);

	free_bytes_slice(bytes);
        printf("share_id_%zu = [ %llu, %llu, %llu, %llu ]\n",
               share.id,
               u256_share.data[0], u256_share.data[1],
               u256_share.data[2], u256_share.data[3]);
    }

    // recover the original secret with shares
    struct U256 recovered_secret;
    struct U256Slice recovered_coeff;
    e = non_robust_share_recover_secret(output_shares, n, &recovered_secret, &recovered_coeff, Bls12_381Fr);
    if (e != ShareSuccess)
    {
        return e;
    }
    printf("original_secret = [ %llu, %llu, %llu, %llu ]\n",
           secret_fr.data[0], secret_fr.data[1],
           secret_fr.data[2], secret_fr.data[3]);
    printf("recovered_secret = [ %llu, %llu, %llu, %llu ]\n",
           recovered_secret.data[0], recovered_secret.data[1],
           recovered_secret.data[2], recovered_secret.data[3]);
    // coeff[0] == secret
    printf("recovered_coeff[0] = [ %llu, %llu, %llu, %llu ]\n",
           recovered_coeff.pointer[0].data[0], recovered_coeff.pointer[0].data[1],
           recovered_coeff.pointer[0].data[2], recovered_coeff.pointer[0].data[3]);
    int result = memcmp(recovered_secret.data, secret_fr.data, sizeof(uint64_t) * 4);
    assert(result == 0);
    // free the memory of slices in rust
    free_non_robust_share_slice(output_shares);
    free_u256_slice(recovered_coeff);

    return ShareSuccess;
}

int main()
{
    printf("\n================================ shamir share ================================\n\n");
    ShareErrorCode e = test_create_and_recover_shamir_shares();
    if (e != ShareSuccess)
    {
        printf("Error code: %d\n", e);
        return 1;
    }

    printf("\n================================ robust share ================================\n\n");
    e = test_create_and_recover_robust_shares();
    if (e != ShareSuccess)
    {
        printf("Error code: %d\n", e);
        return 1;
    }

    printf("\n================================ non robust share ================================\n\n");
    e = test_create_and_recover_non_robust_shares();
    if (e != ShareSuccess)
    {
        printf("Error code: %d\n", e);
        return 1;
    }
    return 0;
}