Section: New Results
Participants : Andreas Enge, Jérôme Milan.
The year has been marked by the kick-off of the Anr Pace , leading to the publication of two surveys. Much in the spirit of  , the paper  gives a low-brow introduction to the Weil and the Tate pairings as well as to algorithms computing them. In particular, simple proofs of the main properties of these pairings, as well as of the equivalence of the three different definitions of the Weil pairing are presented. We briefly comment on techniques for generating suitable curves and on cryptographic standards. The survey  is devoted to a succinct presentation of the main computational asumptions underlying pairing-based cryptography, and in particular protocols related to e-cash.