Crypto Engineering - verifying security protocols
- Slides:
- TD:
- TP:
- Past Exams:
- Bibliography:
- Boneh_Shoup(book)
- M. Bellare, A. Desai, D. Pointcheval, P. Rogaway. "Relations Among Notions of Security for Public-Key Encryption Schemes" Theory of Cryptography. Advances in Cryptology 1998 Proceedings, Lecture Notes in Computer Science Vol. 1462.
- Blanchet, Bruno, and David Pointcheval. "Automated security proofs with sequences of games." Advances in Cryptology-CRYPTO 2006. Springer Berlin Heidelberg, 2006. 537-554.
- Rusinowitch, Michaël, and Mathieu Turuani. "Protocol insecurity with a finite number of sessions and composed keys is NP-complete." Theoretical computer science 299.1-3 (2003): 451-475.
- Martin Abadi,Phillip Rogaway. "Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)". nternational Conference on Theoretical Computer Science (IFIP TCS2000), Sendai, Japan, August 2000.
- Micciancio, Daniele, and Bogdan Warinschi. "Soundness of formal encryption in the presence of active adversaries." Theory of Cryptography. Springer Berlin Heidelberg, 2004. 133-151.