Filter by content type

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

Remove all filters

633 results

    • Seminar

    • Cryptography

    Functional Encryption: A novel paradigm for public-key encryption.

    • March 20, 2015

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

    Speaker : Angelo De Caro - ENS

    Whereas, in traditional public-key encryption, decryption is an all-or-nothing affair (i.e., a receiver is either able to recover the entire message using its key, or nothing), functional encryption enables fine-grained access control and computation on encrypted data, as required to protect data in the cloud.<br/> In the first part of the talk, we provide an introduction to functional encryption[…]
    • Seminar

    • Cryptography

    Un algorithme pour trouver toutes les formules calculant une application bilinéaire.

    • April 18, 2014

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

    Speaker : Nicolas Estibal - IRISA

    La multiplication est une opération arithmétique coûteuse comparativement à l'addition. Aussi il est intéressant, étant donné une application, de minimiser le nombre de produits à effectuer pour la calculer. Dans cette étude, nous nous restreignons au cas des applications bilinéaires.<br/> En effet, parmi les applications bilinéaires, nous étions intéressés en premier lieu par la multiplication[…]
    • Seminar

    • Cryptography

    Chiffrement basé sur l'identité à l'aide de réseaux NTRU

    • October 24, 2014

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

    Speaker : Thomas Prest - ENS

    Les réseaux euclidiens (ou réseaux) permettent de construire une grande variété de primitives cryptographiques. Cependant, les implémentations efficaces de schémas basés sur les réseaux se sont jusqu'à présent toujours limitées à des primitives basiques comme le chiffrement et les signatures électroniques.<br/> La principale raison à cette limitation est le fait qu'au coeur de nombre de ces[…]
    • Seminar

    • Cryptography

    Disjunctions for Hash Proof Systems: New Constructions and Applications

    • April 24, 2015

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

    Speaker : Fabrice Ben Hamouda - ENS

    Hash Proof Systems were first introduced by Cramer and Shoup (Eurocrypt'02) as a tool to construct efficient chosen-ciphertext-secure encryption schemes. Since then, they have found many other applications, including password authenticated key exchange, oblivious transfer, and zero-knowledge arguments. One of the aspects that makes hash proof systems so interesting and powerful is that they can be[…]
    • Seminar

    • Cryptography

    How to find low-weight polynomial multiples.

    • June 13, 2014

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

    Speaker : Carl Löndahl - Université de Lund

    We present an improved algorithm for finding low-weight multiples of polynomials over the binary field using coding heoretic methods. The associated code defined by the given olynomial has a cyclic structure, allowing an algorithm to earch for shifts of the sought minimum-weight odeword. Therefore, a code with higher dimension is onstructed, having a larger number of low-weight codewords nd[…]
    • 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[…]