698 résultats
-
A Fundamental Approach to Cyber Risk Analysis
Orateur : Rainer Böhme (Universität Innsbruck)
This paper provides a framework actuaries can use to think about cyber risk. We propose a differentiated view of cyber versus conventional risk by separating the nature of risk arrival from the target exposed to risk. Our review synthesizes the liter- ature on cyber risk analysis from various disciplines, including computer and network engineering, economics, and actuarial sciences. As a result,[…] -
Elliptic curves for SNARKs
Orateur : Youssef El Housni - LIX
At CANS’20, El Housni and Guillevic introduced a new 2-chain of pairing-friendly elliptic curves for recursive zero-knowledge Succinct Non-interactive ARguments of Knowledge (zk-SNARKs) made of the former BLS12-377 curve (a Barreto–Lynn–Scott curve over a 377- bit prime field) and the new BW6-761 curve (a Brezing–Weng curve of embedding degree 6 over a 761-bit prime field). First we generalise the[…] -
Fault tolerant algorithms via decoding: Interleaving techniques
Orateur : Eleonora Guerrini - Université Montpellier
Evaluation Interpolation algorithms are a key tool for the algebraic decoding of a large class of codes, including the famous Reed Solomon codes. Recent techniques allow the use of this type of decoding in the more general setting of fault tolerant algorithms, where one has to interpolate erroneous data (potentially computed by an untrusted entity). In this talk we will present algorithms to[…] -
Soutenance de thèse: Algebraic Cryptanalysis of the Shortest Vector Problem in Ideal Lattices
Orateur : Olivier Bernard - Rennes
-
PMNS for efficient arithmetic and small memory cost
Orateur : Fangan Yssouf Dosso - Ecole des Mines de Saint-Etienne
The Polynomial Modular Number System (PMNS) is an integer number system which aims to speed up arithmetic operations modulo a prime p. Such a system is defined by a tuple (p, n, g, r, E), where p, n, g and r are positive integers, E is a monic polynomial with integer coefficients, having g as a root modulo p. Most of the work done on PMNS focus on polynomials E such that E(X) = X^n – l, where l is[…] -
Syndrome Decoding in the Head – Shorter Signatures from Zero-Knowledge proofs
Orateur : Thibauld Feneuil - CryptoExperts et Sorbonne Université
In this talk, I will present a new zero-knowledge proof of knowledge for the syndrome decoding (SD) problem on random linear codes. Instead of using permutations like most of the existing protocols, we rely on the MPC-in-the-head paradigm in which we reduce the task of proving the low Hamming weight of the SD solution to proving some relations between specific polynomials. Specifically, we propose[…]