Mixed Functional Encryption: Applications to Traitor Tracing
summary
Proposes building traitor tracing from a new primitive called mixed functional encryption with two modes: a weak-secret-mode that supports comparison predicates and a limited public-mode (the unity function). Shows traitor tracing by lifting a unity MFE to predicate MFE via attribute‑based encryption, and by instantiating unity MFE from LWE/lockable obfuscation. Introduces lattice tools—enhanced trapdoors with row removal and target switching properties—uses the double‑run trick in proofs, and claims the constructions give succinct, provably traceable schemes under standard assumptions.
AI-written summary · about
chapters (15)
- 0:00Intro
- 3:47Attribute Based Encryption
- 5:40Bounded Collision
- 9:49Algorithm
- 14:11Security
- 18:49Notation
- 20:03Mixed Function Encryption
- 24:46Agenda
- 25:21Problem of Traitor Tracing
- 28:55Traitor Tracing Algorithms
- 35:14Tracing Algorithm
- 46:04Mixed Function Comparisons
- 47:15Mixed Function Reduction Scheme
- 49:04AttributeBased Encryption
- 52:48Proof of correctness
related talks
56miO via Functional Encryption: Techniques and Challenges from LWE
31mHow to Construct Indistinguishability Obfuscation from Compact Functional Encryption
23mBootstrapping Homomorphic Encryption via Functional Encryption
37mAttribute-based and Predicate Encryption
40mTrust No One
54mAttribute-based Encryption for Circuits
01h 07mLattices and Encrypted Computation
36mDiamond iO: Lattice-Based Obfuscation without Bootstrapping from Functional Encryption, toward...