Pascal Lafourcade

Material

Number	Date	Lecture	Exercises	Order	Comments	Lecture Notes
1	29th September 2008	Introduction	Set 1	En/Fr	DONE: 1,2,9	Notes 1
2	6th OctoberSeptembre 2008	Indistinguishability	Set 2	Fr/En	DONE: 1,2 TODO: 3, 4, 5	Notes 2
3	10th October 2008	Public Encryption	Set 3	En/Fr	NEXT: Continuous Control 30 minutes D117	Notes 3
4	13th October 2008	Symmetric encryption	Set 4	Fr/En		Notes 4
5	17th October 2008	Passive Intruder	Set 5	En/Fr	D117	Notes 5
6	10th November 2008	Active Intruder	Set 6	Fr/En		Notes 6
7	17th November 2008	Application of Tools (No Slide)	Set 7	En/Fr	In Computers Room	Notes 7
8	24th November 2008	Non-interference, Access Control and Security Policies	Set 8	Fr/En		Notes 8
9	1th December 2008	Link between Computational and Symbolic World	See the slides	Fr/En		Notes 9

Slides of the other lectures will be available as soon as possible.
Notes are written by students and reflect how they follow the lecture, they are not always complete.

Tools used: AVISPA, Hermes, Proverif, Scyther.

Material for practice session in Computer Room: protocol1.spdl, protocol2.spdl, needham.horn.

Scripts: install-verif-tools08-09.sh PATH variable useful for the Computer exercices session:
export PATH=$PATH:.:$HOME/VeriTools/scyther
export PATH=$PATH:.:$HOME/VeriTools/proverif1.15
export AVISPA_PACKAGE=$HOME/VeriTools/avispa-1.0
export PATH=$PATH:$AVISPA_PACKAGE

Lectures Notes

Empty.tex is a LaTex file that you have to use for the notes of the lecture to have some uniformity.
PLEASE NAME YOUR FILE : Lecture_Note_08_XX.tex

1. 29th September 2008 scribes are: Melanie Faure, Charles Guillemet and Jan Stijohann
2. 6th October 2008 scribes are: Thomas Stalinski, Marc Bertemes and Calderon thomas
3. 10th October 2008 scribes are: Yousuf Salami, Majid Khonji and Hamad alShehhi
4. 13th October 2008 scribes are: Samah Alzaabi, Mariam Baniabdalsalam and Sumeya Banjabdalsalam
5. 17th October 2008 scribes are: Nicolas Garro, Amael Grevin and Frédéric Yhuel
6. 10th November 2008 scribes are: Teresa Siso Nadal and Antonio Soriano Saura, M'Hammed Lahia
7. 17th November 2008 scribes are: Alban Daumer, Eric Bourre
8. 24th November 2008 scribes are: Alkhanbashi Khaled, Asem Saeedi, Alhajri Hajer
9. 1th December 2008 scribes are: Abel Aymen, Pere Manils, Vayssiere Bastien

Online References

• Introduction to Probability by Charles M. Grinstead and J. Laurie Snell. 520 pages.
• A Computational Introduction to Number Theory and Algebra by Victor Shoup. 517 pages.

References for LaTex

List of useful material to use LaTex

• Essential LaTeX ++ by Jon Warbrick, David Carlisle, Michel Goossens, Sebastian Rahtz, and Adrian Clark. 27 pages.
• The Not So Short Introduction to LaTeX2e by Tobias Oetiker, Hubert Partl, Irene Hyna, Elisabeth Schlegl. 101 pages
• A simplified introduction to LaTex, in english. 140 pages, well writen many details and examples.
• List of math symbols in LaTeX. Only 6 pages of basics LaTex symbols in mathematics. Indispensable.
• Complete list of symbols , by Scott Pakin. Very indispensable.
• Small Introdutcion to LaTex by Nicolas Markey in French. 60 pages well written for simple and nice things.
• Joli manuel pour LaTeX by Benjamin Bayart in French. 150 pages with many details and very usefull.
• Reference card for Emacs.

If you use Linux please use Ispell to avoid typos in your file.

Articles in Security

• Relations Among Notions of Security for Public-Key Encryption Schemes Crypto'98 by Mihir Bellare, Anand Desai, David Pointcheval and Phillip Rogaway
• Sequences of Games: A Tool for Taming Complexity in Security Proofs, 2004, by Victor Shoup.
• On the Security Notions for Public-Key Encryption Schemes SCN '04, by Duong Hieu Phan and David Pointcheval.
• Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption) 2000, by Martín Abadi, Phillip Rogaway in IFIP International Conference on Theoretical Computer Science (IFIP TCS2000)
• Protocol insecurity with finite number of sessions is NP-complete. M. Rusinowitch and M. Turuani. In Proc. 14th IEEE Computer Security Foundations Workshop, pages 174-190, 2001.
• Constraint solving for bounded process cryptographic protocol analysis. J. Millen and V. Shmatikov. In Proc. 8th ACM Conference on Computer and Communications Security (CCS'01), pages 166-175, 2001.
• Automatic recognition of tractability in inference relations. D. McAllester. Journal ACM, 40(2):284-303, 1993.
• On the security of public key protocols. D. Dolev and A. Yao. IEEE Transactions on Information Theory, 29(2):198\u2013 208, 1983.
• Undecidability of bounded security protocols. N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. In Proc. Workshop on formal methods in security protocols, Trento, Italy, 1999.
• Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or. S. Delaune, P. Lafourcade, D. Lugiez and R. Treinen. In Michele Buglesi, Bart Preneel, Vladimiro Sassone and Ingo Wegener (eds.), Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP'06) - Part II, Venice, Italy, July 2006, Lecture Notes in Computer Science 4052, pages 132-143. Springer.
• Intruder Deduction for the Equational Theory of Abelian Groups with Distributive Encryption. P. Lafourcade, D. Lugiez and R. Treinen. Information and Computation 205(4), pages 581-623, 2007. Intruder Deduction for AC-like Equational Theories with Homomorphisms. P. Lafourcade, D. Lugiez and R. Treinen. In Juergen Giesl (ed.), Proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA'05), Nara, Japan, April 2005, Lecture Notes in Computer Science 3467, pages 308-322. Springer.
• French lecture notes by Véronique Cortier.