Marcel Keller

There's a dirty fix for pdfTeX on https://github.com/mkskeller/coloremoji.sty

There is only some code in https://github.com/data61/MP-SPDZ/blob/master/Programs/Source/prf_mimc.mpc and https://github.com/data61/MP-SPDZ/blob/master/Programs/Source/prf_leg.mpc, which are related to https://eprint.iacr.org/2019/397.

24926df includes a proof of concept for SHA-3 with short inputs based on the Keccak-f circuit provided by SCALE-MAMBA.

I can see two easy ways of achieving this: 1. Compute the triples in the online phase and separate out the benchmarking using timers. 2. Just change the fake offline...

> Many thanks, this was very helpful! It seems to me that (2) would not work since ordinary triples are also needed for this protocol, but (1) sounds perfect. That...

In the default configuration yes. `shamir` uses a star-based opening protocol that scales better with the number of parties at the expense of an extra round. There is the option...

It's certainly related but the approach is generic. With any secret sharing scheme you can do reconstruction by sending all shares to one party and then sending the result back...

You cannot mix run-time branching and Python lists. The example will set all values in `y` to 0 independently of the condition. As a general rule, only use `Array` with...

The conditional `@if_e(zeroes[2*i] == 1)` prevents the parallelization, so the multiplication `y[i] * y[2*i]` is executed `size` times consecutively.

A straightforward way at some bandwidth expense is to use `if_else` instead of the `@if_e`: https://mp-spdz.readthedocs.io/en/latest/Compiler.html#Compiler.types.sint.if_else A more involved way saving some bandwidth is to determine a reasonable upper bound...