Bitwise garbling schemes. A model with 32 -bit lower bound of ciphertexts
From MaRDI portal
Publication:6863897
Cites work
- \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication
- Actively secure half-gates with minimum overhead under duplex networks
- Authenticated garbling from simple correlations
- Beyond honest majority: the round complexity of fair and robust multi-party computation
- Constant-round private function evaluation with linear complexity
- Flexor: Flexible garbling for XOR gates that beats free-XOR
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
- How to circumvent the two-ciphertext lower bound for linear garbling schemes
- How to hide circuits in MPC an efficient framework for private function evaluation
- Improved Garbled Circuit: Free XOR Gates and Applications
- Non-interactive secure computation based on cut-and-choose
- On the exact round complexity of secure three-party computation
- On the security of the ``Free-XOR technique
- Optimizing authenticated garbling for faster secure two-party computation
- Privacy-free garbled circuits with applications to efficient zero-knowledge
- Secure two-party computation is practical
- Stacked garbling for disjunctive zero-knowledge proofs
- Stacked garbling. Garbled circuit proportional to longest execution path
- 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
This page was built for publication: Bitwise garbling schemes. A model with \(\frac{3}{2}\lambda \)-bit lower bound of ciphertexts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6863897)
