Pascal Lafourcade

Presentation and Informations

Security models: proofs, protocols and politics

This unit is one of the common core courses in information systems of the Master Pro 2 Security, Cryptology and information coding. The instructors if this unit are Jean-Louis Roch (jean-louis.roch AT imag.fr), Florent Autreau (florent.autreau AT imag.fr) and myself. Course topics:

Introduction
Indistinguishability
Public Encryption
Symmetric encryption
Security protocols: Symbolic Model and Computational Model
Non-interference Problem
Access Control and Security Policies

I propose some Master Stages on my home page

Coordonnées

Adresse

Pascal Lafourcade
Laboratoire Verimag centre Equation
2, avenue de Vignate
38610 Gières
FRANCE

Bureau	:	CTL1/B4D
Tél	:	+33 (0) 4 56 52 04 14
Mobile	:	+33 (0) 6 83 54 90 70
Fax	:	+33 (0) 4 56 52 03 44
E-mail	:	pascal.lafourcade@imag.fr

Verimag Webmail

Material

Number	Date	Lecture	Exercises	Order	Comments	Lecture Notes
1	20th Septembre 2007	Introduction	Set 1	En/Fr		Notes 1
2	27th Septembre 2007	Indistinguishability	Set 2	Fr/En	Please termine last exercise of Set 2	Notes 2
3	1th October 2007	Public Encryption	Set 3	En/Fr	Typo slide 53, one 1 has to be 0 in the first version, now it is fixed
4	22th October 2007	Symmetric encryption	Set 4	Fr/En	Hint: For Needham Schroeder Attack first message is {A,Na}KI between A and the Intruder	Notes 4
5	5th November 2007	Passive Intruder	Set 5	En/Fr	Ready
6	12th November 2007	Active Intruder	Set 6	Fr/En
7	19th November 2007	Application of Tools (No Slide)	Set 7	En/Fr	In Computers Room
8	26th November 2007	Non-interference, Access Control and Security Policies	Set 8	Fr/En	READY

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-tools.sh setup-system.sh PATH variable useful for the Computer exercices session:
export PATH=\$PATH:.:\$HOME/VeriTools/scyther
export PATH=\$PATH:\$HOME/VeriTools/proverif1.14pl2
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_XX.tex

20th September 2007 scribes are: JAVELA Nathan and LAURENT Adrien
27th September 2007 scribes are: Xu Romain and REMOUD Michael
17th September 2007 scribes are: Nkhida Abdelali
17th September 2007 scribes are: BANIHAMMAD Ahmad and Ihsan Altundag

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.