Adaptively Secure Garbled Circuits from One-Way Functions
From MaRDI portal
Publication:2829946
DOI10.1007/978-3-662-53015-3_6zbMath1406.94063OpenAlexW2396662730MaRDI QIDQ2829946
Brett Hemenway, Rafail Ostrovsky, Zahra Jafargholi, Daniel Wichs, Alessandra Scafuro
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
Related Items (31)
Limits on the adaptive security of Yao's garbling ⋮ A simple construction of iO for Turing machines ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ 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 ⋮ From Cryptomania to Obfustopia Through Secret-Key Functional Encryption ⋮ Single-Key to Multi-Key Functional Encryption with Polynomial Loss ⋮ Adaptive security of practical garbling schemes ⋮ From cryptomania to obfustopia through secret-key functional encryption ⋮ From FE combiners to secure MPC and back ⋮ Adaptively secure garbling schemes for parallel computations ⋮ Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin ⋮ On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ Tri-state circuits. A circuit model that captures RAM ⋮ Streaming functional encryption ⋮ Unclonable encryption, revisited ⋮ On treewidth, separators and Yao's garbling ⋮ The cost of adaptivity in security games on graphs ⋮ On the power of secure two-party computation ⋮ Combiners for functional encryption, unconditionally ⋮ Compact NIZKs from standard assumptions on bilinear maps ⋮ New constructions of statistical NIZKs: dual-mode DV-NIZKs and more ⋮ Threshold garbled circuits and ad hoc secure computation ⋮ On the Power of Secure Two-Party Computation ⋮ Adaptively Secure Garbled Circuits from One-Way Functions ⋮ Amplifying the security of functional encryption, unconditionally ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Depth-Robust Graphs and Their Cumulative Memory Complexity ⋮ Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
Cites Work
- Unnamed Item
- A proof of security of Yao's protocol for two-party computation
- Computationally private randomizing polynomials and their applications
- Adaptively Secure Garbled Circuits from One-Way Functions
- Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys
- Instantiating Random Oracles via UCEs
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- Function Secret Sharing
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Key-Dependent Message Security: Generic Amplification and Completeness
- Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
- Founding Cryptography on Tamper-Proof Hardware Tokens
- From Selective to Adaptive Security in Functional Encryption
- Bounded Key-Dependent Message Security
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- From Secrecy to Soundness: Efficient Verification via Secure Computation
- One-Time Programs
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Distributed Point Functions and Their Applications
- Reusable garbled circuits and succinct functional encryption
This page was built for publication: Adaptively Secure Garbled Circuits from One-Way Functions
