Filter by content type

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

Remove all filters

655 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

    Soutenance de thèse (exceptionnellement mercredi à 13h30 en salle Petri-Turing à l'IRISA): Algorithmes d'algèbre linéaire pour la cryptographie

    • November 21, 2018

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

    Speaker : Claire Delaplace - Université Rennes 1

    Dans cette thèse, nous discutons d’aspects algorithmiques de trois différents problèmes, en lien avec la cryptographie. La première partie est consacrée à l’algèbre linéaire creuse. Nous y présentons un nouvel algorithme de pivot de Gauss pour matrices creuses à coefficients exacts, ainsi qu’une nouvelle heuristique de selection de pivots, qui rend l’entière procédure particulièrement efficace[…]

    • Seminar

    • Cryptography

    Wave: A New Code-Based Signature Scheme

    • January 11, 2019

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

    Speaker : Thomas Debris-alazard - inria

    It is a long standing open problem to build an efficient and secure digital signature scheme based on the hardness of decoding a linear code which could compete with widespread schemes like DSA or RSA. The latter signature schemes are broken by a quantum computer with Shor’s algorithm. Code-based schemes could provide a valid quantum resistant replacement. We present here Wave the first « hash[…]
Page top