Search by date:
1998
|
1999
|
2000
|
2001
|
2002
|
2003
|
2004
|
2005
|
2006
|
2007
|
2008
|
2009
|
2010
|
2011
|
2012
|
2013
|
2014
|
2016
|
2017
|
2018
|
2019
| Forthcoming
If you wish to be informed about our seminars by email,
please contact Francesco Berti, Olivier Pereira or François-Xavier Standaert .
Seminars for the year 2007
January 2007
January 16, 11:00 - Secure Key Storage with PUFs (Pim Tuyls)
| Date: | January 16, 2007 - 11:00 |
| Location: | Auditoire Euler, 002, Euler Building (near Maxwell Building)
Avenue Georges Lemaître, 4-6 - 1348 Louvain-la-Neuve |
| Abstract: | In this talk we will introduce Physical Unclonable Functions (PUFs). PUFs
are unclonable physical structures that lead to an unpredictable response
when they are challenged. Several examples of PUFs will be given. Since
damage to the PUF changes this challenge-response behaviour, they offer an
interesting alternative for key storage that remains secure under physical
attacks. In order to do so, one has to be able to extract sufficient
randomness from the responses and to deal with the noise in the responses.
These problems can be dealt with by means of an Helper Data Algorithm
(Fuzzy Extractor). We will explain the main ideas behind Helper Data and
show how they can be implemented in an IC. Finally, we show how all these
components fit together and illustrate with some experiments that
additional protection against Focused Ion Beams is added. |
| Link: | http://users.skynet.be/pimtuyls/pimtuyls.htm |
March 2007
March 02, 11:00 - An Efficient Anonymous Credential System
by Tatsuaki Okamoto
| Date: | March 02, 2007 - 11:00 |
| Location: | Auditoire Euler, 002, Euler Building (near Maxwell Building)
Avenue Georges Lemaître, 4-6 - 1348 Louvain-la-Neuve |
| Abstract: | Anonymous credential is one of the most important notions to
counter some of the privacy problems about identity certificates.
The basic properties of anonymous credential systems are unforgeability,
anonymity and unlinkability.
The existing most efficient anonymous credential schemes are based on the
Strong RSA assumption or the LRSW assumption.
In my talk, I will introduce another efficient anonymous credential system
based on the SDH assumption.
This is a joint work with Norio Akagi and Yoshifumi Manabe.
|
March 14, 11:00 - Quantum Information and Cryptography
by Romain Alléaume
| Date: | March 14, 2007 - 11:00 |
| Location: | Auditoire Euler, 002, Euler Building (near Maxwell Building)
Avenue Georges Lemaître, 4-6 - 1348 Louvain-la-Neuve |
| Abstract: | As explained by Charles Bennett and Gilles Brassard, in their seminal
paper of 1984 on quantum key distribution, the use of quantum
ressources to exchange digital information can give rise to novel
cryptographic phenomena unachievable with traditional communication
media.
We will propose, in the first part of the seminar, an overview on
the current status of quantum cryptography and more specifically of
quantum key distribution. We will then present the work done within
the European project SECOQC, aiming at developping long distance
communication networks secured by quantum cryptography. We will also
discuss the cryptographic applications of quantum key distribution
and sketch what could be some new interesting directions of research,
involving both quantum and classical cryptographers. |
| Link: | http://www.perso.enst.fr/~alleaume/ |
April 2007
April 24, 16:00 - RFID Primer and Foretaste of Security and Privacy
by Gildas Avoine
| Date: | April 24, 2007 - 16:00 |
| Location: | Auditoire Euler, 002, Euler Building (near Maxwell Building)
Avenue Georges Lemaître, 4-6 - 1348 Louvain-la-Neuve |
| Abstract: | During my stay in the Crypto Group of UCLouvain, my research activities
will focus on the security of the RFID systems. I will especially
address the security issues related to the biometric passports, and I
will also consider the relay attacks. During these 2-month sojourn, I
will give several talks about security and privacy in RFID systems. The
first one of this series will consist of a general introduction to RFID
and its security and privacy-related problems, and the following ones
will focus on more specific problems.
RFID consists in remotely identifying objects or persons that carry a
small transponder, called tag. Such tags offer limited capabilities and
so require specific cryptographic designs for "securing" the system.
Because RFID becomes a ubiquitous technology, privacy is also a matter
of concern. After an introduction to the technology itself, the existing
and the future applications, I will describe the main security and
privacy issues that appear in RFID systems. |
| Link: | http://www.avoine.net/ |
April 25, 14:00 - Foundations of Cryptography -- 1/4) Building secure systems: which foundations for cryptography?
by Pr. Jean-Jacques Quisquater
, Pr. Olivier Pereira
| Date: | April 25, 2007 - 14:00 |
| Location: | Auditoire Euler, 002, Euler Building (near Maxwell Building)
Avenue Georges Lemaître, 4-6 - 1348 Louvain-la-Neuve |
| Abstract: | During four afternoons (2-6 PM), we are going to study rigorous approaches to
the problem of defining and proving security, with an emphasis on the
area of cryptographic protocols.
Different topics will be covered, going from foundational works in
cryptography to techniques that can be used for automated security
proofs.
We expect basic knowledge of the cryptography landscape (introductory
course level), but will start from the very basic definitions.
This seminar is organized in the context of Graduate School in Computing Science (Grascomp).
|
May 2007
May 02, 14:00 - Foundations of Cryptography -- 2/4) More building blocks for cryptography
by Pr. Jean-Jacques Quisquater
, Pr. Olivier Pereira
| Date: | May 02, 2007 - 14:00 |
| Location: | Auditoire Euler, 002, Euler Building (near Maxwell Building)
Avenue Georges Lemaître, 4-6 - 1348 Louvain-la-Neuve |
| Abstract: | During four afternoons (2-6 PM), we are going to study rigorous approaches to the problem of defining and proving security, with an emphasis on the area of cryptographic protocols. Different topics will be covered, going from foundational works in cryptography to techniques that can be used for automated security proofs. We expect basic knowledge of the cryptography landscape (introductory course level), but will start from the very basic definitions.
This seminar is organized in the context of Graduate School in Computing Science (Grascomp). |
May 09, 14:00 - Foundations of Cryptography -- 3/4) From blocks to buildings: composing cryptographic primitives
by Pr. Jean-Jacques Quisquater
, Pr. Olivier Pereira
| Date: | May 09, 2007 - 14:00 |
| Location: | Auditoire Euler, 002, Euler Building (near Maxwell Building)
Avenue Georges Lemaître, 4-6 - 1348 Louvain-la-Neuve |
| Abstract: | During four afternoons(2-6 PM), we are going to study rigorous approaches to
the problem of defining and proving security, with an emphasis on the
area of cryptographic protocols.
Different topics will be covered, going from foundational works in
cryptography to techniques that can be used for automated security
proofs.
We expect basic knowledge of the cryptography landscape (introductory
course level), but will start from the very basic definitions.
This seminar is organized in the context of Graduate School in Computing Science (Grascomp). |
May 14, 11:00 - Elliptic Curve Arithmetic
by Jean-Pierre Deschamps
| Date: | May 14, 2007 - 11:00 |
| Location: | Room 207, Euler Building (near Maxwell Building)
Avenue Georges Lemaître, 4-6 - 1348 Louvain-la-Neuve |
| Abstract: | Elliptic Curve Arithmetic
1. Elliptic Curve over a Finite Field
2. Group Law
3. Point Multiplication
4. Implementations |
| Link: | http://www.amazon.com/Synthesis-Arithmetic-Circuits-Embedded-Systems/dp/0471687839 |
May 16, 11:00 - Dividers
by Jean-Pierre Deschamps
| Date: | May 16, 2007 - 11:00 |
| Location: | Room 207, Euler Building (near Maxwell Building)
Avenue Georges Lemaître, 4-6 - 1348 Louvain-la-Neuve |
| Abstract: | Dividers:
1. Digit Recurrence Algorithms
1.1. Restoring Division Algorithm for Naturals
1.2. Non-restoring Division Algorithm for Integers
1.3. SRT Radix-2 Division (a.o. Stored-carry Encoding)
2. Convergence Algorithms
|
| Link: | http://www.amazon.com/Synthesis-Arithmetic-Circuits-Embedded-Systems/dp/0471687839 |
May 16, 14:00 - Foundations of Cryptography -- 4/4) From buildings to cities: mechanizing cryptographic proofs
by Pr. Jean-Jacques Quisquater
, Pr. Olivier Pereira
| Date: | May 16, 2007 - 14:00 |
| Location: | Auditoire Euler, 002, Euler Building (near Maxwell Building)
Avenue Georges Lemaître, 4-6 - 1348 Louvain-la-Neuve |
| Abstract: | During four afternoons(2-6PM), we are going to study rigorous approaches to
the problem of defining and proving security, with an emphasis on the
area of cryptographic protocols.
Different topics will be covered, going from foundational works in
cryptography to techniques that can be used for automated security
proofs.
We expect basic knowledge of the cryptography landscape (introductory
course level), but will start from the very basic definitions.
This seminar is organized in the context of Graduate School in Computing Science (Grascomp). |
June 2007
June 14, 11:00 - Pas de mot de passe pour le passeport biométrique belge
by Gildas Avoine
, Kassem Kalach
, Pr. Jean-Jacques Quisquater
| Date: | June 14, 2007 - 11:00 |
| Location: | Auditoire Euler, 002, Euler Building (near Maxwell Building)
Avenue Georges Lemaître, 4-6 - 1348 Louvain-la-Neuve |
| Abstract: | L'exposé visera à présenter le nouveau passeport électronique belge, émis depuis fin 2004, et retracera l'histoire,
et les problèmes, des objets interrogeables à distance (RFID et
carte sans contact). Votre vie privée peut être concernée.
Enfin, apportez votre passeport, car nous terminerons par une
démonstration de lecture de passeport avec du matériel courant
et facilement accessible. |
| Link: | http://www.dice.ucl.ac.be/crypto/passport/index.html |
June 20, 14:00 - Security-Enhancing Compilers for Group Key Exchange Protocols
by Pr. Mark Manulis
| Date: | June 20, 2007 - 14:00 |
| Location: | Room 207, Euler Building (near Maxwell Building)
Avenue Georges Lemaître, 4-6 - 1348 Louvain-la-Neuve |
| Abstract: | Group key exchange (GKE) protocols can be used to guarantee confidentiality
and group authentication in
a variety of group applications. In the light of a large number of different
security requirements for GKE protocols
it is convenient to have generic solutions that can be used to enhance
security of any GKE protocol regardless
of its original construction. Such security-enhancing solutions, called
compilers, can also be
used to design GKE protocols in a modular way.
This talk will provide examples for various attacks in GKE protocols
resulting from the adversarial control of the communication channel and
(strong) corruptions of the protocol participants. Additionally, it will
introduce a number of generic countermeasures to resist the mentioned
attacks.
|
August 2007
August 30, 14:15 - La cryptographie au secours du vote électronique
by Marc Girault
| Date: | August 30, 2007 - 14:15 |
| Location: | Auditoire Euler, 002, Euler Building (near Maxwell Building)
Avenue Georges Lemaître, 4-6 - 1348 Louvain-la-Neuve |
| Abstract: | Cet exposé a pour objet de présenter la problématique du vote
électronique
et les solutions que la cryptographie permet (ou non) d'y apporter.
Après avoir
énuméré les différentes (et parfois antagonistes) propriétés que devrait
satisfaire
toute élection, nous décrivons les outils cryptographiques propices à
l'édification
de systèmes de vote électroniques, et notamment les signatures aveugles,
les réseaux
de mélangeurs (mix-nets) et le chiffrement homomorphique. Ensuite, nous
évoquons
quelques systèmes existants mettant en œuvre partie l'un ou l'autre de
ces outils.
Enfin, nous évoquons des travaux récents qui montrent comment surmonter
les défauts
des systèmes actuels -ou, à l'inverse, invitent à perdre quelques
illusions.
En particulier, certaines méthodes permettent de détecter des machines
(ou logiciels)
de vote malveillants, évitant ainsi le recours à des procédures
compliquées et
coûteuses d'évaluation de leur sécurité. D'autres, dans le cas d'un vote
à distance,
permettent de déjouer la menace qu'un électeur agisse sous la
contrainte. Néanmoins,
nous montrons aussi que le système "parfait" n'existe pas : aucun
d'entre eux ne
saurait garantir simultanément aux électeurs le secret total de leur
vote et la
possibilité de vérifier eux-mêmes que le résultat de l'élection est exact.
|
See also:
