On Self-Dual Affine-Invariant Codes. - Pascale Charpin; Françoise Levy-dit-Vehel (J. Comb. Theory A, 1994)

On the Covering Radius of Long Goppa Codes. - Françoise Levy-dit-Vehel; Simon Litsyn (AAECC, 1995)

Bounds on the minimum distance of the duals of extended BCH codes over mathbbFp. - Françoise Levy-dit-Vehel (Appl. Algebra Eng. Commun. Comput., 1995)

Bounds on the minimum distance of the duals of BCH codes. - Daniel Augot; Françoise Levy-dit-Vehel (IEEE Trans. Inf. Theory, 1996)

More on the covering radius of BCH codes. - Françoise Levy-dit-Vehel; Simon Litsyn (IEEE Trans. Inf. Theory, 1996)

Parameters of Goppa codes revisited. - Françoise Levy-dit-Vehel; Simon Litsyn (IEEE Trans. Inf. Theory, 1997)

Polynomial Equivalence Problems and Applications to Multivariate Cryptosystems. - Françoise Levy-dit-Vehel; Ludovic Perret (INDOCRYPT, 2003)

Attacks on Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups. - Françoise Levy-dit-Vehel; Ludovic Perret (INDOCRYPT, 2004)

On the Wagner-Magyarik Cryptosystem. - Françoise Levy-dit-Vehel; Ludovic Perret (WCC, 2005)

Cryptanalysis of MinRank. - Jean-Charles Faugère; Françoise Levy-dit-Vehel; Ludovic Perret (CRYPTO, 2008)

A Survey on Polly Cracker Systems. - Françoise Levy-dit-Vehel; Maria Grazia Marinari; Ludovic Perret; Carlo Traverso (Gröbner Bases, Coding, and Cryptography, 2009)

Security analysis of word problem-based cryptosystems. - Françoise Levy-dit-Vehel; Ludovic Perret (Des. Codes Cryptogr., 2010)

A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers. - Daniel Augot; Françoise Levy-dit-Vehel; Abdullatif Shikfa (CANS, 2014)

Information sets of Multiplicity codes. - Daniel Augot; Françoise Levy-dit-Vehel; Man Cuong Ngô (ISIT, 2015)

New proofs of retrievability using locally decodable codes. - Julien Lavauzelle; Françoise Levy-dit-Vehel (ISIT, 2016)

Generic constructions of PoRs from codes and instantiations. - Julien Lavauzelle; Françoise Levy-dit-Vehel (J. Math. Cryptol., 2019)

A Composable Look at Updatable Encryption. - Françoise Levy-dit-Vehel; Maxime Roméas (IACR Cryptol. ePrint Arch., 2021)

Interactivity in Constructive Cryptography : Modeling and Applications to Updatable Encryption and Private Information Retrieval. - Françoise Levy-dit-Vehel; Maxime Roméas (CoRR, 2022)

A Framework for the Design of Secure and Efficient Proofs of Retrievability. - Françoise Levy-dit-Vehel; Maxime Roméas (IACR Cryptol. ePrint Arch., 2022)

Efficient Proofs of Retrievability using Expander Codes. - Françoise Levy-dit-Vehel; Maxime Roméas (IACR Cryptol. ePrint Arch., 2022)