Françoise Levy-dit-Vehel

According to our database1, Françoise Levy-dit-Vehel authored at least 20 papers between 1994 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Efficient Proofs of Retrievability using Expander Codes.
IACR Cryptol. ePrint Arch., 2022

A Framework for the Design of Secure and Efficient Proofs of Retrievability.
IACR Cryptol. ePrint Arch., 2022

Interactivity in Constructive Cryptography : Modeling and Applications to Updatable Encryption and Private Information Retrieval.
CoRR, 2022

2021
A Composable Look at Updatable Encryption.
IACR Cryptol. ePrint Arch., 2021

2019
Generic constructions of PoRs from codes and instantiations.
J. Math. Cryptol., 2019

2016
New proofs of retrievability using locally decodable codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Information sets of Multiplicity codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers.
Proceedings of the Cryptology and Network Security - 13th International Conference, 2014

2010
Security analysis of word problem-based cryptosystems.
Des. Codes Cryptogr., 2010

2009
A Survey on Polly Cracker Systems.
Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

2008
Cryptanalysis of MinRank.
Proceedings of the Advances in Cryptology, 2008

2005
On the Wagner-Magyarik Cryptosystem.
Proceedings of the Coding and Cryptography, International Workshop, 2005

2004
Attacks on Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups.
Proceedings of the Progress in Cryptology, 2004

2003
Polynomial Equivalence Problems and Applications to Multivariate Cryptosystems.
Proceedings of the Progress in Cryptology, 2003

1997
Parameters of Goppa codes revisited.
IEEE Trans. Inf. Theory, 1997

1996
More on the covering radius of BCH codes.
IEEE Trans. Inf. Theory, 1996

Bounds on the minimum distance of the duals of BCH codes.
IEEE Trans. Inf. Theory, 1996

1995
Bounds on the minimum distance of the duals of extended BCH codes over \mathbb<i>F</i><sub><i>p</i></sub>.
Appl. Algebra Eng. Commun. Comput., 1995

On the Covering Radius of Long Goppa Codes.
Proceedings of the Applied Algebra, 1995

1994
On Self-Dual Affine-Invariant Codes.
J. Comb. Theory A, 1994


  Loading...