Breaking the (|C|) barrier on garbled circuit size in the random oracle model
From MaRDI portal
Publication:7443583
Cites work
- (1/ )-rate Boolean garbling scheme from generic groups
- \textsf{BitGC}: garbled circuits with 1 bit per gate
- A unified framework for succinct garbling from homomorphic secret sharing
- Actively secure garbled circuits with constant communication overhead in the plain model
- Actively secure half-gates with minimum overhead under duplex networks
- Amortized complexity of information-theoretically secure MPC revisited
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Attribute-based encryption for circuits of unbounded depth from lattices
- Authenticated BitGC for actively secure rate-one 2PC
- Breaking the 1/ -rate barrier for arithmetic garbling
- Constant-round asynchronous MPC with optimal resilience and linear communication
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Dishonest majority constant-round MPC with linear communication from DDH
- Efficient NIZK arguments with straight-line simulation and extraction
- Flexor: Flexible garbling for XOR gates that beats free-XOR
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Honest majority constant-round MPC with linear communication from one-way functions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Improved Garbled Circuit: Free XOR Gates and Applications
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Laconic function evaluation and applications
- LEGO for Two-Party Secure Computation
- Low cost constant round MPC combining BMR and oblivious transfer
- Lower bounds for garbled circuits from Shannon-type information inequalities
- MiniLEGO: efficient secure two-party computation from general assumptions
- Multiparty garbling from OT with linear scaling and RAM support
- Optimizing authenticated garbling for faster secure two-party computation
- Rate-1 arithmetic garbling from homomorphic secret sharing
- Reusable garbled circuits and succinct functional encryption
- Row reduction techniques for n-party garbling
- Scalable and Unconditionally Secure Multiparty Computation
- Secure two-party computation is practical
- Sharing transformation and dishonest majority MPC with packed secret sharing
- Silent circuit relinearisation: sublinear-size (Boolean and arithmetic) garbled circuits from DCR
- Succinct non-interactive secure computation
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- Towards building scalable constant-round MPC from minimal assumptions via round collapsing
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Unconditional communication-efficient MPC via Hall's marriage theorem
This page was built for publication: Breaking the \(\varOmega (|C|\kappa)\) barrier on garbled circuit size in the random oracle model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443583)