Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption
From MaRDI portal
Publication:6573661
DOI10.1007/978-981-97-0942-7_10MaRDI QIDQ6573661
Publication date: 17 July 2024
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer security (68M25)
Cites Work
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- A proof of security of Yao's protocol for two-party computation
- Improvements for gate-hiding garbled circuits
- Secure two-party computation via cut-and-choose oblivious transfer
- Large scale, actively secure computation from LPN and free-XOR garbled circuits
- Threshold garbled circuits and ad hoc secure computation
- Efficient constant-round MPC with identifiable abort and public verifiability
- Stacked garbling. Garbled circuit proportional to longest execution path
- Better concrete security for half-gates garbling (in the multi-instance setting)
- Broadcast-optimal two-round MPC
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- Fast garbling of circuits under standard assumptions
- Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
- FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
- On the Security of the “Free-XOR” Technique
- Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
- Two Halves Make a Whole
- Two-Output Secure Computation with Malicious Adversaries
- Improved Garbled Circuit: Free XOR Gates and Applications
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Secure Two-Party Computation Is Practical
This page was built for publication: Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption
