Circularity Based IO, Part 1

on YouTube ↗01h 01m

" summary

Proposes a concrete route from Split‑FHE to exponential IO (XAO): start with an LWE‑based FHE encrypting a circuit, homomorphically evaluate its truth table, key‑switch the result into a linearly homomorphic PKE and publish a small decryption hint that recovers the output. To avoid leaking secret keys the CRS contains encrypted randomness and higher‑bit cancellation (“smudging”), yielding sublinear obfuscations in the CRS model under a circular‑security style assumption; results are theoretical candidates with simulation proofs, not a deployed system.

AI-written summary · about

" chapters (11)

1. 0:00Introduction
2. 1:43Overview
3. 4:00Classification
4. 6:58Schematic summary
5. 12:30Preprocessing
6. 22:23Hint size
7. 23:50Question
8. 37:40Short Public Key
9. 38:23Split Efficiency
10. 47:15Simulation Security
11. 54:18Circularity

" related talks

• 01h 07mLattices and Encrypted ComputationVinod Vaikuntanathan · Lattices: Algorithms, Complexity, and Cryptography Boot Camp 2020
• 41mTalk by Elaine Shi (Carnegie Mellon University)Elaine Shi · Obfuscation
• 36mDiamond iO: Lattice-Based Obfuscation without Bootstrapping from Functional Encryption, toward...Sora Suegami · Obfuscation
• 01h 12mApplications of Obfuscation ICraig Gentry · Cryptography Boot Camp 2015
• 01h 04mLattice-Based Post-Quantum iO from Circular Security with Random Opening AssumptionYao Ching Hsieh · Obfuscation
• 23mBootstrapping Homomorphic Encryption via Functional EncryptionNir Bitansky, Tomer Solomon · ITCS 2023
• 01h 04mFully Homomorphic Encryption IIShai Halevi · Cryptography Boot Camp 2015
• 50mApplications of Obfuscation IICraig Gentry · Cryptography Boot Camp 2015