Bootstrapping Homomorphic Encryption via Functional Encryption
summary
Claims a method to bootstrap a leveled homomorphic scheme into FHE from semi-compact public-key FE under polynomial assumptions for uniform adversaries and under non-uniform ETH for non-uniform ones. Construction wraps evaluation-key chain entries in increasing-difficulty time-lock puzzles, uses randomized encodings and IO only on circuits with polynomial IO (split into many polynomial-input obfuscated modules), yields only a polynomial number of hybrids and avoids sub-exponential security losses, and proves security via a non-black-box reduction.
AI-written summary · about
chapters (12)
- 0:00Intro
- 0:26Motivation
- 1:20Leveled homomorphic encryption
- 4:34Previous bootstrapping techniques
- 6:53Gentry's bootstrapping (Gentry 2009)
- 9:20Gentry's bootstrapping - continued
- 10:02Gentry's bootstrapping - circular security
- 11:21Avoid circular security via sub exponential primitives (Cannety et al. 2015)
- 13:02Intuition for security proof
- 14:06Caveats: subexponential security
- 16:48Relaxed time-lock puzzles (BGJPVW 2016)
- 20:17Poly FE: 10 security for poly-size input space circuit
related talks
54mFully Homomorphic Encryption
01h 04mFully Homomorphic Encryption II
31mHow to Construct Indistinguishability Obfuscation from Compact Functional Encryption
01h 01mCircularity Based IO, Part 1
01h 07mLattices and Encrypted Computation
20mAugmenting EVMs with FHE to Enable New Use Cases
52mMachine Learning over Encrypted Data with Fully Homomorphic Encryption
47mHomomorphic Encryption