Full-threshold actively-secure multiparty arithmetic circuit garbling
From MaRDI portal
Publication:2146106
DOI10.1007/978-3-030-88238-9_20zbMath1491.94058OpenAlexW3209886391MaRDI QIDQ2146106
Publication date: 15 June 2022
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/667389
Cites Work
- Overdrive: making SPDZ great again
- On multiparty garbling of arithmetic circuits
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- MArBLed circuits: mixing arithmetic and Boolean circuits with active security
- Maliciously secure oblivious linear function evaluation with constant overhead
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- Two Halves Make a Whole
- Semi-homomorphic Encryption and Multiparty Computation
- Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
- Improved Garbled Circuit: Free XOR Gates and Applications
- Secure Two-Party Computation Is Practical
- Advances in Cryptology - CRYPTO 2003
- How to Garble Arithmetic Circuits
- Low cost constant round MPC combining BMR and oblivious transfer
This page was built for publication: Full-threshold actively-secure multiparty arithmetic circuit garbling