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 2014
March 2014
March 12, 11:00 - Improvement of FFPR method to solve ECDLP
by Yun-Ju Huang
Date: | March 12, 2014 - 11:00 |
Location: | Nyquist room - Maxwell Building a.164
Place du Levant, 3 - 1348 Louvain-la-Neuve
|
Abstract: | Solving the elliptic curve discrete logarithm problem (ECDLP) by using Gröbner basis has recently appeared as a new threat to the security of elliptic curve cryptography and pairing-based cryptosystems. At Eurocrypt 2012, Faugere, Perret, Petit and Renault proposed a new method using a multivariable polynomial system to solve ECDLP over finite fields of characteristic 2. At Asiacrypt 2012, Petit and Quisquater showed that this method may beat generic algorithms for extension degrees larger than about 2000.
In this talk, we describe a variant of FPPR attack that practically reduces the computation time and memory required. Our variant is based on the idea of symmetrization. This idea already provided practical improvements in several previous works for composite-degree extension fields, but its application to prime-degree extension fields has been more challenging. To exploit symmetries in an efficient way in that case, we specialize the definition of factor basis used in FPPR attack to replace the original polynomial system by a new and simpler one. We provide theoretical and experimental evidence that our method is faster and requires less memory than FPPR method when the extension degree is large enough.
The talk is based on joint work with Christophe Petit, Naoyuki Shinohara and Tsuyoshi Takagi. |
March 17, 15:00 - Efficient Template Attacks
by Omar Choudary
Date: | March 17, 2014 - 15:00 |
Location: | Salle Shannon - Maxwell Building, first floor. Place du Levant, 3 - 1348 Louvain-la-Neuve |
Abstract: | In this talk I shall present our work on developing efficient implementations of the template attack.
I shall try to present some of the technical problems that can appear when implementing the template attacks based on the multivariate normal
distribution, and some of the efficient solutions that we propose based on existing literature on multivariate statistical analysis.
This work was presented at CARDIS 2013, Berlin. |
March 31, 15:00 - Unifying leakage models: from probing attacks to noisy leakage
by Sebastian Faust
Date: | March 31, 2014 - 15:00 |
Location: | Salle Shannon - Maxwell Building, first floor. Place du Levant, 3 - 1348 Louvain-la-Neuve |
Abstract: | A recent trend in cryptography is to formally show the leakage
resilience of cryptographic implementations in a given leakage model.
One of the most prominent leakage models -- the so-called bounded
leakage model -- assumes that the amount of leakage is a-priori
bounded. Unfortunately, it has been pointed out that the assumption
of bounded leakages is hard to verify in practice. A more realistic
assumption is to assume that leakages are sufficiently noisy,
following the engineering observation that real-world physical
leakages are inherently noisy. While the noisy leakage assumption has
first been studied in the seminal work of Chari et al. (CRYPTO 99),
the recent work of Prouff and Rivain (Eurocrypt 2013) provides the
first analysis of a full masking scheme under a physically motivated
noise model. In particular, the authors show that a block-cipher
implementation that uses an additive masking scheme is secure against
noisy leakages. Unfortunately, the security analysis of Prouff and
Rivain has three important shortcomings: (1) it requires leak-free
gates, (2) it considers a restricted adversarial model (random message
attacks), and (3) the security proof has limited application for
cryptographic settings. In this work, we provide an alternative
security proof in the same noisy model that overcomes these three
challenges. We achieve this goal by a new reduction from noisy leakage
to the important theoretical model of probing adversaries (Ishai et
al~ -- CRYPTO 2003). Our work can be viewed as a next step of closing
the gap between theory and practice in leakage resilient cryptography:
while our security proofs heavily rely on concepts of theoretical
cryptography, we solve problems in practically motivated leakage
models.
This is joint work with Alexandre Duc and Stefan Dziembowski |
Link: | http://cs.au.dk/~sfaust/ |
April 2014
April 29, 11:00 - Kleptography: The Unbearable Lightness of Being Mistrustful
by Moti Yung
Date: | April 29, 2014 - 11:00 |
Location: | Room 207, Euler Building (near Maxwell Building) Avenue Georges Lemaître, 4-6 - 1348 Louvain-la-Neuve |
Abstract: | Organizations which need to protect the Internet from external attackers, would,
in fact, weaken it if they implement mechanisms to subvert cryptosystems (such
as weak random generators), and indeed activists complain that weakening the
mechanisms will make the Internet as a whole susceptible to more severe attacks.
Thus, organization are facing a dilemma in their attempt to have surveillance
capability vs. their desire to keep the Internet secure (to everyone else but
themselves). How can one make the Internet trustful but mistrustful exclusively
to one organization? We will cover how the dilemma can, in fact, be solved by
Kleptography (and why the alleged assault on Internet privacy by national
organization has chosen to exploit mechanisms of this nature which were
pioneered in the 90's). |
April 30, 10:30 - Public key cryptography - Implementation and countermeasures
by Dr. Jean-François Dhem
Date: | April 30, 2014 - 10:30 |
Location: | Salle Shannon - Maxwell Building, first floor. Place du Levant, 3 - 1348 Louvain-la-Neuve |
Abstract: | Fast efficient and secure public key cryptography has always been a challenge
due to the complexity and important required computing power. The challenge is
even more important when all this has to be done in very constraining environments
such as smart-cards or some new contactless devices.
In this presentation, we will try to cover the most efficient technics to speed-up
public-key cryptographic operations present in the well-known RSA or in
Elliptic-curve based cryptography but also the challenge of doing this securely
taking into account some of the most powerful attacks on these implementations such
as side channel and fault attacks. |
May 2014
May 06, 15:00 - Fighting against theft, cloning and counterfeiting of integrated circuits
by Lilian Bossuet
Date: | May 06, 2014 - 15:00 |
Location: | Nyquist room - Maxwell Building a.164
Place du Levant, 3 - 1348 Louvain-la-Neuve
|
Abstract: | Fabless semiconductor industry is facing the rise of design costs of integrated circuits. This rise is linked to the process technology changes and the complexity increase. Consequently, integrated circuits have become targets of counterfeiting and theft. This talk presents a state of the art of solutions to fight against theft, illegal cloning and counterfeiting of integrated circuits and intellectual properties. It will mainly highlight the salutary hardware which means embedded hardware systems, hardly detectable / difficult to circumvent, inserted in an integrated circuit or a virtual component (Intellectual Property), used to provide intellectual property information (e.g. watermarking or hardware licensing) and / or to remotely activate the circuit or IP after being manufactured and during its use. |
May 06, 15:00 - Fighting against theft, cloning and counterfeiting of integrated circuits
by Lilian Bossuet
Date: | May 06, 2014 - 15:00 |
Location: | Nyquist room - Maxwell Building a.164
Place du Levant, 3 - 1348 Louvain-la-Neuve
|
Abstract: | Fabless semiconductor industry is facing the rise of design costs of integrated circuits. This rise is linked to the process technology changes and the complexity increase. Consequently, integrated circuits have become targets of counterfeiting and theft. This talk presents a state of the art of solutions to fight against theft, illegal cloning and counterfeiting of integrated circuits and intellectual properties. It will mainly highlight the salutary hardware which means embedded hardware systems, hardly detectable / difficult to circumvent, inserted in an integrated circuit or a virtual component (Intellectual Property), used to provide intellectual property information (e.g. watermarking or hardware licensing) and / or to remotely activate the circuit or IP after being manufactured and during its use. |
September 2014
September 12, 14:00 - Bitcoin: a revolutionary cryptographic currency for the internet
by Dr. Baudoin Collard
Date: | September 12, 2014 - 14:00 |
Location: | Salle Shannon - Maxwell Building, first floor. Place du Levant, 3 - 1348 Louvain-la-Neuve |
Abstract: | In the last years, the Bitcoin ecosystem has known an impressive development as a decentralized open-source payment system for the internet. In this presentation, we will first give a general overview of the Bitcoin architecture, how the currency is created, what is the block chain and how it is used to securely transfer funds from one user to another with little to no cost. We will then describe the cryptographic mechanisms used to secure the Bitcoin network and give a discussion of its security model and limitations. We will present the current applications of the Bitcoin as well as the promising applications that such innovative technology could enable in the future. Finally, some alternative crypto-currencies that have been developed since the advent of the Bitcoin will be briefly introduced. |
See also: