Filter by content type

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

Remove all filters

657 results

    • Seminar

    • Cryptography

    Improved Veron Identification and Signature Schemes in the Rank Metric

    • June 07, 2019

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

    Speaker : Florian Caullery - Darkmatter

    Abstract—It is notably challenging to design an efficient and secure signature scheme based on error-correcting codes. An approach to build such signature schemes is to derive it from an identification protocol through the Fiat-Shamir transform.<br/> All such protocols based on codes must be run several rounds, since each run of the protocol allows a cheating probability of either 2/3 or 1/2. The[…]

    • Seminar

    • Cryptography

    Towards Non-Interactive Zero-Knowledge from CDH and LWE

    • January 18, 2019

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

    Speaker : Geoffroy Couteau - Karlsruher Institut für Technologie (KIT)

    We provide a generic construction of non-interactive zero-knowledge (NIZK) schemes. Our construction is a refinement of Dwork and Naor’s (FOCS 2000) implementation of the hidden bits model using verifiable pseudorandom generators (VPRGs). Our refinement simplifies their construction and relaxes the necessary assumptions considerably. As a result of this conceptual improvement, we obtain[…]

    • Seminar

    • Cryptography

    Lossy trapdoor primitives, zero-knowledge proofs and applications

    • October 04, 2019

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

    Speaker : Chen Qian - soutenance de thèse salle Métivier à l'IRISA, 14h

    In this thesis, we study two differentprimitives. Lossy trapdoor functions and zero-knwoledge proof systems.The lossy trapdoor functions (LTFs) arefunction families in which injective functionsand lossy ones are computationally indistin-guishable. Since their introduction, they havebeen found useful in constructing various cryp-tographic primitives. We give in this thesisefficient constructions of[…]

    • Seminar

    • Cryptography

    Toutes les informations ici https://cca.inria.fr/

    • March 29, 2019

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

    Speaker : Ilaria Chillotti, Ayoub Otmani, Ida Tucker et Brice Minaud - Séminaire C2

    • Seminar

    • Cryptography

    A Modular Security Analysis of EAP and IEEE 802.11

    • April 07, 2017

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

    Speaker : Haakon Jacobsen - TBD

    The Extensible Authentication Protocol (EAP) is a widely used three-party authentication framework that allows a client to connect to a wireless access point it does not share a secret with, using a mutually trusted server. EAP is often found in enterprise networks or large organizations to provide central key-management and user authentication; one prime example being the eduroam network.<br/> In[…]

    • Seminar

    • Cryptography

    Complete Addition Formulas for Prime Order Elliptic Curves

    • December 09, 2016

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

    Speaker : Joost Renes - University of Nijmegen

    An elliptic curve addition law is said to be complete if it correctly computes the sum of any two points in the elliptic curve group. One of the main reasons for the increased popularity of Edwards curves in the ECC community is that they can allow a complete group law that is also relatively efficient (e.g., when compared to all known addition laws on Edwards curves). Such complete addition[…]
Page top