Breaking the $\varOmega (|C|\kappa )$ Barrier on Garbled Circuit Size in the Random Oracle Model
- 12 August 2026
- book chapter
- Published by Springer Nature
- p. 561-593
Abstract
No abstract availableKeywords
This publication has 53 references indexed in Scilit:
- Breaking the $1/\lambda $-Rate Barrier for Arithmetic Garbling2025
- Rate-1 Arithmetic Garbling From Homomorphic Secret Sharing2024
- Actively Secure Half-Gates with Minimum Overhead Under Duplex Networks2023
- Efficient NIZK Arguments with Straight-Line Simulation and Extraction2022
- Sharing Transformation and Dishonest Majority MPC with Packed Secret Sharing2022
- Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits2021
- Unconditional Communication-Efficient MPC via Hall’s Marriage Theorem2021
- Succinct Non-interactive Secure Computation2020
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator2005
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems2000