A code-based group signature scheme, Designs, Codes and Cryptography, vol.82, issue.1-2, pp.469-493, 2017. ,
DOI : 10.1007/978-3-642-10366-7_6
A Practical Group Signature Scheme Based on Rank Metric, Arithmetic of Finite Fields -6th International Workshop, WAIFI 2016, pp.258-275, 2016. ,
DOI : 10.1007/978-3-319-29360-8_2
Cryptography with constant input locality, CRYPTO 2007, pp.92-110 ,
DOI : 10.1007/978-3-642-17367-7_8
Blind Signatures for Untraceable Payments, Advances in Cryptology -CRYPTO 1982, pp.199-203, 1982. ,
DOI : 10.1007/978-1-4757-0602-4_18
How to achieve a McEliecebased digital signature scheme, ASIACRYPT 2001, pp.157-174, 2001. ,
DOI : 10.1007/3-540-45682-1_10
URL : https://hal.archives-ouvertes.fr/inria-00072511
A distinguisher for high rate McEliece cryptosystems, ITW 2011, pp.282-286, 2011. ,
How To Prove Yourself: Practical Solutions to Identification and Signature Problems, CRYPTO '86, pp.186-194 ,
DOI : 10.1007/3-540-47721-7_12
URL : http://dsns.csie.nctu.edu.tw/research/crypto/HTML/PDF/C86/186.PDF
Parallel-CFS, SAC, pp.159-170, 2010. ,
DOI : 10.1007/3-540-45708-9_19
Round-Optimal Composable Blind Signatures in the Common Reference String Model, CRYPTO 2006, pp.60-77 ,
DOI : 10.1007/11818175_4
RankSynd a PRNG Based on Rank Metric, proceedings of PQCrypto 2016, pp.18-28 ,
DOI : 10.1007/978-3-319-29360-8_2
URL : https://hal.archives-ouvertes.fr/hal-01289338
On the Complexity of the Rank Syndrome Decoding Problem, IEEE Transactions on Information Theory, vol.62, issue.2, pp.1006-1019, 2016. ,
DOI : 10.1109/TIT.2015.2511786
URL : https://hal.archives-ouvertes.fr/hal-01280904
New results for rankbased cryptography, AFRICACRYPT 2014, pp.1-12, 2014. ,
DOI : 10.1007/978-3-319-06734-6_1
URL : https://hal.archives-ouvertes.fr/hal-01261421
RankSign: An Efficient Signature Algorithm Based on the Rank Metric, Post-Quantum Cryptography, pp.88-107, 2014. ,
DOI : 10.1007/978-3-319-11659-4_6
URL : https://hal.archives-ouvertes.fr/hal-01261425
Full Cryptanalysis of the Chen Identification Protocol, Post-Quantum Cryptography, pp.35-50, 2011. ,
DOI : 10.1007/s002000050053
URL : https://hal.archives-ouvertes.fr/hal-00776245
On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes, IEEE Transactions on Information Theory, vol.62, issue.12, pp.7245-7252, 2016. ,
DOI : 10.1109/TIT.2016.2616127
URL : https://hal.archives-ouvertes.fr/hal-01443111
Efficient Round Optimal Blind Signatures, EUROCRYPT 2014, pp.477-495, 2014. ,
DOI : 10.1007/978-3-642-55220-5_27
Implementing CFS, IN- DOCRYPT 2012, pp.474-488, 2012. ,
DOI : 10.1007/978-3-642-34931-7_27
URL : https://hal.archives-ouvertes.fr/hal-00880644
Security Arguments for Digital Signatures and Blind Signatures, Journal of Cryptology, vol.13, issue.3, pp.361-396, 2000. ,
DOI : 10.1007/s001450010003
URL : http://www.di.ens.fr/~stern/data/St75.ps
Lattice-Based Blind Signatures, ASIACRYPT, pp.413-430, 2010. ,
DOI : 10.1007/978-3-642-17373-8_24
A new paradigm for public key identification, IEEE Transactions on Information Theory, vol.42, issue.6, pp.1757-1768, 1996. ,
DOI : 10.1109/18.556672
URL : http://www.di.ens.fr/~stern/data/St55b.ps
A new identification scheme based on syndrome decoding, CRYPTO93, pp.13-21, 1994. ,
DOI : 10.1007/3-540-48329-2_2