A New Efficient Threshold Ring Signature Scheme Based on Coding Theory, PQCrypto 2008, pp.1-16, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00335230
A New Efficient Threshold Ring Signature Scheme Based on Coding Theory, IEEE Transactions on Information Theory, vol.57, issue.7, pp.4833-4842, 2011. ,
DOI : 10.1109/TIT.2011.2145950
URL : https://hal.archives-ouvertes.fr/hal-00335230
A new zero-knowledge code based identification scheme with reduced communication, 2011. ,
Extended security arguments for (ring) signature schemes, p.68, 2012. ,
Some new NP-complete coding problems, Problemy Peredachi Informatsii, vol.30, pp.23-28, 1994. ,
Quasi-Dyadic CFS Signatures, Inscrypt 2010, pp.336-349, 2011. ,
DOI : 10.1007/978-3-642-21518-6_23
URL : https://hal.archives-ouvertes.fr/hal-00870939
Decoding Random Binary Linear Codes in 2 n/20: How 1???+???1???=???0 Improves Information Set Decoding, EUROCRYPT 2012, pp.520-536, 2012. ,
DOI : 10.1007/978-3-642-29011-4_31
On the inherent intractability of certain coding problems (Corresp.), IEEE Transactions on Information Theory, vol.24, issue.3, pp.384-386, 1978. ,
DOI : 10.1109/TIT.1978.1055873
Smaller Decoding Exponents: Ball-Collision Decoding, CRYPTO 2011, pp.743-760, 2011. ,
DOI : 10.1007/978-3-642-22792-9_42
McEliece Cryptosystem Implementation: Theory and Practice, PQCrypto 2008, pp.47-62, 2008. ,
DOI : 10.1109/4234.823536
Threshold Ring Signatures and Applications to Ad-hoc Groups, CRYPTO 2002, pp.465-480, 2002. ,
DOI : 10.1007/3-540-45708-9_30
A Lattice-Based Threshold Ring Signature Scheme, LATINCRYPT 2010, pp.255-272, 2010. ,
DOI : 10.1007/978-3-642-14712-8_16
A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem, SAC 2010, pp.171-186, 2011. ,
DOI : 10.1007/s002000050053
How to Achieve a McEliece-Based 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
Provably Secure Code-Based Threshold Ring Signatures, Cryptography and Coding 2009, pp.222-235, 2009. ,
DOI : 10.1007/978-3-642-10868-6_13
URL : https://hal.archives-ouvertes.fr/hal-01082399
How To Prove Yourself: Practical Solutions to Identification and Signature Problems, CRYPTO 1986, pp.186-194, 1987. ,
DOI : 10.1007/3-540-47721-7_12
Zero knowledge proofs of identity, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.210-217, 1987. ,
DOI : 10.1145/28395.28419
Lightweight code-based authentication and signature, IEEE International Symposium on Information Theory?ISIT 2007, pp.191-195, 2007. ,
Forking Lemmas for Ring Signature Schemes, INDOCRYPT 2003, pp.266-279, 2003. ,
DOI : 10.1007/978-3-540-24582-7_20
Decoding random linear codes ,
A public-key cryptosystem based on algebraic coding theory. The Deep Space Network Progress Report, pp.42-4442, 1978. ,
On Lower Bounds for Information Set Decoding over Fq, SCC 2010, RHUL, pp.143-157, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-01382959
Knapsack-type cryptosystems and algebraic coding theory, Problems of Control and Information Theory, vol.15, issue.2, pp.159-166, 1986. ,
Information-Set Decoding for Linear Codes over Fq, PQCrypto 2010, pp.81-94, 2010. ,
How to Leak a Secret: Theory and Applications of Ring Signatures, Theoretical Computer Science, pp.164-186, 2006. ,
DOI : 10.1007/11685654_7
A new identification scheme based on syndrome decoding, CRYPTO 1993, pp.13-21, 1994. ,
DOI : 10.1007/3-540-48329-2_2
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