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
Publications
|
|
Generic constructions of PoRs from codes and instantiationsJournal of Mathematical Cryptology, In press, 13 (2), pp.81--106. ⟨10.1515/jmc-2018-0018⟩ |
Security Analysis of Word Problem-Based CryptosystemsDesigns, Codes and Cryptography, 2010, 54 (1), pp.29-41. ⟨10.1007/s10623-009-9307-x⟩ |
|
A survey on Polly Cracker SystemsGröbner Bases, Coding, and Cryptography, 2009 |
|
On Wagner-Magyarik CryptosystemLecture Notes in Computer Science, 2006, 3969, pp.316-329. ⟨10.1007/11779360_25⟩ |
|
|
|
Bounds on the minimum distance of the duals of BCH codesIEEE Transactions on Information Theory, 1996, 42 (4), pp.1257 - 1260. ⟨10.1109/18.508853⟩ |
|
|
Efficient Proofs of Retrievability using Expander CodesCANS 2022 - 21st International Conference on Cryptology and Network Security, Nov 2022, Abu Dhabi, United Arab Emirates |
|
|
A Framework for the Design of Secure and Efficient Proofs of RetrievabilityI4CS 2022 - International Conference on Cryptology, Coding Theory, and Cybsersecurity, Oct 2022, Casablanca, Morocco |
|
|
New proofs of retrievability using locally decodable codesInternational Symposium on Information Theory ISIT 2016, Jul 2016, Barcelona, Spain. pp.1809 - 1813, ⟨10.1109/ISIT.2016.7541611⟩ |
|
|
Information Sets of Multiplicity CodesInformation Theory (ISIT), 2015 IEEE International Symposium on , Jun 2015, Hong-Kong, China. pp.2401 - 2405, ⟨10.1109/ISIT.2015.7282886⟩ |
|
|
A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers13th International Conference, Cryptology and Network Security (CANS), Oct 2014, Heraklion, Greece. pp.222 - 239, ⟨10.1007/978-3-319-12280-9_15⟩ |
Cryptanalysis of MinRankCRYPTO 2008 - 28th Annual International Cryptology Conference, Aug 2008, Santa Barbara, CA, United States. pp.280-296, ⟨10.1007/978-3-540-85174-5_16⟩ |
|
|
|
Bounds on the minimum distance of the duals of BCH codes1994 IEEE International Symposium on Information Theory, Jun 1994, Trondheim, Norway. pp.43, ⟨10.1109/ISIT.1994.394928⟩ |
A Polly Cracker System Based on SatisfiabilityProgress 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⟩ |
|
Attacks on Public-Key Cryptosystems Based on Free Partially Commutative Monoids and GroupsProgress 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⟩ |
Storage efficient and unconditionnally secure private information retrievalFrance, Patent n° : 14305549.9. 2014 |
|
|
A Composable Look at Updatable Encryption2022 |
|
|
Polynomial equivalence problems and applications to multivariate cryptosystems[Research Report] RR-5119, INRIA. 2004 |
|
|
A Polly Cracker system based on Satisfiability[Research Report] RR-4698, INRIA. 2003 |
|
|
More on the Covering Radius of BCH Codes[Research Report] RR-2656, INRIA. 1995 |
|
|
On duals of binary primitive BCH codes[Research Report] RR-1835, INRIA. 1993 |
|
|
On self-dual affine-invariant codes[Research Report] RR-1844, INRIA. 1993 |