624 résultats
-
True Random Number Generators enabled hardware security
Orateur : Bohan Yang
True randomness is all about unpredictability, which can neither be qualified nor quantified by examining statistics of a sequence of digits. Unpredictability is a property of random phenomena, which is measured in bits of information entropy. Application of randomness spans from art to numerical computing and system security. Random numbers enable various cryptographic algorithms, protocols and[…] -
Toutes les informations ici https://cca.inria.fr/
Orateur : Ilaria Chillotti, Ayoub Otmani, Ida Tucker et Brice Minaud - Séminaire C2
-
Designing and deploying post-quantum cryptography
Orateur : Jean-Philippe Aumasson - Teserakt AG
I will review the hash-based signature submitted to the NIST competition jointly with Guillaume Endignoux, discussing its assurance level and performance. Then I will discuss the challenges of deploying post-quantum cryptography in an end-to-end encryption product for machine-to-machine communications.<br/> lien: http://desktop.visio.renater.fr/scopia?ID=721783***6864&autojoin -
Voting : You Can’t Have Privacy without Individual Verifiability
Orateur : Joseph Lallemand (Loria)
Electronic voting typically aims at two main security goals: vote privacy and verifiability. These two goals are often seen as antagonistic and some national agencies even impose a hierarchy between them: first privacy, and then verifiability as an additional feature. Verifiability typically includes individual verifiability (a voter can check that her ballot is counted); universal verifiability […] -
Discrete logarithm computation in finite fields GF(p^k) with NFS
Orateur : Aurore Guillevic - INRIA
Pairings on elliptic curves are involved in signatures, NIZK, and recently in blockchains (ZK-SNARKS).<br/> These pairings take as input two points on an elliptic curve E over a finite field, and output a value in an extension of that finite field. Usually for efficiency reasons, this extension degree is a power of 2 and 3 (such as 12,18,24), and moreover the characteristic of the finite field has[…] -
A Compositional and Complete approach to Verifying Privacy Properties using the Applied Pi-calculus
Orateur : Ross Horne (University of Luxembourg)
The pi-calculus was introduced for verifying cryptographic protocols by Abadi and Fournet in 2001. They proposed an equivalence technique, called bisimilarity, useful for verify privacy properties. It is widely acknowledged (cf. Paige and Tarjan 1987), that bisimilarity is more efficient to check than trace equivalence; however, surprisingly, tools based on the applied pi-calculus typically still[…]