Filter by content type

Select one or more filters. This choice will reload the page to display the filtered results.

Remove all filters

655 results

    • Seminar

    • Cryptography

    On Error Correction for Physical Unclonable Functions

    • December 12, 2014

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Sven Muelich - Institute of Communications Engineering, Ulm University

    Cryptographic applications require random, unique and unpredictable keys. Since most cryptosystems need to access the key several times, it usually has to be stored permanently. This is a potential vulnerability regarding security, even if a protected memory is used as key storage. Implementing secure key generation and storage is therefore an important and challenging task which can be[…]
    • Seminar

    • Cryptography

    Beyond the black and grey box

    • April 25, 2014

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Yoni De Mulder - University of Leuven

    In the white-box attack context, i.e., the setting where an implementation of a cryptographic algorithm is executed on an untrusted open platform, the adversary has full access to the implementation and its execution environment. As a result, the adversary is much more powerful than in a traditional black-box environment in which the adversary has only access to the inputs and outputs of a[…]
    • Seminar

    • Cryptography

    A heuristic quasi-polynomial algorithm for discrete logarithm

    • October 03, 2014

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Razvan Basbulescu - LORIA

    in finite fields of small characteristic The difficulty of discrete logarithm computations in fields GF(q^k) depends on the relative sizes of k and q. Until recently all the cases had a sub-exponential complexity of type L(1/3), similar to the complexity of factoring. If n is the bit-size of q^k, then L(1/3) can be approximated by 2^(n^(1/3)). In 2013, Joux designed a new algorithm for constant[…]
    • Seminar

    • Cryptography

    Keep your friends close with distance-bounding protocols

    • February 07, 2014

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Maria Cristina Onete - IRISA

    Authentication protocols, run between a prover and a verifier, allow the verifier to check the legitimacy of the prover. A legitimate prover should always authenticate (the correctness requirement), while illegitimate parties (adversaries) should not authenticate (the soundness or impersonation resistance requirement). Secure authentication protocols thwart most Man-in-the-Middle (MIM) attacks,[…]
    • Seminar

    • Cryptography

    Broadcast encryption: combinatorial vs. algebraic methods

    • April 10, 2015

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Duong-Hieu Phan - ENS

    We consider a generalisation of the encryption from "one-to-one'' to "one-to-many'' communication, i.e. broadcast encryption. The objective is to allow a center to send secret messages to a large number of receivers. The security notion in “one-to-many” communications needs to be extended beyond the notion of confidentiality in “one-to-one” encryption in order to meet practical requirements. Two[…]
    • Seminar

    • Cryptography

    GGHLite: More Efficient Multilinear Maps from Ideal Lattices

    • December 05, 2014

    • IRMAR - Université de Rennes - Campus Beaulieu Bat. 22, RDC, Rennes - Amphi Lebesgue

    Speaker : Adeline Langlois - ENS Lyon

    The GGH Graded Encoding Scheme (of Garg, Gentry and Halevi), based on ideal lattices, is the first plausible approximation to a cryptographic multilinear map. Unfortunately, using the security analysis the authors provided, the scheme requires very large parameters to provide security for its underlying encoding re-randomization process. Our main contributions are to formalize, simplify and[…]