Françoise Levy-dit-Vehel

According to our database, Françoise Levy-dit-Vehel authored at least 20 papers between 1994 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Efficient Proofs of Retrievability using Expander Codes.

Françoise Levy-dit-Vehel, Maxime Roméas

IACR Cryptol. ePrint Arch., 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

Interactivity in Constructive Cryptography : Modeling and Applications to Updatable Encryption and Private Information Retrieval.

Françoise Levy-dit-Vehel, Maxime Roméas

CoRR, 2022

2021

A Composable Look at Updatable Encryption.

Françoise Levy-dit-Vehel, Maxime Roméas

IACR Cryptol. ePrint Arch., 2021

2019

Generic constructions of PoRs from codes and instantiations.

Julien Lavauzelle, Françoise Levy-dit-Vehel

J. Math. Cryptol., 2019

2016

New proofs of retrievability using locally decodable codes.

Julien Lavauzelle, Françoise Levy-dit-Vehel

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Information sets of Multiplicity codes.

Daniel Augot, Françoise Levy-dit-Vehel, Man Cuong Ngô

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers.

Daniel Augot, Françoise Levy-dit-Vehel, Abdullatif Shikfa

Proceedings of the Cryptology and Network Security - 13th International Conference, 2014

2010

Security analysis of word problem-based cryptosystems.

Françoise Levy-dit-Vehel, Ludovic Perret

Des. Codes Cryptogr., 2010

2009

A Survey on Polly Cracker Systems.

Françoise Levy-dit-Vehel, Maria Grazia Marinari, Ludovic Perret, Carlo Traverso

Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

2008

Cryptanalysis of MinRank.

Jean-Charles Faugère, Françoise Levy-dit-Vehel, Ludovic Perret

Proceedings of the Advances in Cryptology, 2008

2005

On the Wagner-Magyarik Cryptosystem.

Françoise Levy-dit-Vehel, Ludovic Perret

Proceedings of the Coding and Cryptography, International Workshop, 2005

2004

Attacks on Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups.

Françoise Levy-dit-Vehel, Ludovic Perret

Proceedings of the Progress in Cryptology, 2004

2003

Polynomial Equivalence Problems and Applications to Multivariate Cryptosystems.

Françoise Levy-dit-Vehel, Ludovic Perret

Proceedings of the Progress in Cryptology, 2003

1997

Parameters of Goppa codes revisited.

Françoise Levy-dit-Vehel, Simon Litsyn

IEEE Trans. Inf. Theory, 1997

1996

More on the covering radius of BCH codes.

Françoise Levy-dit-Vehel, Simon Litsyn

IEEE Trans. Inf. Theory, 1996

Bounds on the minimum distance of the duals of BCH codes.

Daniel Augot, Françoise Levy-dit-Vehel

IEEE Trans. Inf. Theory, 1996

1995

Bounds on the minimum distance of the duals of extended BCH codes over \mathbb<i>F</i>_<i>p</i>.

Françoise Levy-dit-Vehel

Appl. Algebra Eng. Commun. Comput., 1995

On the Covering Radius of Long Goppa Codes.

Françoise Levy-dit-Vehel, Simon Litsyn

Proceedings of the Applied Algebra, 1995

1994

On Self-Dual Affine-Invariant Codes.

Pascale Charpin, Françoise Levy-dit-Vehel

J. Comb. Theory A, 1994