ULin-MPC-proceedings.dvi
iacr.org · 9,773 words · saved by 1 readers
N/A
Scalable and Unconditionally Secure Multiparty Computation Ivan Damgård and Jesper Buus Nielsen⋆ Dept. of Computer Science, BRICS, Aarhus University Abstract. We present a multiparty computation protocol that is un- conditionally secure against adaptive and active adversaries, with com- munication complexity O(Cn)k + O(Dn2 )k + poly(nκ), where C is the number of gates in the circuit, n is the number of parties, k is the bit- length of the elements of the field over which the computation is…
related reading
- Secure multi-party computation - Wikipediaen.wikipedia.org
- 189.pdfeprint.iacr.org
- 134.pdfeprint.iacr.org
- 535.pdfeprint.iacr.org
- Collaborative zkSNARKseprint.iacr.org
- Faster Secure Two-Party Computation in the Single-Execution Settingeprint.iacr.org
- 370.pdfeprint.iacr.org
- ch3-fundamentalprotocols.pdfsecurecomputation.org
- 304.pdfeprint.iacr.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Unclonable Polymers and Their Cryptographic Applicationseprint.iacr.org
- ants.dvicrypto.stanford.edu