Faster Secure Multi-Party Computation of AES and DES Using Lookup Tables
eprint.iacr.org · 9,230 words · saved by 1 readers
N/A
Faster Secure Multi-Party Computation of AES and DES Using Lookup Tables? Marcel Keller, Emmanuela Orsini, Dragos Rotaru, Peter Scholl, Eduardo Soria-Vazquez, and Srinivas Vivek {m.keller,emmanuela.orsini,dragos.rotaru,peter.scholl, eduardo.soria-vazquez,sv.venkatesh}@bristol.ac.uk Department of Computer Science, University of Bristol Abstract. We present an actively secure protocol for secure multi-party computation based on lookup tables, by extending the recent, two-party ‘TinyTable’…
related reading
- Faster Secure Two-Party Computation in the Single-Execution Settingeprint.iacr.org
- Secure multi-party computation - Wikipediaen.wikipedia.org
- 535.pdfeprint.iacr.org
- A High-Level Technical Overview of Fully Homomorphic Encryption || Math ∩ Programmingjeremykun.com
- ULin-MPC-proceedings.dviiacr.org
- 304.pdfeprint.iacr.org
- ZK-Friendly Hash Functions | Zellic — Researchzellic.io
- 134.pdfeprint.iacr.org
- Collaborative zkSNARKseprint.iacr.org
- Practical Multi-party Private Set Intersection from Symmetric-Key Techniqueseprint.iacr.org
- 370.pdfeprint.iacr.org
- 189.pdfeprint.iacr.org