Number of documents

18

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


Journal articles5 documents

  • Julien Lavauzelle, Françoise Levy-Dit-Vehel. Generic constructions of PoRs from codes and instantiations. Journal of Mathematical Cryptology, De Gruyter, In press, ⟨10.1515/jmc-2018-0018⟩. ⟨hal-02053948⟩
  • Françoise Levy-Dit-Vehel, Ludovic Perret. Security Analysis of Word Problem-Based Cryptosystems. Designs, Codes and Cryptography, Springer Verlag, 2010, 54 (1), pp.29-41. ⟨10.1007/s10623-009-9307-x⟩. ⟨hal-00974889⟩
  • Françoise Levy-Dit-Vehel, Maria-Grazia Marinari, Ludovic Perret, Carlo Traverso. A survey on Polly Cracker Systems. Gröbner Bases, Coding, and Cryptography, 2009. ⟨hal-00974896⟩
  • Françoise Levy-Dit-Vehel, Ludovic Perret. On Wagner-Magyarik Cryptosystem. Lecture Notes in Computer Science, Springer, 2006, 3969, pp.316-329. ⟨10.1007/11779360_25⟩. ⟨hal-00978821⟩
  • Daniel Augot, Françoise Levy-Dit-Vehel. Bounds on the minimum distance of the duals of BCH codes. IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 1996, 42 (4), pp.1257 - 1260. ⟨10.1109/18.508853⟩. ⟨inria-00509478⟩

Conference papers5 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, ⟨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. 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. 13th International Conference, Cryptology and Network Security (CANS), Oct 2014, Heraklion, Greece. pp.222 - 239, ⟨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. pp.280-296, ⟨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. pp.43, ⟨10.1109/ISIT.1994.394928⟩. ⟨inria-00509482⟩

Book sections2 documents

  • 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⟩
  • 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⟩

Patents1 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⟩

Reports5 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⟩