معرفی
Françoise LEVY-DIT-VEHEL is a Professor and HDR (Habilitation à Diriger des Recherches) holder at ENSTA Paris, part of Institut Polytechnique de Paris (IP Paris), within the Computer Science and Systems Engineering Unit (U2IS). She serves as an associate researcher in the GRACE team at INRIA Saclay and is a member of LIX (Polytechnique computer science laboratory). Her academic roles include teaching cryptography courses at the third-year level and specialized master's degree in Information Systems Architecture, discrete mathematics for information protection at the second-year level, and previously taught algorithms at the first-year level (2006). She actively participates in the IP Paris Cybersecurity Master's degree committee (M1/M2) and has taught discrete mathematics at MPRI (2007, 2011).
Her research focuses on securing large remote data sets through cryptographic protocols, particularly Private Information Retrieval and Proofs of Retrievability based on Locally Decodable/Correctable Codes. She also investigates Function Secret Sharing, Homomorphic Secret Sharing, and has previously worked extensively in public-key cryptography, studying algebraic problems underlying cryptographic schemes. Her current research explores interactive cryptographic protocols for privacy protection and efficient secure remote storage solutions.
Analysis of her recent publications reveals a strong focus on cryptographic protocols for data integrity and privacy in cloud environments. Her work consistently bridges theoretical cryptography with practical applications, particularly in remote data verification and secure information retrieval. The trend shows increasing specialization in proofs of retrievability and updatable encryption systems, with growing emphasis on composable security frameworks.
She has made significant contributions to several research areas including coding for remote storage (with D. Augot), Polly Cracker-type schemes (with Carlo Traverso, Téo Mora and Ludovic Perret), word problems in monoids/groups, rank-metric decoding, and the MinRank problem. Her work on the MinRank problem has been particularly influential in both cryptographic design and cryptanalysis.
Françoise LEVY-DIT-VEHEL obtained her HDR (accreditation to direct research) from Paris 6 University in September 2010 and completed her PhD "Divisibilité des codes cycliques: applications et prolongements" at Université Pierre et Marie Curie in October 1994. She has authored or co-authored numerous publications in top cryptography venues and holds several patents related to cryptographic systems.
Her laboratory affiliations include the Computer Science and Systems Engineering Unit (U2IS) at ENSTA Paris, the GRACE research team at INRIA Saclay, and LIX (Laboratoire d'Informatique de l'École Polytechnique). These institutions form a collaborative research ecosystem focused on advancing cryptographic techniques with practical applications in data security and privacy.
