Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption
From MaRDI portal
Publication:6573661
Cites work
- A proof of security of Yao's protocol for two-party computation
- Better concrete security for half-gates garbling (in the multi-instance setting)
- Broadcast-optimal two-round MPC
- Efficient constant-round MPC with identifiable abort and public verifiability
- Efficient secure two-party computation using symmetric cut-and-choose
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- Fast garbling of circuits under standard assumptions
- Flexor: Flexible garbling for XOR gates that beats free-XOR
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Improved Garbled Circuit: Free XOR Gates and Applications
- Improvements for gate-hiding garbled circuits
- Large scale, actively secure computation from LPN and free-XOR garbled circuits
- On the security of the ``Free-XOR technique
- Privacy-free garbled circuits with applications to efficient zero-knowledge
- Secure two-party computation is practical
- Secure two-party computation via cut-and-choose oblivious transfer
- Stacked garbling. Garbled circuit proportional to longest execution path
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- Threshold garbled circuits and ad hoc secure computation
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Two-output secure computation with malicious adversaries
This page was built for publication: Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573661)
