Candidate Witness Encryption from Lattice Techniques
summary
Proposes a lattice-based candidate witness encryption built from GGH15 encodings that assigns an LWE secret to each edge and adds per-bit consistency memory cells so inconsistent transcripts are detected; correctness comes from summing output encodings to cancel when a valid witness exists. Security reduces to a new form of evasive LWE assumption (similar to Hotak) and an oracle experiment that limits queries, with a hybrid argument that nonetheless requires many hybrids to handle all evaluation transcripts.
AI-written summary · about
chapters (13)
- 0:00Intro
- 1:01Witness Encryption Garg, Gentry, Sahai, Waters, STOC13
- 6:33Witness Encryption from Branching Programs
- 10:10BP with Consistency Check [CHVW19]
- 13:24Graph-Induced Lattice Encodings (GGH15) [Gentry, Gorbunov, Halevi, TCC15]
- 16:42GGH15 Encodings for Branching Programs
- 19:06Encoding the Consistency-Checking BP
- 23:11Decryption
- 24:05Security - Intuition
- 27:45Security Analysis - GGH15 Example
- 28:31Security Analysis - BP Encoding
- 32:12Security Analysis Define a designated We experiment
- 42:14Security Analysis - Summary
related talks
51mObfuscation via GGH15 Encodings, 10 Years Later
01h 05mSuccinct Randomized Encodings from Lattices
57mLattice Assumptions with Hints: Succinct LWE and its Applications
01h 07mLattices and Encrypted Computation
57mTutorial: Encrypted Computation from Lattices
01h 03mLockable Obfuscation
31mIdentity-Based Encryption
01h 04mThe Mathematics of Lattices II
