Adaptively secure garbled circuits from one-way functions
From MaRDI portal
Publication:2829946
DOI10.1007/978-3-662-53015-3_6zbMATH Open1406.94063OpenAlexW2396662730MaRDI QIDQ2829946FDOQ2829946
Authors: Brett Hemenway, Zahra Jafargholi, Rafail Ostrovsky, Alessandra Scafuro, Daniel Wichs 
Publication date: 9 November 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53015-3_6
Recommendations
Cites Work
- A proof of security of Yao's protocol for two-party computation
- Encoding functions with constant online rate or how to compress garbled circuits keys
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- From secrecy to soundness: efficient verification via secure computation (extended abstract)
- Computationally private randomizing polynomials and their applications
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- Title not available (Why is that?)
- Functional encryption with bounded collusions via multi-party computation
- Reusable garbled circuits and succinct functional encryption
- Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Bounded key-dependent message security
- Adaptively secure garbled circuits from one-way functions
- Key-dependent message security: generic amplification and completeness
- Instantiating random oracles via UCEs
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- Function secret sharing
- On the communication complexity of secure function evaluation with long output
- From selective to adaptive security in functional encryption
- One-Time Programs
- Distributed Point Functions and Their Applications
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
Cited In (40)
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Efficient adaptively secure zero-knowledge from garbled circuits
- Hierarchy for classes of garbling schemes
- A simple construction of iO for Turing machines
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
- Compact NIZKs from standard assumptions on bilinear maps
- Adaptive security of Yao's garbled circuits
- Delegating RAM computations with adaptive soundness and privacy
- Adaptive succinct garbled RAM or: how to delegate your database
- Single-key to multi-key functional encryption with polynomial loss
- Depth-robust graphs and their cumulative memory complexity
- Garbled circuits as randomized encodings of functions: a primer
- Registered (inner-product) functional encryption
- From cryptomania to obfustopia through secret-key functional encryption
- On treewidth, separators and Yao's garbling
- Tri-state circuits. A circuit model that captures RAM
- Streaming functional encryption
- Threshold garbled circuits and ad hoc secure computation
- Limits on the adaptive security of Yao's garbling
- On the Power of Secure Two-Party Computation
- Compact NIZKs from standard assumptions on bilinear maps
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- Combiners for functional encryption, unconditionally
- From FE combiners to secure MPC and back
- From cryptomania to obfustopia through secret-key functional encryption
- Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- Adaptive garbled RAM from laconic oblivious transfer
- Amplifying the security of functional encryption, unconditionally
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
- Unclonable encryption, revisited
- On the power of secure two-party computation
- Adaptively secure garbling with near optimal online complexity
- Adaptively indistinguishable garbled circuits
- The cost of adaptivity in security games on graphs
- Adaptively secure garbled circuits from one-way functions
- Adaptive security of practical garbling schemes
- Adaptively secure garbling schemes for parallel computations
This page was built for publication: Adaptively secure garbled circuits from one-way functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829946)
