Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
From MaRDI portal
Recommendations
- Adaptive security of practical garbling schemes
- Adaptively secure garbling schemes for parallel computations
- Adaptively secure garbled circuits from one-way functions
- Adaptively secure garbling with near optimal online complexity
- Limits on the adaptive security of Yao's garbling
- Adaptive security of Yao's garbled circuits
- Efficient adaptively secure zero-knowledge from garbled circuits
- Efficient one-sided adaptively secure computation
- A punctured programming approach to adaptively secure functional encryption
- On garbling schemes with and without privacy
Cited in
(36)- Adaptively secure garbling with near optimal online complexity
- Adaptively indistinguishable garbled circuits
- Limits on the adaptive security of Yao's garbling
- Adaptive security of practical garbling schemes
- Unclonable polymers and their cryptographic applications
- Distributed (correlation) samplers: how to remove a trusted dealer in one round
- Adaptively secure computation for RAM programs
- Adaptively secure garbling schemes for parallel computations
- Blockchains enable non-interactive MPC
- On treewidth, separators and Yao's garbling
- The cost of adaptivity in security games on graphs
- Functional Encryption for Turing Machines
- Hierarchy for classes of garbling schemes
- High-precision secure computation of satellite collision probabilities
- Adaptively secure garbled circuits from one-way functions
- Reactive garbling: foundation, instantiation, application
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Adaptive security of Yao's garbled circuits
- Adaptive succinct garbled RAM or: how to delegate your database
- One-time programs with limited memory
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Garbled circuits as randomized encodings of functions: a primer
- Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
- Storing and retrieving secrets on a blockchain
- Non-interactive secure 2PC in the offline/online and batch settings
- Minimizing setup in broadcast-optimal two round MPC
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
- One-time programs from commodity hardware
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
- Instantiating the hash-then-evaluate paradigm: strengthening PRFs, PCFs, and OPRFs
- Multiparty garbling from OT with linear scaling and RAM support
- On the adaptive security of Free-XOR-based garbling schemes in the plain model
- Instantiating the hash-then-evaluate paradigm: strengthening PRFs, PCFs, and OPRFs
- Efficient garbled pseudorandom functions and lookup tables from minimal assumption
- Constant-round YOSO MPC without setup
This page was built for publication: Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4911582)
