On the Exact Security of Schnorr-Type Signatures

On the Exact Security of Schnorr-Type Signatures

TheIACR via YouTube Direct link

Simulation of the forger choice of the forgery index

14 of 21

14 of 21

Simulation of the forger choice of the forgery index

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

On the Exact Security of Schnorr-Type Signatures

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

  1. 1 Introduction
  2. 2 Outline
  3. 3 Forger adversary against Schnorr signatures
  4. 4 Extracting discrete logarithms from a forger
  5. 5 Multiple invocations of the forger forking
  6. 6 Success probability of the reduction: the Forking Lemma
  7. 7 The concept of meta-reduction
  8. 8 The One More Discrete Logarithm (OMDL) problem
  9. 9 Restriction to algebraic reductions
  10. 10 Meta-reduction main idea
  11. 11 Meta-reduction: the general strategy
  12. 12 Extraction of DLog(A) by the meta-reduction
  13. 13 A bad event which makes the meta-reduction fail
  14. 14 Simulation of the forger choice of the forgery index
  15. 15 Main theorem
  16. 16 A thought experiment
  17. 17 The new meta-reduction
  18. 18 Probability of event Bad
  19. 19 Expected-time and queries forgers
  20. 20 Extensions
  21. 21 Conclusion

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.