Faster Secure Two-Party Computation in the Single-Execution Setting
eprint.iacr.org · 9,559 words · saved by 1 readers
N/A
Faster Secure Two-Party Computation in the Single-Execution Setting Xiao Wang1? , Alex J. Malozemoff2?? , and Jonathan Katz1? 1 University of Maryland, USA {wangxiao,jkatz}@cs.umd.edu 2 Galois, USA amaloz@galois.com Abstract. We propose a new protocol for two-party computation, se- cure against malicious adversaries, that is significantly…
related reading
- Secure multi-party computation - Wikipediaen.wikipedia.org
- 134.pdfeprint.iacr.org
- 535.pdfeprint.iacr.org
- ch3-fundamentalprotocols.pdfsecurecomputation.org
- 189.pdfeprint.iacr.org
- ULin-MPC-proceedings.dviiacr.org
- A Gentle Introduction to Yao's Garbled Circuitsweb.mit.edu
- Faster Secure Multi-Party Computation of AES and DES Using Lookup Tableseprint.iacr.org
- Practical Multi-party Private Set Intersection from Symmetric-Key Techniqueseprint.iacr.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- Mosaic: Practical Malicious Security for Garbled Circuits on Bitcoineprint.iacr.org