Table of contents

  • This session has been presented October 30, 2009.

Description

  • Speaker

    Julien Bringer - Sagem Sécurité

Cet exposé est basé sur des travaux communs avec Hervé Chabanne, David Pointcheval, Qiang Tang menés dans le cadre du projet ANR RNRT BACH (Biometric Authentication with Cryptographic Handling).<br/> Extended Private Information Retrieval (EPIR) is a generalization of the notion of Private Information Retrieval (PIR). The principle is to enable a user to privately evaluate a fixed and public function with two inputs, a chosen block from a database and an additional string. In this talk, we will present this notion and describe 2 constructions with applications to biometric authentication. We will then explain an extension of this notion in order to add more flexibility during the system life. As an example, we will introduce a general protocol enabling polynomial evaluations. As to practical concern, we will also discuss how amortizing database computations when dealing with several requests.

Next sessions

  • Algorithms for post-quantum commutative group actions

    • March 27, 2026 (13:45 - 14:45)

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

    Speaker : Marc Houben - Inria Bordeaux

    At the historical foundation of isogeny-based cryptography lies a scheme known as CRS; a key exchange protocol based on class group actions on elliptic curves. Along with more efficient variants, such as CSIDH, this framework has emerged as a powerful building block for the construction of advanced post-quantum cryptographic primitives. Unfortunately, all protocols in this line of work are[…]
  • Journées C2: pas de séminaire

    • April 03, 2026 (13:45 - 14:45)

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

  • Endomorphisms via Splittings

    • April 10, 2026 (13:45 - 14:45)

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

    Speaker : Min-Yi Shen - No Affiliation

    One of the fundamental hardness assumptions underlying isogeny-based cryptography is the problem of finding a non-trivial endomorphism of a given supersingular elliptic curve. In this talk, we show that the problem is related to the problem of finding a splitting of a principally polarised superspecial abelian surface. In particular, we provide formal security reductions and a proof-of-concept[…]
    • Cryptography

Show previous sessions