How to garble mixed circuits that combine Boolean and arithmetic computations
From MaRDI portal
Recommendations
Cites work
- A generalisation, a simplification and some applications of Paillier's probabilistic public-key system
- Candidate iO from homomorphic encryption schemes
- Fast garbling of circuits under standard assumptions
- Flexor: Flexible garbling for XOR gates that beats free-XOR
- Garbling XOR gates ``for free in the standard model
- How to Garble Arithmetic Circuits
- Improved Garbled Circuit: Free XOR Gates and Applications
- New ways to garble arithmetic circuits
- Public-key cryptosystems based on composite degree residuosity classes
- Secure two-party computation is practical
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
Cited in
(6)- New ways to garble arithmetic circuits
- A unified framework for succinct garbling from homomorphic secret sharing
- Efficient mixed garbling from homomorphic secret sharing and GGM-tree
- Rate-1 arithmetic garbling from homomorphic secret sharing
- \textsf{Zebra}: arithmetic garbled RAM for large words from DCR
- Dishonest majority multi-party arithmetic garbling with constant rate
This page was built for publication: How to garble mixed circuits that combine Boolean and arithmetic computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637574)