Better concrete security for half-gates garbling (in the multi-instance setting)
From MaRDI portal
Publication:2096549
Recommendations
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- Improvements for gate-hiding garbled circuits
- Fast garbling of circuits under standard assumptions
- How to circumvent the two-ciphertext lower bound for linear garbling schemes
Cites work
- Advances in Cryptology – CRYPTO 2004
- Amortizing Garbled Circuits
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Building indifferentiable compression functions from the PGV compression functions
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
- 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
- Hash-Function Based PRFs: AMAC and Its Multi-User Security
- scientific article; zbMATH DE number 5009203 (Why is no real title available?)
- scientific article; zbMATH DE number 2086712 (Why is no real title available?)
- Improved Garbled Circuit: Free XOR Gates and Applications
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Optimal security proofs for signatures from identification schemes
- Optimally secure block ciphers from ideal primitives
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds
- Secure two-party computation is practical
- Secure two-party computation via cut-and-choose oblivious transfer
- The exact security of digital signatures -- how to sign with RSA and Rabin
- The multi-user security of authenticated encryption: AES-GCM in TLS 1.3
- The “Coefficients H” Technique
- Tight security bounds for key-alternating ciphers
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Two-output secure computation with malicious adversaries
Cited in
(12)- Actively secure half-gates with minimum overhead under duplex networks
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model
- Better security-efficiency trade-offs in permutation-based two-party computation
- Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption
- Zero-knowledge protocols with PVC security: striking the balance between security and efficiency
- Row reduction techniques for n-party garbling
- On the adaptive security of Free-XOR-based garbling schemes in the plain model
- On tweakable correlation robust hashing against key leakages
- Securely instantiating `Half Gates' garbling in the standard model
- Actively secure half-gates with minimum overhead under duplex networks
- BitGC made (more) efficient
- Upper bound on information-theoretic security of permutation-based pseudorandom functions
This page was built for publication: Better concrete security for half-gates garbling (in the multi-instance setting)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096549)
