Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Lavauzelle, Julien"'
This paper extends the study of rank-metric codes in extension fields $\mathbb{L}$ equipped with an arbitrary Galois group $G = \mathrm{Gal}(\mathbb{L}/\mathbb{K})$. We propose a framework for studying these codes as subspaces of the group algebra $\
Externí odkaz:
http://arxiv.org/abs/2006.14489
Autor:
Bordage, Sarah, Lavauzelle, Julien
We show that the single-server computational PIR protocol proposed by Holzbaur, Hollanti and Wachter-Zeh in 2020 is not private, in the sense that the server can recover in polynomial time the index of the desired file with very high probability. The
Externí odkaz:
http://arxiv.org/abs/2004.00509
Autor:
Lavauzelle, Julien
Les codes localement corrigibles ont été introduits dans le but d'extraire une partie de l'information contenue dans un mot de code bruité, en effectuant un nombre limité de requêtes à ses symboles, ce nombre étant appelé la localité du code
Externí odkaz:
http://www.theses.fr/2018SACLX082/document
We present a rank metric code-based encryption scheme with key and ciphertext sizes comparable to that of isogeny-based cryptography for an equivalent security level. The system also benefits from efficient encryption and decryption algorithms, which
Externí odkaz:
http://arxiv.org/abs/1911.13119
Autor:
Lavauzelle, Julien, Renner, Julian
Twisted Reed-Solomon (TRS) codes are a family of codes that contains a large number of maximum distance separable codes that are non-equivalent to Reed--Solomon codes. TRS codes were recently proposed as an alternative to Goppa codes for the McEliece
Externí odkaz:
http://arxiv.org/abs/1904.11785
Autor:
Lavauzelle, Julien, Nardi, Jade
Low degree Reed-Muller codes are known to satisfy local decoding properties which find applications in private information retrieval (PIR) protocols, for instance. However, their practical instantiation encounters a first barrier due to their poor in
Externí odkaz:
http://arxiv.org/abs/1904.08696
A private information retrieval (PIR) scheme allows a user to retrieve a file from a database without revealing any information on the file being requested. As of now, PIR schemes have been proposed for several kinds of storage systems, including rep
Externí odkaz:
http://arxiv.org/abs/1811.02898
Autor:
Lavauzelle, Julien
Lifted Reed-Solomon codes, introduced by Guo, Kopparty and Sudan in 2013, are known as one of the few families of high-rate locally correctable codes. They are built through the evaluation over the affine space of multivariate polynomials whose restr
Externí odkaz:
http://arxiv.org/abs/1809.00931
Autor:
Lavauzelle, Julien
Private information retrieval (PIR) protocols allow a user to retrieve entries of a database without revealing the index of the desired item. Information-theoretical privacy can be achieved by the use of several servers and specific retrieval algorit
Externí odkaz:
http://arxiv.org/abs/1709.07952
Publikováno v:
Journal of Mathematical Cryptology, Vol 13, Iss 2, Pp 81-106 (2019)
In this paper, we show how to construct – from any linear code – a Proof of Retrievability (𝖯𝗈𝖱{\mathsf{PoR}}) which features very low computation complexity on both the client (𝖵𝖾𝗋𝗂𝖿𝗂𝖾𝗋{\mathsf{Verifier}}) and th
Externí odkaz:
https://doaj.org/article/316dcc5b411044f58ce1deb3b2fe7330
