Pascal Lafourcade

Material

Lien ADE

How to make a presentation ?

Number	Date	Lecture	Comments	Lecture Notes
1	26th September 2011	Introduction and Probability	SET 1	Notes 1 2009, 2010, 2011
2	26th September 2011	Indistinguishability and Security Notions		Notes 2 2009, 2010, 2011
3	3 th October 2011	Reduction Proofs		Notes 3 2009 2010, 2011
4	3 th October 2011	Hybrid Argument		Notes 4 2009 2010, 2011
5	3 th October 2011	Symmetric Encryption		Notes 5 2009, 2010, 2011
6	24th October 2011	Security of Protocols	SET 2	Notes 6 2009 2010
7	24th October 2011	Passive Intruder		Notes 7 2009 2010 2011
8	7th November 2011	Tools and Applications		Notes 9 2009 2010
9	14th November 2011	SET Tools	No lectures notes this year	Notes 10 2009
10	21 th November 2011	Active Intruder		Notes 8 2009 2010 2011 PARTIAL
11	21th November 2011	Access Control and Non Interference		Notes 11 2009 2010 2011
12	28th November 2011	Link Between Computational and Symbolic	SET 3	Notes 12 2009 2010

3 exercices sessions are planned

• 5th October 2011
• 3th November 2011
• 24 November 2011

Exam 1th December 2011
Mid-unit exam 7th November 2011

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.

LINK TO AVISPA-1.0 LINK TO AVISPA-1.1 Tools used: AVISPA, Hermes, Proverif, Scyther, Xor and DH Proverif.

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

Scripts: install-verif-tools10-11.sh
PATH variable useful for the Computer exercices session:
export PATH=$PATH:$PWD/VeriTools/proverif1.84pl2/
export PATH=$PATH:$PWD/VeriTools/scyther-linux-v1.0-beta9/
export AVISPA_PACKAGE=$PWD/VeriTools/avispa-1.1/
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. Lecture 1, scribes are: Olivier Benjamin, Michel Mera, Jennifer
2. Lecture 2, scribes are: Clementine, Victor-Manuel, Floriane
3. Lecture 3, scribes are: Romain, Kevin
4. Lecture 4, scribes are: Hari, Sultan Ziad
5. Lecture 5, scribes are: Marie-anglela, Maillet Arnaud
6. Lecture 6, scribes are: Alnameh, Ammar
7. Lecture 7, scribes are: Roulet Michael, Fabio Lombardi
8. Lecture 8, scribes are: Braulio Vaello, Thomas TrucVallet
9. Lecture 9, scribes are: No Notes
10. Lecture 10, scribes are: Najm.Z, Ali Kassem
11. Lecture 11, scribes are: Bollo, Scianname
12. Lecture 12, scribes are: Mouloud Ait-Kaci, Bouhachen Hicham

Online References

• Introduction to Probability by Charles M. Grinstead and J. Laurie Snell. 520 pages.
• For background on cryptography, online book: The handbook of applied cryptography by Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone.
• Bellare Rogaway online book Introduction to modern cryptography
• A Computational Introduction to Number Theory and Algebra by Victor Shoup. 517 pages.

Articles in Security to read by group

Defense Friday 25th November Room H1O2:

SESSION 1 : Hash Functions
1. 13h30 - 13h50 : Cryptographic Hash-Function Basics: Definitions, Implications and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance Phillip Rogaway and Thomas Shrimpton. Fast Software Encryption(FSE 2004).
   Najm Zakaria, Bouhachen Hicham, Mouloud (M2P CLOSED)
2. 13h50 - 14h10 : Using Hash Functions as a Hedge against Chosen Ciphertext Attack Victor Shoup EUROCRYPT 2000.
   Oliver Benjamin, Michael Mera (CLOSED M2P)
3. 14h10 - 14h30 : Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate, by Marc Stevens, Alexander Sotirov, Jacob Appelbaum, Arjen Lenstra, David Molnar, Dag Arne Osvik and Benne de Weger.
   Arnaud Maillet (M2R CLOSED)
4. 14h30 - 14h50 : A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness. Emmanuel Bresson, Yassine Lakhnech, Laurent Mazaré, Bogdan Warinschi: CRYPTO 2007: 482-499
   Ling-Jennifer Yip. (M2R CLOSED)
5. 14h50 - 15h10 : Short Group Signatures, by Dan Boneh, Xavier Boyen, Hovav Shacham
   Clementine Gritti (M2R CLOSED)

   ---

   15h10 - 15h30 BREAK
   SESSION 2 : PRACTICAL
6. 15h30 - 15h50Declassification: Dimensions and principles . Andrei Sabelfeld, David Sands: Journal of Computer Security 17(5): 517-548 (2009)
   SULTAN Ziad, ROULET Michael, FABIO LAMBARDI (M2P CLOSED)
7. 15h50 - 16h10 : Cryptography in the Web: The Case of Cryptographic Design Flaws in ASP.NET, by Thai Duong and Juliano Rizzo, in IEEE Symposium on Security and Privacy 2011
   Hari SISWANTORO (M2R closed)
8. 16h10 - 16h30 A multiplicative homomorphic sealed-bid auction based on goldwasser-micali encryption KUN PENG, BOYD Colin and DAWSON Ed. ISC 2005.
   Hild Romain, Truc-Vallet thomas, LAYAT Kevin, VAELLO Brulio (M2P CLOSED)
9. 16h30 - 16h50 On Some Incompatible Properties of Voting Schemes TTE '10 -- 2010 by Benoît Chevallier-Mames, Pierre-Alain Fouque, David Pointcheval, Julien Stern and Jacques Traore
   BOLLO MATTEO, Scianname Liberantanio Pio, Ribeiro Victor Manuel (M2P Closed)
   

   ---

   16h50 - 17h10 : BREAK SESSION 3 :
10. 17h10 - 17h30 : Public-key Encryption in a Multi-User Setting: Security Proofs and Improvements by M. Bellare, A. Boldyreva and S. Micali, EUROCRYPT 2000.
    AL NAMEH Ammar (M2R CLOSED)
11. 17h30 - 17h50 : Encryption Schemes Secure under Selective Opening Attack M. Bellare and S. Yilek. Eurocrypt 2009
    Marie-Angela Cornelie (M2R CLOSED)
12. 17h50 - 18h10 Key-privacy in public-key encryption by M. Bellare, A. Boldyreva, A. Desai and D. Pointcheval, Asiacrypt 2001
    Mouloud Ait-Kaci (M2R closed)
13. 18h10 - 18h30 : Stateful Public-Key Cryptosystems: How to Encrypt with One 160-bit ExponentiationMihir Bellare, Tadayoshi Kohno and Victor Shoup, CCS 2006
    Ali Kassem (M2R Closed)

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.