Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Julien Lavauzelle"'
Autor:
Julien Lavauzelle, Jade Nardi
Publikováno v:
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory, 2021, 67 (1), pp.111-123. ⟨10.1109/TIT.2020.3020752⟩
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2021, 67 (1), pp.111-123. ⟨10.1109/TIT.2020.3020752⟩
IEEE Transactions on Information Theory, 2021, 67 (1), pp.111-123. ⟨10.1109/TIT.2020.3020752⟩
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2021, 67 (1), pp.111-123. ⟨10.1109/TIT.2020.3020752⟩
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
Publikováno v:
Journal of Mathematical Cryptology, Vol 13, Iss 2, Pp 81-106 (2019)
Journal of Mathematical Cryptology
Journal of Mathematical Cryptology, In press, 13 (2), pp.81--106. ⟨10.1515/jmc-2018-0018⟩
Journal of Mathematical Cryptology, De Gruyter, In press, 13 (2), pp.81--106. ⟨10.1515/jmc-2018-0018⟩
Journal of Mathematical Cryptology
Journal of Mathematical Cryptology, In press, 13 (2), pp.81--106. ⟨10.1515/jmc-2018-0018⟩
Journal of Mathematical Cryptology, De Gruyter, In press, 13 (2), pp.81--106. ⟨10.1515/jmc-2018-0018⟩
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}} )
Autor:
Julien Lavauzelle, Sarah Bordage
Publikováno v:
Cryptography and Communications-Discrete Structures, Boolean Functions and Sequences
Cryptography and Communications-Discrete Structures, Boolean Functions and Sequences, 2021, 13 (4), pp.519-526. ⟨10.1007/s12095-021-00477-z⟩
Cryptography and Communications-Discrete Structures, Boolean Functions and Sequences, Springer, 2021, ⟨10.1007/s12095-021-00477-z⟩
Cryptography and Communications-Discrete Structures, Boolean Functions and Sequences, 2021, 13 (4), pp.519-526. ⟨10.1007/s12095-021-00477-z⟩
Cryptography and Communications-Discrete Structures, Boolean Functions and Sequences, Springer, 2021, ⟨10.1007/s12095-021-00477-z⟩
We show that the single-server computational PIR protocol proposed by Holzbaur, Hollanti and Wachter-Zeh in [6] 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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92d52a533fc00741710799b49e1bd105
https://hal.inria.fr/hal-03181082
https://hal.inria.fr/hal-03181082
Publikováno v:
IEEE Transactions on Information Forensics and Security
IEEE Transactions on Information Forensics and Security, 2021, 16, pp.441-450. ⟨10.1109/TIFS.2020.3003572⟩
IEEE Transactions on Information Forensics and Security, Institute of Electrical and Electronics Engineers, 2021, 16, pp.441-450. ⟨10.1109/TIFS.2020.3003572⟩
IEEE Transactions on Information Forensics and Security, 2021, 16, pp.441-450. ⟨10.1109/TIFS.2020.3003572⟩
IEEE Transactions on Information Forensics and Security, Institute of Electrical and Electronics Engineers, 2021, 16, pp.441-450. ⟨10.1109/TIFS.2020.3003572⟩
International audience; 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 storag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::673bcefebd938fd038322c47fd65cfd8
http://hdl.handle.net/10138/345378
http://hdl.handle.net/10138/345378
Publikováno v:
SIAM Journal on Applied Algebra and Geometry
SIAM Journal on Applied Algebra and Geometry, Society for Industrial and Applied Mathematics 2021, 5 (2), pp.165-199. ⟨10.1137/20M1348583⟩
SIAM Journal on Applied Algebra and Geometry, 2021, 5 (2), pp.165-199. ⟨10.1137/20M1348583⟩
SIAM Journal on Applied Algebra and Geometry, Society for Industrial and Applied Mathematics 2021, 5 (2), pp.165-199. ⟨10.1137/20M1348583⟩
SIAM Journal on Applied Algebra and Geometry, 2021, 5 (2), pp.165-199. ⟨10.1137/20M1348583⟩
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20eb53fdeebf8785ed02f3ccd07f5f15
https://hal.archives-ouvertes.fr/hal-02882019
https://hal.archives-ouvertes.fr/hal-02882019
Autor:
Julien Lavauzelle
Publikováno v:
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory, 2019, 65 (2), pp.1189-1205. ⟨10.1109/TIT.2018.2861747⟩
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2019, 65 (2), pp.1189-1205. ⟨10.1109/TIT.2018.2861747⟩
IEEE Transactions on Information Theory, 2019, 65 (2), pp.1189-1205. ⟨10.1109/TIT.2018.2861747⟩
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2019, 65 (2), pp.1189-1205. ⟨10.1109/TIT.2018.2861747⟩
International audience; 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 sp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9023a3caa0b95ec74803b8b9e328547e
https://hal.science/hal-01901014
https://hal.science/hal-01901014
Autor:
Julien Lavauzelle
Publikováno v:
Designs, Codes and Cryptography
Designs, Codes and Cryptography, Springer Verlag, In press, ⟨10.1007/s10623-018-0552-8⟩
Designs, Codes and Cryptography, 2019, 87, pp.1541-1575. ⟨10.1007/s10623-018-0552-8⟩
Designs, Codes and Cryptography, Springer Verlag, In press, ⟨10.1007/s10623-018-0552-8⟩
Designs, Codes and Cryptography, 2019, 87, pp.1541-1575. ⟨10.1007/s10623-018-0552-8⟩
Lifted Reed–Solomon codes, introduced by Guo et al. (in: Kleinberg (ed) Proceedings of the 4th conference on innovations in theoretical computer science, ITCS’13, ACM, New York, 2013), are known as one of the few families of high-rate locally cor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::84c4f57a772962e2a8ecd62ea186a253
https://hal.archives-ouvertes.fr/hal-01901147
https://hal.archives-ouvertes.fr/hal-01901147
Autor:
Evelyne Lutton, Franck Vidal, Zainab Ali Abbood, Jean-Marie Rocchisani, Julien Lavauzelle, Jean Louchet
Publikováno v:
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation, Elsevier, 2017, 36, pp.91-105. ⟨10.1016/j.swevo.2017.04.001⟩
Swarm and Evolutionary Computation, Elsevier, 2017, 36, pp.91-105. ⟨10.1016/j.swevo.2017.04.001⟩
International audience; The Fly Algorithm was initially developed for 3-D robot vision applications. It consists in solving the inverse problem of shape reconstruction from projections by evolving a population of 3-D points in space (the 'flies'), us
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b66a649d2c7a170d7025f4f2d1c8225e
https://hal.inrae.fr/hal-02621816
https://hal.inrae.fr/hal-02621816
Publikováno v:
International Symposium on Information Theory ISIT 2016
International Symposium on Information Theory ISIT 2016, Jul 2016, Barcelona, Spain. pp.1809-1813, ⟨10.1109/ISIT.2016.7541611⟩
ISIT
International Symposium on Information Theory ISIT 2016, Jul 2016, Barcelona, Spain. pp.1809-1813, ⟨10.1109/ISIT.2016.7541611⟩
ISIT
International audience; Proofs of retrievability (PoR) are probabilistic protocols which ensure that a client can recover a file he previously stored on a server. Good PoRs aim at reaching an efficient trade-off between communication complexity and s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2df75616e73f5aa00161d4cd0ebbfc27
https://hal.archives-ouvertes.fr/hal-01413159/file/liftedPoR.pdf
https://hal.archives-ouvertes.fr/hal-01413159/file/liftedPoR.pdf
Autor:
Julian Renner, Julien Lavauzelle
Publikováno v:
Designs, Codes and Cryptography
Designs, Codes and Cryptography, 2020, 88 (7), pp.1285-1300. ⟨10.1007/s10623-020-00747-6⟩
Designs, Codes and Cryptography, Springer Verlag, 2020, 88 (7), pp.1285-1300. ⟨10.1007/s10623-020-00747-6⟩
Designs, Codes and Cryptography, 2020, 88 (7), pp.1285-1300. ⟨10.1007/s10623-020-00747-6⟩
Designs, Codes and Cryptography, Springer Verlag, 2020, 88 (7), pp.1285-1300. ⟨10.1007/s10623-020-00747-6⟩
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