Stronger security for reusable garbled circuits, general definitions and attacks
From MaRDI portal
Publication:1675713
DOI10.1007/978-3-319-63688-7_1zbMath1372.94407OpenAlexW2741191234MaRDI QIDQ1675713
Publication date: 3 November 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-63688-7_1
Learning with Errors (LWE)functional encryption scheme for circuitspredicate encryption for circuitsreusable garbled circuits
Related Items (17)
Adaptive Simulation Security for Inner Product Functional Encryption ⋮ Traitor-tracing from LWE made simple and attribute-based ⋮ Functional encryption for Turing machines with dynamic bounded collusion from LWE ⋮ Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\) ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Dynamic collusion bounded functional encryption from identity-based encryption ⋮ Optimal bounded-collusion secure functional encryption ⋮ (Compact) Adaptively Secure FE for Attribute-Weighted Sums from k-Lin ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ Bounded functional encryption for Turing machines: adaptive security from general assumptions ⋮ A survey on functional encryption ⋮ Compact lattice gadget and its applications to hash-and-sign signatures ⋮ Adaptively simulation-secure attribute-hiding predicate encryption ⋮ Obfustopia built on secret-key functional encryption ⋮ Optimal broadcast encryption from pairings and LWE ⋮ New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts ⋮ A new Gaussian sampling for trapdoor lattices with arbitrary modulus
This page was built for publication: Stronger security for reusable garbled circuits, general definitions and attacks
