-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathverifier.rs
282 lines (245 loc) · 8.29 KB
/
verifier.rs
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
use crate::ot::mozzarella::cache::verifier::CachedVerifier;
use crate::ot::mozzarella::lpn::LLCode;
use crate::ot::mozzarella::utils::log2;
use crate::ot::mozzarella::{MozzarellaVerifier, MozzarellaVerifierStats};
use crate::Error;
use rand::distributions::{Distribution, Standard};
use rand::{rngs::OsRng, CryptoRng, Rng, SeedableRng};
use rayon::prelude::*;
use scuttlebutt::channel::{Receivable, Sendable};
use scuttlebutt::ring::Ring;
use scuttlebutt::{AbstractChannel, AesRng, Block};
use serde::Serialize;
use std::time::{Duration, Instant};
#[allow(non_snake_case)]
pub struct Verifier<'a, RingT>
where
RingT: Ring + Receivable,
Standard: Distribution<RingT>,
for<'b> &'b RingT: Sendable,
{
k: usize,
statsec: usize,
mozVerifier: MozzarellaVerifier<'a, RingT>,
delta: RingT,
stats: VerifierStats,
is_init_done: bool,
}
#[derive(Copy, Clone, Debug, Default, Serialize)]
pub struct VerifierStats {
pub mozz_init: Duration,
pub linear_comb_time: Duration,
pub mozzarella_stats: MozzarellaVerifierStats,
}
#[allow(non_snake_case)]
impl<'a, RingT: Ring> Verifier<'a, RingT>
where
RingT: Ring + Receivable,
Standard: Distribution<RingT>,
for<'b> &'b RingT: Sendable,
{
pub fn new(
k: usize,
statsec: usize,
cache: CachedVerifier<RingT>,
code: &'a LLCode<RingT>,
base_vole_len: usize,
num_sp_voles: usize,
sp_vole_len: usize,
) -> Self {
assert!(RingT::BIT_LENGTH >= k + 2 * statsec + log2(statsec));
Self {
k,
statsec,
mozVerifier: MozzarellaVerifier::<RingT>::new(
cache,
&code,
base_vole_len,
num_sp_voles,
sp_vole_len,
false,
),
delta: Default::default(),
stats: Default::default(),
is_init_done: false,
}
}
pub fn init<C: AbstractChannel>(&mut self, channel: &mut C, delta: RingT) -> Result<(), Error> {
self.delta = delta;
let t_start = Instant::now();
self.mozVerifier.init(channel, delta)?;
self.stats.mozz_init = t_start.elapsed();
self.is_init_done = true;
Ok(())
}
pub fn apply_to_mozzarella_verifier<ResT, F: FnOnce(&mut MozzarellaVerifier<RingT>) -> ResT>(
&mut self,
f: F,
) -> ResT {
f(&mut self.mozVerifier)
}
pub fn get_stats(&mut self) -> VerifierStats {
// todo: also provide quicksilver stats
self.stats.mozzarella_stats = self.mozVerifier.get_stats();
self.stats
}
pub fn get_run_time_init(&self) -> Duration {
self.stats.mozz_init
}
// The mozVerifier already handles if there aren't any left, in which case it runs extend
pub fn random<C: AbstractChannel>(&mut self, channel: &mut C) -> Result<RingT, Error> {
let y = self.mozVerifier.vole(channel)?;
return Ok(y);
}
pub fn random_batch<C: AbstractChannel>(
&mut self,
channel: &mut C,
n: usize,
) -> Result<Vec<RingT>, Error> {
self.mozVerifier.extend(channel, n)
}
pub fn input<C: AbstractChannel>(&mut self, channel: &mut C) -> Result<RingT, Error> {
// todo: ehm.
let r = self.random(channel)?;
let diff: RingT = channel.receive()?;
let out = r - (diff * self.delta);
Ok(out)
}
pub fn input_batch<C: AbstractChannel>(
&mut self,
channel: &mut C,
n: usize,
) -> Result<Vec<RingT>, Error> {
let mut out = self.random_batch(channel, n)?;
let diff: Vec<RingT> = channel.receive_n(n)?;
for i in 0..n {
out[i] = out[i] - diff[i] * self.delta;
}
Ok(out)
}
pub fn add(&mut self, alpha: RingT, beta: RingT) -> Result<RingT, Error> {
Ok(alpha + beta)
}
pub fn add_batch(&mut self, alpha: &[RingT], beta: &[RingT]) -> Vec<RingT> {
assert_eq!(alpha.len(), beta.len());
let n = alpha.len();
let mut out = vec![RingT::default(); n];
for i in 0..n {
out[i] = alpha[i] + beta[i];
}
out
}
pub fn multiply<C: AbstractChannel>(
&mut self,
channel: &mut C,
(alpha, beta): (RingT, RingT),
) -> Result<(RingT, RingT, RingT), Error> {
let out = self.input(channel)?;
Ok((alpha, beta, out))
}
pub fn multiply_batch<C: AbstractChannel>(
&mut self,
channel: &mut C,
alpha: &[RingT],
beta: &[RingT],
) -> Result<Vec<RingT>, Error> {
assert_eq!(alpha.len(), beta.len());
let n = alpha.len();
self.input_batch(channel, n)
}
pub fn check_multiply_batch<C: AbstractChannel>(
&mut self,
channel: &mut C,
alpha_keys: &[RingT],
beta_keys: &[RingT],
gamma_keys: &[RingT],
// multi_thread: bool,
// chunk_size: usize,
) -> Result<(), Error> {
let n = alpha_keys.len();
assert_eq!(n, beta_keys.len());
assert_eq!(n, gamma_keys.len());
let mut W = RingT::ZERO;
let chi_seed = OsRng.gen::<Block>();
channel.send(&chi_seed)?;
let mut seeded_rng = AesRng::from_seed(chi_seed);
let chis: Vec<RingT> = (0..n).map(|_| seeded_rng.gen()).collect();
let t_start = Instant::now();
for i in 0..n {
let chi_i = chis[i];
let k_alpha = alpha_keys[i];
let k_beta = beta_keys[i];
let k_gamma = gamma_keys[i];
let bi = k_alpha * k_beta + (k_gamma * self.delta);
W += bi * chi_i;
}
let B = self.random(channel)?;
W += B;
self.stats.linear_comb_time = t_start.elapsed();
let U: RingT = channel.receive()?;
let V: RingT = channel.receive()?;
let tmp = U - (V * self.delta);
if W == tmp {
Ok(())
} else {
Err(Error::Other("checkMultiply fails".to_string()))
}
}
pub fn check_multiply<C: AbstractChannel, R: CryptoRng + Rng>(
&mut self,
channel: &mut C,
mut rng: R,
triples: &mut [(RingT, RingT, RingT)],
multi_thread: bool,
chunk_size: usize,
) -> Result<(), Error> {
let mut W = RingT::default();
let seed = rng.gen::<Block>();
channel.send(&seed)?;
let t_start = Instant::now();
let mut seeded_rng = AesRng::from_seed(seed);
println!("Time to create rng: {}", t_start.elapsed().as_millis());
let check_start = Instant::now();
if multi_thread {
let t_start = Instant::now();
println!("Sampling chis: {}", t_start.elapsed().as_millis());
let t_start = Instant::now();
//let mut tmp: Vec<(&RingT, &(RingT, RingT, RingT))> = chis.iter().zip(triples.iter()).collect();
println!("Zipping: {}", t_start.elapsed().as_millis());
let t_start = Instant::now();
W = triples
.par_chunks_exact_mut(chunk_size)
.enumerate()
.map(|(_idx, x)| {
// TODO: An initial seed should be sent from the verifier prior to this
let mut rng = AesRng::from_seed(Block::default());
x.into_iter()
.map(|y| rng.gen::<RingT>() * ((y.0 * y.1) + (y.2 * self.delta)))
.sum()
})
.sum();
println!("Computing sum: {}", t_start.elapsed().as_millis());
} else {
let t_start = Instant::now();
for (x, y, z) in triples.iter() {
let chi = seeded_rng.gen::<RingT>();
let bi = (*x) * (*y) + (*z * self.delta);
W += bi * chi;
}
println!("Computing sum: {}", t_start.elapsed().as_millis());
}
let B = self.random(channel)?;
W += B;
self.stats.linear_comb_time = check_start.elapsed();
let U: RingT = channel.receive()?;
let V: RingT = channel.receive()?;
let tmp = U - (V * self.delta);
if W == tmp {
println!("Check passed");
Ok(())
} else {
println!("Someone lied");
Err(Error::Other("checkMultiply fails".to_string()))
}
}
}