Modern Computational Cryptography

Chapter Contents

1. 4.1.The concrete approach to provable security
2. 4.1.1.Huge numbers
3. 4.1.2.Tiny numbers
4. 4.2.The asymptotic approach to provable security
5. 4.2.1.Polynomial running time
6. 4.2.2.Negligible probabilities
7. 4.2.3.Comparing concrete vs asymptotic
8. 4.3.Indistinguishability
9. 4.3.1.Hybrid proofs using indistinguishability
10. 4.4.The bad-event technique
11. 4.5.Birthday probabilities
12. Exercises
13. Chapter Notes & References

1. Previous Chapter3. ☆ Secret Sharing
2. Next Chapter5. Pseudorandom Generators