Filter by content type

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

Remove all filters

616 results

    • Seminar

    • Cryptography

    Theta identities and Thomae formulas

    • December 16, 2005

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

    Speaker : Yaacov Kopeliovich

    In this talk we apply Thomae formulas to obtain algebraic relations satisfied by Riemann surfaces that are cyclic covers of the Sphere. We focus on the genus 2 case and then give an example of a higher genus case (g=4) that was not known before. The conjectural connection of these identities as well as Thomae formulas to the moduli action of the Braid group is explained.<br/> We present a[…]
    • Seminar

    • Cryptography

    Group Signatures for Federated Systems

    • June 02, 2006

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

    Speaker : Mark Manulis - Ruhr-University of Bochum

    For many mutli-party applications group signatures are important cryptographic primitives that can be used for the purpose of anonymity and privacy. In classical group signatures members of a group are able to sign messages anonymously on behalf of the group. However, there exists a designated authority, called group manager, that initializes the scheme, adds new group members, and is able to open[…]
    • Seminar

    • Cryptography

    Efficient Multi-Party Computation with Dispute Control

    • July 01, 2005

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

    Speaker : Zuzana Beerliova - ETH Zurich

    Secure multi-party computation (MPC) allows a set of $n$ players to securely compute an agreed function of their inputs, even when up to $t$ of the players are under complete adversarial control. We consider secure MPC in the information-theoretic model with broadcast channels (PKI setup) and present an efficient protocol with optimal resilience ($t< n/2$), using a new technique technique called[…]
    • Seminar

    • Cryptography

    Signatures à vérification contrôlée

    • February 03, 2006

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

    Speaker : Fabien Laguillaumie - LIX

    Les signatures indéniables ont été introduites par Chaum et van Antwerpen en 1989 pour permettre au signataire de contrôler la vérification d'un signature qu'il a émise. En effet, la propriété de vérification universelle satisfaite par les signatures numériques classiques n'est pas souhaitable dans certaines applications électroniques (licence de logiciel, vote électronique,...). Ainsi, pour[…]
    • Seminar

    • Cryptography

    Principes et Mises en Oeuvre de la Cryptographie Quantique

    • June 25, 2004

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

    Speaker : Philippe Grangier - Laboratoire Charles Fabry de l'Institut d'Optique

    Nous présenterons les principes de la cryptographie quantique, qui a pour but de distribuer des clés secrètes dont la confidentialité est garantie par les lois de la physique (relations d'incertitude de Heisenberg, théorème de non-clonage). Nous décrirons ensuite quelques exemples de mise en oeuvre de ces techniques, en présentant une brève revue de l'état de l'art du domaine.
    • Seminar

    • Cryptography

    Rigid cohomology and point counting on varieties over finite fields

    • March 11, 2005

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

    Speaker : Ralf Gerkmann - Universitat Erlangen

    n 2001 K. Kedlaya suggested an algorithm to compute the zeta function of a hyperelliptic curve over a finite field of small odd characteristic. The basic idea of his approach is to compute the explicit Frobenius action on the Monsky-Washniter cohomology in dimension one. Later his method was extended by P. Gaudry and N. Guerel to superelliptic curve and by J. Denef and F. Vercauteren to[…]