Nombre de documents

17

HAL page of Françoise Levy-dit-Vehel


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


Article dans une revue4 documents

Communication dans un congrès5 documents

  • Julien Lavauzelle, Françoise Levy-Dit-Vehel. New proofs of retrievability using locally decodable codes. International Symposium on Information Theory ISIT 2016, Jul 2016, Barcelona, Spain. pp.1809 - 1813, 2016, 〈10.1109/ISIT.2016.7541611〉. 〈hal-01413159〉
  • Daniel Augot, Françoise Levy-Dit-Vehel, Man Cuong Ngô. Information Sets of Multiplicity Codes. Information Theory (ISIT), 2015 IEEE International Symposium on , Jun 2015, Hong-Kong, China. IEEE, pp.2401 - 2405, 〈10.1109/ISIT.2015.7282886〉. 〈hal-01188935〉
  • Daniel Augot, Françoise Levy-Dit-Vehel, Abdullatif Shikfa. A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers. Dimitris Gritzalis; Aggelos Kiayias; Ioannis Askoxylakis. 13th International Conference, Cryptology and Network Security (CANS 2014) Heraklion, Crete, Greece, October 22-24, 2014. Proceedings, Oct 2014, Heraklion, Greece. Springer, 8813, pp.222 - 239, 2014, Lecture notes in computer science. 〈10.1007/978-3-319-12280-9_15〉. 〈hal-01094807〉
  • Jean-Charles Faugère, Françoise Levy-Dit-Vehel, Ludovic Perret. Cryptanalysis of MinRank. CRYPTO 2008 - 28th Annual International Cryptology Conference, Aug 2008, Santa Barbara, CA, United States. Springer, Advances in Cryptology – CRYPTO 2008, 5157, pp.280-296, 2008, Lecture Notes in Computer Science. 〈10.1007/978-3-540-85174-5_16〉. 〈hal-00976374〉
  • Daniel Augot, Françoise Levy-Dit-Vehel. Bounds on the minimum distance of the duals of BCH codes. 1994 IEEE International Symposium on Information Theory, Jun 1994, Trondheim, Norway. IEEE, pp.43, 1994, 1994 IEEE International Symposium on Information Theory, Proceedings. 〈http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=394928〉. 〈10.1109/ISIT.1994.394928〉. 〈inria-00509482〉

Chapitre d'ouvrage2 documents

  • Françoise Levy-Dit-Vehel, Ludovic Perret. A Polly Cracker System Based on Satisfiability. 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〉. 〈hal-00988797〉
  • Françoise Levy-Dit-Vehel, Ludovic Perret. Attacks on Public-Key Cryptosystems Based on Free Partially Commutative Monoids and Groups. 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〉. 〈hal-00988804〉

Brevet1 document

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

Rapport5 documents

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