535.pdf
eprint.iacr.org · 10,233 words · saved by 1 readers
N/A
Multiparty Computation from Somewhat Homomorphic Encryption Ivan Damgård1 , Valerio Pastro1 , Nigel Smart2 , and Sarah Zakarias1 1 Department of Computer Science, Aarhus University 2 Department of Computer Science, Bristol University Abstract. We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute…
related reading
- Secure multi-party computation - Wikipediaen.wikipedia.org
- ULin-MPC-proceedings.dviiacr.org
- 304.pdfeprint.iacr.org
- Homomorphic encryption - Wikipediaen.wikipedia.org
- A High-Level Technical Overview of Fully Homomorphic Encryption || Math ∩ Programmingjeremykun.com
- 189.pdfeprint.iacr.org
- 134.pdfeprint.iacr.org
- Faster Secure Two-Party Computation in the Single-Execution Settingeprint.iacr.org
- Faster Secure Multi-Party Computation of AES and DES Using Lookup Tableseprint.iacr.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- ch3-fundamentalprotocols.pdfsecurecomputation.org
- Optical Computing for Cryptography: Fully Homomorphic Encryption | by Joseph Wilson | Optalysys | Mediummedium.com