Toward malicious constant-rate 2PC via arithmetic garbling
From MaRDI portal
Publication:6637552
DOI10.1007/978-3-031-58740-5_14MaRDI QIDQ6637552FDOQ6637552
Authors: Carmit Hazay, Yibin Yang 
Publication date: 13 November 2024
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
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A proof of security of Yao's protocol for two-party computation
- Title not available (Why is that?)
- A new approach to practical active-secure two-party computation
- Improved Garbled Circuit: Free XOR Gates and Applications
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Title not available (Why is that?)
- Efficient secure two-party computation using symmetric cut-and-choose
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- Semi-homomorphic encryption and multiparty computation
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- How to Garble Arithmetic Circuits
- Public Key Cryptography - PKC 2006
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast distributed RSA key generation for semi-honest and malicious adversaries
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Efficient non-interactive secure computation
- Partial garbling schemes and their applications
- Actively secure garbled circuits with constant communication overhead in the plain model
- Efficient pseudorandom correlation generators from ring-LPN
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Authenticated garbling from simple correlations
- New ways to garble arithmetic circuits
- Richer Efficiency/Security Trade-offs in 2PC
- Actively secure half-gates with minimum overhead under duplex networks
- Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
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)
