Lattices: New Cryptographic Capabilities 2020
2020-03-23..2020-03-27
-- online --
who it's for
lattice cryptographers, obfuscation researchers, functional encryption researchers, homomorphic encryption researchers, theoretical cryptographers, post-quantum cryptographers, cryptanalysis researchers, quantum cryptographers
topics
learning with errors hardness; gadget bit decomposition; GSW homomorphic commitments; multi-key fully homomorphic encryption; spooky encryption and secret sharing; fully secure attribute-based encryption (t-CNF); lockable obfuscation from LWE; indistinguishability obfuscation assumptions; mixed functional encryption and traitor tracing; MPC with pseudorandom correlation generators; preprocessing NIZK and homomorphic signatures; quantum FHE and lattice quantum money
| title | author | length |
|---|---|---|
| Tutorial: Encrypted Computation from Lattices | Hoeteck Wee | 57m |
Fast tutorial on building fully homomorphic encryption from lattices: constructs an LWE-based template where ciphertexts are matrices satisfying T·A ≈ X·T… | ||
| Fully Secure Attribute-Based Encryption for t-CNF from LWE | Rotem Tsabar | 01h 08m |
Presents a concrete construction that achieves fully secure ABE for t‑CNF from LWE by combining a lattice-based selective-IBE backbone (BGG+-style LWE… | ||
| Homomorphic Signatures and Pre-Processing NIZK | David Wu | 01h 07m |
Shows that GSW ciphertexts function as a homomorphic commitment with GSW ciphertext = homomorphic commitment, exposing two concrete homomorphisms: an… | ||
| Obfuscation from Noisy Linear FE | Shweta Agrawal | 01h 05m |
Proposes that noisy linear FE — a symmetric-key FE that outputs X·Y plus bounded, PRG-derived noise — compiles (with a special FHE bootstrap) to… | ||
| Recent Advances on Foundations of Program Obfuscation | Rachel Lin | 38m |
Proposes a route to indistinguishability obfuscation from standard ingredients: LWE plus bilinear maps and homomorphic encryption, using a new degree-2.5 noise… | ||
| Obfuscation III | Aayush Jain | 44m |
Proves a security amplification theorem that turns an S,ε functional‑encryption primitive plus subexponential LWE into a scheme with advantage roughly… | ||
| Obfuscation IV: A New Assumption enabling iO | Amit Sahai | 42m |
Conjectures that invertibility of random low‑constant‑degree polynomial systems over the integers yields iO: sample n variables, n^{1+ε} polynomials with each… | ||
| Cryptanalysis of Candidate Program Obfuscators | Yilei Chen | 01h 04m |
Candidate obfuscators built from branching programs and multilinear encodings yield two concrete breaks: a left-kernel linear algebra attack that collects many… | ||
| Lockable Obfuscation | Venkata Koppula | 01h 03m |
Constructs lockable obfuscation from LWE for compute-and-compare programs: builds an NC^1 obfuscator using GGH15 encodings of permutation branching programs… | ||
| Mixed Functional Encryption: Applications to Traitor Tracing | Rishab Goyal | 01h 18m |
Proposes building traitor tracing from a new primitive called mixed functional encryption with two modes: a weak-secret-mode that supports comparison… | ||
| Hardness of LWE on General Entropic Distributions | Nico Döttling | 47m |
Shows hardness of LWE when the secret comes from a general min-entropy distribution by introducing gentle flooding and a new quantity noise loss (eNOS), which… | ||
| Multi-key FHE and Spooky Encryption | Daniel Wichs | 01h 01m |
Defines multi-key FHE that converts per-user GSW ciphertexts (all reusing a public matrix B) into a single expanded ciphertext under a concatenated secret so… | ||
| MPC with Silent Preprocessing via Pseuodorandom Correlation Generators | Lisa Kohl | 01h 01m |
Shows how to build pseudorandom correlation generators from LPN (and ring/dual-LPN) plus compressed primitives—distributed point functions and puncturable… | ||
| Quantum FHE | Urmila Mahadev | 01h 26m |
Shows a concrete method for a classical client to privately delegate quantum circuits by combining the quantum one-time pad with classical FHE and a reduction… | ||
| Quantum Money based on Lattices | Peter W. Shor | 01h 13m |
Proposal constructs money states as Gaussian superpositions of lattice points centered on dual-lattice serial numbers, created by Gaussian sampling then a… | ||
| nothing matches | ||