Indistinguishability Obfuscation from Well Founded Assumptions - Part 3

Indistinguishability Obfuscation from Well Founded Assumptions - Part 3

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Intro

1 of 18

1 of 18

Intro

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

Indistinguishability Obfuscation from Well Founded Assumptions - Part 3

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Overall Picture: Continuing From Part-2
  3. 3 Learning Parity with Noise BFKL 93, IPS 09 for some constant 8 € (0,1), and a prime modulus p.
  4. 4 PRGs in NC
  5. 5 What Structure? Computable using Bilinear Maps- Bilinear Maps Friendly.
  6. 6 Implausibility of Degree-2 PRGS BBKK 18, LV 18, BHJKS 19
  7. 7 Turning Point: "Degree-2.5" Integer PRGS A.JS 18, JLMS 19, AILMS 19 Input: An Integer vector
  8. 8 NEW! SPRG Overview Also degree 2.5, but boolean output!
  9. 9 SPRG: Simple Proof
  10. 10 Structured Seed PRG
  11. 11 How to Construct SPRG?
  12. 12 Key Intuition: Sparsity Helps SPRG Components
  13. 13 Correct T Errors (Failed First Attempt)
  14. 14 Problem: Can't Reveal BAD
  15. 15 Example: Correcting One Error
  16. 16 Correcting T =: Errors
  17. 17 Correcting T = Errors
  18. 18 What about Security?

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.