Adaptively secure garbled circuits from one-way functions
From MaRDI portal
Recommendations
Cites work
- A proof of security of Yao's protocol for two-party computation
- Adaptively secure garbled circuits from one-way functions
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- Bounded key-dependent message security
- Computationally private randomizing polynomials and their applications
- Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
- Distributed Point Functions and Their Applications
- Encoding functions with constant online rate or how to compress garbled circuits keys
- Founding Cryptography on Tamper-Proof Hardware Tokens
- From secrecy to soundness: efficient verification via secure computation (extended abstract)
- From selective to adaptive security in functional encryption
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Function secret sharing
- Functional encryption with bounded collusions via multi-party computation
- scientific article; zbMATH DE number 1942416 (Why is no real title available?)
- Instantiating random oracles via UCEs
- Key-dependent message security: generic amplification and completeness
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- On the communication complexity of secure function evaluation with long output
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- One-Time Programs
- Reusable garbled circuits and succinct functional encryption
- Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
Cited in
(51)- A simple construction of iO for Turing machines
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Adaptively secure garbling with near optimal online complexity
- Adaptively indistinguishable garbled circuits
- Efficient adaptively secure zero-knowledge from garbled circuits
- 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
- Amplifying the security of functional encryption, unconditionally
- Limits on the adaptive security of Yao's garbling
- 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 power of secure two-party computation
- Unclonable encryption, revisited
- On treewidth, separators and Yao's garbling
- The cost of adaptivity in security games on graphs
- Hierarchy for classes of garbling schemes
- On the Power of Secure Two-Party Computation
- Adaptively secure garbled circuits from one-way functions
- 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
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Garbled circuits as randomized encodings of functions: a primer
- Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
- Depth-robust graphs and their cumulative memory complexity
- 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
- Compact NIZKs from standard assumptions on bilinear maps
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
- Registered (inner-product) functional encryption
- Dynamic bounded-collusion streaming functional encryption from minimal assumptions
- A note on adaptive security in hierarchical identity-based encryption
- On the adaptive security of Free-XOR-based garbling schemes in the plain model
- A simple framework for secure key leasing
- Adaptively secure attribute-based encryption from witness encryption
- The power of NAPs: compressing OR-proofs via collision-resistant hashing
- Registered FE beyond predicates: (attribute-based) linear functions and more
- Fine-grained re-encryptions between different encryption systems
- Efficient garbled pseudorandom functions and lookup tables from minimal assumption
- Adaptively secure streaming functional encryption
- Collusion-resistant quantum secure key leasing beyond decryption
- Adaptive garbled RAM from laconic oblivious transfer
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)
