Pages that link to "Item:Q2120069"
From MaRDI portal
The following pages link to Three halves make a whole? Beating the half-gates lower bound for garbled circuits (Q2120069):
Displaying 10 items.
- \textsc{EpiGRAM}: practical garbled RAM (Q2169989) (← links)
- Garbled circuits with sublinear evaluator (Q2169991) (← links)
- Breaking and fixing garbled circuits when a gate has duplicate input wires (Q6176274) (← links)
- A new approach to garbled circuits (Q6535139) (← links)
- Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption (Q6573661) (← links)
- Breaking the size barrier: universal circuits meet lookup tables (Q6595671) (← links)
- Efficient arithmetic in garbled circuits (Q6637536) (← links)
- Garbled circuit lookup tables with logarithmic number of ciphertexts (Q6637543) (← links)
- Toward malicious constant-rate 2PC via arithmetic garbling (Q6637552) (← links)
- How to garble mixed circuits that combine Boolean and arithmetic computations (Q6637574) (← links)
