Succinct garbling schemes from functional encryption through a local simulation paradigm

DOI10.1007/978-3-030-03810-6_17zbMath1430.94054OpenAlexW2893633413MaRDI QIDQ1631342

Publication date: 6 December 2018

Full work available at URL: https://doi.org/10.1007/978-3-030-03810-6_17

Related Items (8)

Limits on the adaptive security of Yao's garbling ⋮ A simple construction of iO for Turing machines ⋮ On the optimal succinctness and efficiency of functional encryption and attribute-based encryption ⋮ Bounded functional encryption for Turing machines: adaptive security from general assumptions ⋮ Collusion-resistant functional encryption for RAMs ⋮ Non-interactive universal arguments ⋮ How to use (plain) witness encryption: registered ABE, flexible broadcast, and more ⋮ On treewidth, separators and Yao's garbling

Cites Work

Key-dependent message security: generic amplification and completeness
A proof of security of Yao's protocol for two-party computation
A simple construction of iO for Turing machines
Anonymous IBE, leakage resilience and circular security from new assumptions
Two-round multiparty secure computation from minimal assumptions
$k$-round multiparty computation from $k$-round oblivious transfer via garbled interactive circuits
Adaptively secure garbling with near optimal online complexity
Identity-based encryption from the Diffie-Hellman assumption
Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
Laconic oblivious transfer and its applications
Incremental program obfuscation
Indistinguishability obfuscation for Turing machines: constant overhead and amortization
Adaptively indistinguishable garbled circuits
New constructions of identity-based and key-dependent message secure encryption schemes
Computationally private randomizing polynomials and their applications
Functional Encryption for Turing Machines
Fully Succinct Garbled RAM
Cryptography for Parallel RAM from Indistinguishability Obfuscation
Time-Lock Puzzles from Randomized Encodings
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
Adaptively Secure Garbled Circuits from One-Way Functions
Functional Encryption with Bounded Collusions via Multi-party Computation
Bootstrapping Obfuscators via Fast Pseudorandom Functions
Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
Succinct Randomized Encodings and their Applications
Garbled RAM From One-Way Functions
On the Communication Complexity of Secure Function Evaluation with Long Output
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
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
From Selective to Adaptive Security in Functional Encryption
Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation
Indistinguishability Obfuscation from Compact Functional Encryption
Bounded Key-Dependent Message Security
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
From Secrecy to Soundness: Efficient Verification via Secure Computation
One-Time Programs
Indistinguishability Obfuscation from Functional Encryption
Secure Computation on the Web: Computing without Simultaneous Interaction
How to use indistinguishability obfuscation
Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software
Breaking the Sub-Exponential Barrier in Obfustopia
Garbled RAM Revisited
Reusable garbled circuits and succinct functional encryption
Constrained Pseudorandom Functions for Unconstrained Inputs
Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness

This page was built for publication: Succinct garbling schemes from functional encryption through a local simulation paradigm