default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançoise Levy-dit-Vehel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c9]Françoise Levy-dit-Vehel, Maxime Roméas:
Efficient Proofs of Retrievability Using Expander Codes. CANS 2022: 361-370- [i6]Françoise Levy-dit-Vehel, Maxime Roméas:
Interactivity in Constructive Cryptography : Modeling and Applications to Updatable Encryption and Private Information Retrieval. CoRR abs/2204.11653 (2022) - [i5]Françoise Levy-dit-Vehel, Maxime Roméas:
A Framework for the Design of Secure and Efficient Proofs of Retrievability. IACR Cryptol. ePrint Arch. 2022: 64 (2022) - [i4]Françoise Levy-dit-Vehel, Maxime Roméas:
Efficient Proofs of Retrievability using Expander Codes. IACR Cryptol. ePrint Arch. 2022: 764 (2022) - 2021
- [i3]Françoise Levy-dit-Vehel, Maxime Roméas:
A Composable Look at Updatable Encryption. IACR Cryptol. ePrint Arch. 2021: 538 (2021)
2010 – 2019
- 2019
- [j7]Julien Lavauzelle
, Françoise Levy-dit-Vehel:
Generic constructions of PoRs from codes and instantiations. J. Math. Cryptol. 13(2): 81-106 (2019) - 2016
- [c8]Julien Lavauzelle, Françoise Levy-dit-Vehel:
New proofs of retrievability using locally decodable codes. ISIT 2016: 1809-1813 - 2015
- [c7]Daniel Augot, Françoise Levy-dit-Vehel, Man Cuong Ngô:
Information sets of Multiplicity codes. ISIT 2015: 2401-2405 - [i2]Daniel Augot, Françoise Levy-dit-Vehel, Man Cuong Ngô:
Information Sets of Multiplicity Codes. CoRR abs/1509.00279 (2015) - 2014
- [c6]Daniel Augot, Françoise Levy-dit-Vehel, Abdullatif Shikfa:
A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers. CANS 2014: 222-239 - [i1]Daniel Augot, Françoise Levy-dit-Vehel, Abdullatif Shikfa:
A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers. CoRR abs/1412.5012 (2014) - 2010
- [j6]Françoise Levy-dit-Vehel, Ludovic Perret:
Security analysis of word problem-based cryptosystems. Des. Codes Cryptogr. 54(1): 29-41 (2010)
2000 – 2009
- 2009
- [p1]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: 285-305 - 2008
- [c5]Jean-Charles Faugère, Françoise Levy-dit-Vehel, Ludovic Perret:
Cryptanalysis of MinRank. CRYPTO 2008: 280-296 - 2005
- [c4]Françoise Levy-dit-Vehel, Ludovic Perret:
On the Wagner-Magyarik Cryptosystem. WCC 2005: 316-329 - 2004
- [c3]Françoise Levy-dit-Vehel, Ludovic Perret:
Attacks on Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups. INDOCRYPT 2004: 275-289 - 2003
- [c2]Françoise Levy-dit-Vehel, Ludovic Perret:
Polynomial Equivalence Problems and Applications to Multivariate Cryptosystems. INDOCRYPT 2003: 235-251
1990 – 1999
- 1997
- [j5]Françoise Levy-dit-Vehel, Simon Litsyn:
Parameters of Goppa codes revisited. IEEE Trans. Inf. Theory 43(6): 1811-1819 (1997) - 1996
- [j4]Françoise Levy-dit-Vehel, Simon Litsyn:
More on the covering radius of BCH codes. IEEE Trans. Inf. Theory 42(3): 1023-1028 (1996) - [j3]Daniel Augot, Françoise Levy-dit-Vehel:
Bounds on the minimum distance of the duals of BCH codes. IEEE Trans. Inf. Theory 42(4): 1257-1260 (1996) - 1995
- [j2]Françoise Levy-dit-Vehel:
Bounds on the minimum distance of the duals of extended BCH codes over \mathbbFp. Appl. Algebra Eng. Commun. Comput. 6: 175-190 (1995) - [c1]Françoise Levy-dit-Vehel, Simon Litsyn:
On the Covering Radius of Long Goppa Codes. AAECC 1995: 341-346 - 1994
- [j1]Pascale Charpin, Françoise Levy-dit-Vehel:
On Self-Dual Affine-Invariant Codes. J. Comb. Theory A 67(2): 223-244 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
