Toward malicious constant-rate 2PC via arithmetic garbling
From MaRDI portal
Publication:6637552
Recommendations
- New ways to garble arithmetic circuits
- Two-output secure computation with malicious adversaries
- Actively secure garbled circuits with constant communication overhead in the plain model
- Actively secure garbled circuits with constant communication overhead in the plain model
- Actively secure arithmetic computation and VOLE with constant computational overhead
Cites work
- scientific article; zbMATH DE number 1618044 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 4195141 (Why is no real title available?)
- scientific article; zbMATH DE number 1030984 (Why is no real title available?)
- A new approach to practical active-secure two-party computation
- A proof of security of Yao's protocol for two-party computation
- Actively secure garbled circuits with constant communication overhead in the plain model
- Actively secure half-gates with minimum overhead under duplex networks
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Authenticated garbling from simple correlations
- Efficient non-interactive secure computation
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient secure two-party computation using symmetric cut-and-choose
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- Fast distributed RSA key generation for semi-honest and malicious adversaries
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to Garble Arithmetic Circuits
- Improved Garbled Circuit: Free XOR Gates and Applications
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
- New ways to garble arithmetic circuits
- Partial garbling schemes and their applications
- Public Key Cryptography - PKC 2006
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Richer Efficiency/Security Trade-offs in 2PC
- Semi-homomorphic encryption and multiparty computation
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
This page was built for publication: Toward malicious constant-rate 2PC via arithmetic garbling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637552)
