Françoise Levy-Dit-Vehel

Présentation

I am teacher-researcher, HDR, at ENSTA ParisTech, and also associate researcher at INRIA Saclay team GRACE : Geometry, aRithmetic, Algorithms for Codes and Encryption.I am a member of LIX.A full CV is available on demand : levy [at] ensta [dot] fr

Publications

Article dans une revue (5)

Generic constructions of PoRs from codes and instantiations Julien Lavauzelle,Françoise Levy-Dit-Vehel Journal of Mathematical Cryptology, In press, 13 (2), pp.81--106. ⟨10.1515/jmc-2018-0018⟩ Article dans une revue hal-02053948v1
Security Analysis of Word Problem-Based Cryptosystems Françoise Levy-Dit-Vehel,Ludovic Perret Designs, Codes and Cryptography, 2010, 54 (1), pp.29-41. ⟨10.1007/s10623-009-9307-x⟩ Article dans une revue istex hal-00974889v1
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 Article dans une revue hal-00974896v1
On Wagner-Magyarik Cryptosystem Françoise Levy-Dit-Vehel,Ludovic Perret Lecture Notes in Computer Science, 2006, 3969, pp.316-329. ⟨10.1007/11779360_25⟩ Article dans une revue istex hal-00978821v1
Bounds on the minimum distance of the duals of BCH codes Daniel Augot,Françoise Levy-Dit-Vehel IEEE Transactions on Information Theory, 1996, 42 (4), pp.1257 - 1260. ⟨10.1109/18.508853⟩ Article dans une revue inria-00509478v1

Communication dans un congrès (7)

Efficient Proofs of Retrievability using Expander Codes Françoise Levy-Dit-Vehel,Maxime Roméas CANS 2022 - 21st International Conference on Cryptology and Network Security, Nov 2022, Abu Dhabi, United Arab Emirates Communication dans un congrès hal-03886784v1
A Framework for the Design of Secure and Efficient Proofs of Retrievability Françoise Levy-Dit-Vehel,Maxime Roméas I4CS 2022 - International Conference on Cryptology, Coding Theory, and Cybsersecurity, Oct 2022, Casablanca, Morocco Communication dans un congrès hal-03886792v1
New proofs of retrievability using locally decodable codes Julien Lavauzelle,Françoise Levy-Dit-Vehel International Symposium on Information Theory ISIT 2016, Jul 2016, Barcelona, Spain. pp.1809 - 1813, ⟨10.1109/ISIT.2016.7541611⟩ Communication dans un congrès hal-01413159v1
Information Sets of Multiplicity Codes Daniel Augot,Françoise Levy-Dit-Vehel,Man Cuong Ngô Information Theory (ISIT), 2015 IEEE International Symposium on , Jun 2015, Hong-Kong, China. pp.2401 - 2405, ⟨10.1109/ISIT.2015.7282886⟩ Communication dans un congrès hal-01188935v1
A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers Daniel Augot,Françoise Levy-Dit-Vehel,Abdullatif Shikfa 13th International Conference, Cryptology and Network Security (CANS), Oct 2014, Heraklion, Greece. pp.222 - 239, ⟨10.1007/978-3-319-12280-9_15⟩ Communication dans un congrès hal-01094807v1
Cryptanalysis of MinRank Jean-Charles Faugère,Françoise Levy-Dit-Vehel,Ludovic Perret CRYPTO 2008 - 28th Annual International Cryptology Conference, Aug 2008, Santa Barbara, CA, United States. pp.280-296, ⟨10.1007/978-3-540-85174-5_16⟩ Communication dans un congrès istex hal-00976374v1
Bounds on the minimum distance of the duals of BCH codes Daniel Augot,Françoise Levy-Dit-Vehel 1994 IEEE International Symposium on Information Theory, Jun 1994, Trondheim, Norway. pp.43, ⟨10.1109/ISIT.1994.394928⟩ Communication dans un congrès inria-00509482v1

Chapitre d'ouvrage (2)

A Polly Cracker System Based on Satisfiability Françoise Levy-Dit-Vehel,Ludovic Perret Progress in Computer Science and Applied Logic Volume 23, 23, Springer, pp.177-192, 2004, 978-3-0348-9602-3. ⟨10.1007/978-3-0348-7865-4_11⟩ Chapitre d'ouvrage istex hal-00988797v1
Attacks on Public-Key Cryptosystems Based on Free Partially Commutative Monoids and Groups Françoise Levy-Dit-Vehel,Ludovic Perret Progress in Cryptology - INDOCRYPT 2004, 3348, Springer, pp.275-289, 2004, Lecture Notes in Computer Science, 978-3-540-24130-0. ⟨10.1007/978-3-540-30556-9_22⟩ Chapitre d'ouvrage istex hal-00988804v1

Brevet (1)

Storage efficient and unconditionnally secure private information retrieval Daniel Augot,Françoise Levy-Dit-Vehel,Abdullatif Shikfa France, Patent n° : 14305549.9. 2014 Brevet hal-01111694v1

Pré-publication, Document de travail (1)

A Composable Look at Updatable Encryption Françoise Levy-Dit-Vehel,Maxime Roméas 2022 Pré-publication, Document de travail hal-03531837v1

Rapport (5)

Polynomial equivalence problems and applications to multivariate cryptosystems Françoise Levy-Dit-Vehel,Ludovic Perret [Research Report] RR-5119, INRIA. 2004 Rapport (rapport de recherche) inria-00071464v1
A Polly Cracker system based on Satisfiability Françoise Levy-Dit-Vehel,Ludovic Perret [Research Report] RR-4698, INRIA. 2003 Rapport (rapport de recherche) inria-00071888v1
More on the Covering Radius of BCH Codes Françoise Levy-Dit-Vehel,Simon Litsyn [Research Report] RR-2656, INRIA. 1995 Rapport (rapport de recherche) inria-00074033v1
On duals of binary primitive BCH codes Françoise Levy-Dit-Vehel [Research Report] RR-1835, INRIA. 1993 Rapport (rapport de recherche) inria-00074836v1
On self-dual affine-invariant codes Pascale Charpin,Françoise Levy-Dit-Vehel [Research Report] RR-1844, INRIA. 1993 Rapport (rapport de recherche) inria-00074828v1