695 results

  • Laser-Based Attacks Against FPGA Bitstream Encryption

    • June 07, 2019

    • Technische Universität Berlin - Salles Petri/Turing

    Speaker : Heiko Lohrke

    Field programmable gate arrays (FPGAs) use encryption to protect the configuration data or “bitstream” containing the design to be run on the device. This encryption aims at protecting the intellectual property and other secrets contained in the bitstream and preventing e.g. cloning or tampering with an FPGA implementation.This talk will demonstrate how attackers can use failure analysis equipment[…]
  • 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[…]
  • A Formal Analysis of 5G Authentication

    • June 03, 2019

    • Inria Center of the University of Rennes - - See the page of each talk for the room.

    Speaker : Sasa Radomirovic (University of Dundee)

    Mobile communication networks connect much of the world’s population. The security of users’ calls, text messages, and mobile data depends on the guarantees provided by the Authenticated Key Exchange protocols used. For the next-generation network (5G), the 3GPP group has standardized the 5G AKA protocol for this purpose.In this talk, I will report on our formalization of the 5G standard’s AKA[…]
  • Approx-SVP in Ideal Lattices with Pre-processing

    • May 24, 2019

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

    Speaker : Alice Pellet-Mary - ENS de Lyon

    Finding a short non zero vector in an Euclidean lattice is a well-studied problem which has proven useful to construct many cryptographic primitives. The current best asymptotic algorithm to find a relatively short vector in an arbitrary lattice is the BKZ algorithm. This algorithm recovers a vector which is at most $2^{n^{\alpha}}$ times larger than the shortest non zero vector in time $2^{n^{1-[…]
  • Homomorphic Signatures on Randomizable Ciphertexts

    • May 10, 2019

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

    Speaker : David Pointcheval - ENS

    Anonymity is a primary ingredient for our digital life. Several tools have been designed to address it such as, for authentication, blind signatures, group signatures or anonymous credentials and, for confidentiality, randomizable encryption or mix-nets.<br/> When it comes to complex electronic voting schemes, random shuffling of ciphertexts with mix-nets is the only known tool. Such mix-nets are[…]
  • Automated software protection for the masses against side-channel attacks

    • May 10, 2019

    • Univ Grenoble Alpes, CEA, List - Salles Petri/Turing

    Speaker : Nicolas Belleville

    This presentation will present an approach and a tool that answer the need for effective, generic, and easily applicable protections against side-channel attacks. The protection mechanism is based on code polymorphism, so that the observable behaviour of the protected component is variable and unpredictable to the attacker. Our approach combines lightweight specialized runtime code generation with[…]