134.pdf
eprint.iacr.org · 9,903 words · saved by 1 readers
N/A
Malicious Security Comes Free in Honest-Majority MPC Vipul Goyal and Yifan Song( ) Carnegie Mellon University, Pittsburgh, USA vipul@cmu.edu, yifans2@andrew.cmu.edu Abstract. We study the communication complexity of unconditionally secure MPC over point-to-point channels for corruption threshold t < n/2. We ask the question: “is it possible to achieve security-with- abort with the same concrete cost as the best-known semi-honest MPC…
related reading
- Secure multi-party computation - Wikipediaen.wikipedia.org
- 189.pdfeprint.iacr.org
- ULin-MPC-proceedings.dviiacr.org
- 535.pdfeprint.iacr.org
- ch3-fundamentalprotocols.pdfsecurecomputation.org
- Faster Secure Two-Party Computation in the Single-Execution Settingeprint.iacr.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- 304.pdfeprint.iacr.org
- A Gentle Introduction to Yao's Garbled Circuitsweb.mit.edu
- Mosaic: Practical Malicious Security for Garbled Circuits on Bitcoineprint.iacr.org
- Collaborative zkSNARKseprint.iacr.org
- A Gentle Introduction to the MPC-in-the-Head Transformation - ZK/SEC Quarterlyblog.zksecurity.xyz