Table of contents

  • This session has been presented April 25, 2008.

Description

  • Speaker

    Frederik Vercauteren - Katholieke Universiteit Leuven

In the past 5 years there has been an explosion of applications of pairings. In this talk we will describe a recent construction of a variant of the Tate pairing which results in a significant speed-up. Furthermore, we will elaborate on the status of pairing inversion and its implications on pairing based cryptography, but also finite field cryptography.

Next sessions

  • CryptoVerif: a computationally-sound security protocol verifier

    • September 05, 2025 (13:45 - 14:45)

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

    Speaker : Bruno Blanchet - Inria

    CryptoVerif is a security protocol verifier sound in the computational model of cryptography. It produces proofs by sequences of games, like those done manually by cryptographers. It has an automatic proof strategy and can also be guided by the user. It provides a generic method for specifying security assumptions on many cryptographic primitives, and can prove secrecy, authentication, and[…]

    • Cryptography

Show previous sessions
Page top