Candidate witness encryption from lattice techniques

Related Items (6)

Fully adaptive decentralized multi-authority \textsf{ABE} ⋮ Broadcast, trace and revoke with optimal parameters from polynomial hardness ⋮ Multi-authority ABE from lattices without random oracles ⋮ Witness encryption and null-iO from evasive LWE ⋮ How to use (plain) witness encryption: registered ABE, flexible broadcast, and more ⋮ Constant input attribute based (and predicate) encryption from evasive and tensor LWE

Cites Work

Unnamed Item
Unnamed Item
Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
GGH15 beyond permutation branching programs: proofs, attacks, and candidates
Bonsai trees, or how to delegate a lattice basis
Candidate iO from homomorphic encryption schemes
Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification
Candidate obfuscation via oblivious LWE sampling
Matrix PRFs: constructions, attacks, and applications to obfuscation
Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
How to leverage hardness of constant-degree expanding polynomials over \(\mathbb{R}\) to build \(i\mathcal{O}\)
Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
Witness Encryption from Instance Independent Assumptions
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
The vectorization of ITPACK 2C
Trapdoors for hard lattices and new cryptographic constructions
Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
Public-key cryptosystems from the worst-case shortest vector problem
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
Graph-Induced Multilinear Maps from Lattices
Witness encryption and its applications
On lattices, learning with errors, random linear codes, and cryptography
Indistinguishability obfuscation from well-founded assumptions

This page was built for publication: Candidate witness encryption from lattice techniques