[General Information]
[Course description]
[Course Organization]
[Schedule]
[Background]
[OIS]
THIS PAGE IS NOT READY YET. COME BACK LATER
Focus for 2006: This seminar will not have a very concrete focus. Instead, we will look at recent developments in cryptography that should be in the curriculum (Crypto I/II) but are not "there yet". I generally assume that students have taken some course on cryptography.
Fastest way: use OIS. If you are not from your university (and thus do not have an account at OIS), or you were too late to register on OIS, then please send an email to the professor by 15 September 2005 with the following information (it is not mandatory, but useful in getting to know your background):
This additional information is not needed if you have participated in Lipmaa's seminars before. Still, please send an email unless you register by OIS.
Registered students (contact us or register in OIS if your name is not here): XXX.
For most of the topics, browse the corresponding section of Helger's Cryptopointers to find links to papers, surveys etc.
Goal: study the recent attacks by Wang, etc. Study whether collision-resistancy is needed in real life. /* Possibly two different topics */
Warning: Attacks by Wang part is not easy.
Goal: study some existing PPDM methods (primarily cryptographic techniques).
Assume Kostya's seminar from previous semester as a prerequisite. See seminar in Finland (2003) with a lot of links. Helger's cryptopointers on PPDM.
Goal: Survey some of the secure systems; show what kind of security is possible or impossible to achieve. Show that the Estonian e-voting systems are not secure even in the sense of possible goals.
Goal: Survey some of the secure systems; compare some existing protocols (Naor-Pinkas-Sumner, Lipmaa-Asokan-Niemi, ...).
Goal: survey some papers. (Basing on the seminar of the last semester.)
Goal: Study the links at http://www.wisdom.weizmann.ac.il/~tromer/cryptodev/, and write an overview/comparison. How do those devices effect the security of AES? RSA? Elliptic curve cryptosystems?
Goal: study the paper Short signaturs without random oracles.
One topic proposed by Peeter Laud:
Goal: to study the papers. For MSc thesis --- extend them.
Papers:
Martin Abadi, Phillip Rogaway. Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption). Journal of Cryptology 15, 2 (2002), 103-127.
Daniele Micciancio, Saurabh Panjwani: Adaptive Security of Symbolic Encryption. Theory of Cryptography Conference 2005: 169-187
Daniele Micciancio, Bogdan Warinschi: Soundness of Formal Encryption in the Presence of Active Adversaries. Theory of Cryptography Conference 2004: 133-151
Véronique Cortier, Bogdan Warinschi: Computationally Sound, Automated Proofs for Security Protocols. European Symposium On Programming 2005: 157-171
Jonathan Herzog: A computational interpretation of Dolev-Yao adversaries. Theoretical Computer Science 340(1): 57-81 (2005)
Three topics by Jan Willemson (descriptions in Estonian, you'll have to check with him if you want to choose any of those topics; the last two topics are from general data security):
Riskianalüüs võimaldab anda ratsionaalseid kvantitatiivseid hinnanguid andmeturbeinvesteeringutele. Seminaritöö teoreetiline osa hõlmab riskianalüüsi meetodite käsitlust ning uurib nende rakendusvõimalusi andmeturbesse. Praktiline osa peaks endast kujutama mõne konkreetse (näiteks seminarisosaleja tööga seotud) probleemi juhtumianalüüsi.
Mitmed globaalsed turvaprobleemid (rämpspost, viirused, DDoS ründed) on küllalt hästi kirjeldatavad evolutsioonilise ja/või majandusliku mänguteooria abil. Seminaritöö ülesandeks ongi valida üks turvaprobleem ning esitada selle käsitlus mänguteooria seisukohast. Teemaga tegelemine eeldab enese kurssiviimist majandusliku modelleerimise metoodikaga.
Want to know something about subject? Browse the link collection at http://research.cyber.ee/~lipmaa/crypto/.
Previous years (at TKK, Finland): [Autumn 2001] [Autumn 2002] [Autumn 2003] [Autumn 2004]
This page: http://research.cyber.ee/~lipmaa/teaching/MTAT.07.006/