Françoise Levy-dit-Vehel

23 papers A* 1B 4Misc 2Journal 13Unranked 2
YearRankTypeTitle / Venue / Authors
2022 J jnl
A Framework for the Design of Secure and Efficient Proofs of Retrievability.
IACR Cryptol. ePrint Arch.
Françoise Levy-dit-Vehel, Maxime Roméas
2022 B conf
Efficient Proofs of Retrievability Using Expander Codes.
CANS
Françoise Levy-dit-Vehel, Maxime Roméas
2022 J jnl
Efficient Proofs of Retrievability using Expander Codes.
IACR Cryptol. ePrint Arch.
Françoise Levy-dit-Vehel, Maxime Roméas
2022 J jnl
Interactivity in Constructive Cryptography : Modeling and Applications to Updatable Encryption and Private Information Retrieval.
CoRR
Françoise Levy-dit-Vehel, Maxime Roméas
2021 J jnl
A Composable Look at Updatable Encryption.
IACR Cryptol. ePrint Arch.
Françoise Levy-dit-Vehel, Maxime Roméas
2019 J jnl
Generic constructions of PoRs from codes and instantiations.
J. Math. Cryptol.
Julien Lavauzelle, Françoise Levy-dit-Vehel
2016 B conf
New proofs of retrievability using locally decodable codes.
ISIT
Julien Lavauzelle, Françoise Levy-dit-Vehel
2015 J jnl
Information Sets of Multiplicity Codes.
CoRR
Daniel Augot, Françoise Levy-dit-Vehel, Man Cuong Ngô
2015 B conf
Information sets of Multiplicity codes.
ISIT
Daniel Augot, Françoise Levy-dit-Vehel, Man Cuong Ngô
2014 B conf
A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers.
CANS
Daniel Augot, Françoise Levy-dit-Vehel, Abdullatif Shikfa
2014 J jnl
A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers.
CoRR
Daniel Augot, Françoise Levy-dit-Vehel, Abdullatif Shikfa
2010 J jnl
Security analysis of word problem-based cryptosystems.
Des. Codes Cryptogr.
Françoise Levy-dit-Vehel, Ludovic Perret
2009 — ch.
A Survey on Polly Cracker Systems.
Gröbner Bases, Coding, and Cryptography
Françoise Levy-dit-Vehel, Maria Grazia Marinari, Ludovic Perret, Carlo Traverso
2008 A* conf
Cryptanalysis of MinRank.
CRYPTO
Jean-Charles Faugère, Françoise Levy-dit-Vehel, Ludovic Perret
2005 — conf
On the Wagner-Magyarik Cryptosystem.
WCC
Françoise Levy-dit-Vehel, Ludovic Perret
2004 Misc conf
Attacks on Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups.
INDOCRYPT
Françoise Levy-dit-Vehel, Ludovic Perret
2003 Misc conf
Polynomial Equivalence Problems and Applications to Multivariate Cryptosystems.
INDOCRYPT
Françoise Levy-dit-Vehel, Ludovic Perret
1997 J jnl
Parameters of Goppa codes revisited.
IEEE Trans. Inf. Theory
Françoise Levy-dit-Vehel, Simon Litsyn
1996 J jnl
Bounds on the minimum distance of the duals of BCH codes.
IEEE Trans. Inf. Theory
Daniel Augot, Françoise Levy-dit-Vehel
1996 J jnl
More on the covering radius of BCH codes.
IEEE Trans. Inf. Theory
Françoise Levy-dit-Vehel, Simon Litsyn
1995 J jnl
Bounds on the minimum distance of the duals of extended BCH codes over \mathbb
Appl. Algebra Eng. Commun. Comput.
Françoise Levy-dit-Vehel
1995 — conf
On the Covering Radius of Long Goppa Codes.
AAECC
Françoise Levy-dit-Vehel, Simon Litsyn
1994 J jnl
On Self-Dual Affine-Invariant Codes.
J. Comb. Theory A
Pascale Charpin, Françoise Levy-dit-Vehel