Decoding Random Binary Linear Codes in 2 n/20: How 1???+???1???=???0 Improves Information Set Decoding, Advances in Cryptology EUROCRYPT 2012, pp.520-536, 2012. ,
DOI : 10.1007/978-3-642-29011-4_31
Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions, Cryptology EUROCRYPT 2003, pp.614-629, 2003. ,
DOI : 10.1007/3-540-39200-9_38
Foundations of Group Signatures: The Case of Dynamic Groups, Topics in Cryptology CT-RSA 2005, pp.136-153, 2005. ,
DOI : 10.1007/978-3-540-30574-3_11
On the inherent intractability of certain coding problems (corresp.). Information Theory, IEEE Transactions on, vol.24, issue.3, pp.384-386, 1978. ,
Preuves de connaissance interactives et non-interactives. Part 1, Chapter 3, 2012. ,
Non-interactive zeroknowledge and its applications, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC '88, pp.103-112, 1988. ,
DOI : 10.1145/62212.62222
Short Group Signatures, Lecture Notes in Computer Science, vol.3152, pp.41-55, 2004. ,
DOI : 10.1007/978-3-540-28628-8_3
Group signatures with verifier-local revocation, Proceedings of the 11th ACM conference on Computer and communications security , CCS '04, pp.168-177, 2004. ,
DOI : 10.1145/1030083.1030106
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.77.8033
Signature Schemes and Anonymous Credentials from Bilinear Maps, pp.56-72, 2004. ,
DOI : 10.1007/978-3-540-28628-8_4
Group Signatures, Advances in Cryptology EUROCRYPT 91, pp.257-265, 1991. ,
DOI : 10.1007/3-540-46416-6_22
How to Achieve a McEliece-Based Digital Signature Scheme, Advances in Cryptology -ASI- ACRYPT 2001, pp.157-174, 2001. ,
DOI : 10.1007/3-540-45682-1_10
URL : https://hal.archives-ouvertes.fr/inria-00072511
Dynamic Fully Anonymous Short Group Signatures, Progress in Cryptology -VI- ETCRYPT 2006, pp.193-210, 2006. ,
DOI : 10.1007/11958239_13
A distinguisher for high rate McEliece cryptosystems, ITW 2011, pp.282-286, 2011. ,
How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Proceedings on Advances in cryptology?CRYPTO '86, pp.186-194, 1987. ,
DOI : 10.1007/3-540-47721-7_12
Security Bounds for the Design of Code-Based Cryptosystems, Advances in Cryptology ASIACRYPT 2009, pp.88-105, 2009. ,
DOI : 10.1007/978-3-642-10366-7_6
The Knowledge Complexity of Interactive Proof Systems, SIAM Journal on Computing, vol.18, issue.1, pp.186-208, 1989. ,
DOI : 10.1137/0218012
A group signature scheme from lattice assumptions, Advances in Cryptology -ASIACRYPT 2010, pp.395-412, 2010. ,
Fully Anonymous Group Signatures Without Random Oracles, ASIACRYPT 2007, pp.164-180, 2007. ,
DOI : 10.1007/978-3-540-76900-2_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.6315
Traceable Signatures, Advances in Cryptology -EUROCRYPT 2004, pp.571-589, 2004. ,
DOI : 10.1007/978-3-540-24676-3_34
Lattice-Based Group Signatures with Logarithmic Signature Size, Advances in Cryptology -ASIACRYPT 2013, pp.41-61, 2013. ,
DOI : 10.1007/978-3-642-42045-0_3
URL : https://hal.archives-ouvertes.fr/hal-00920420
Lattice-Based Group Signature Scheme with Verifier-Local Revocation, Public-Key Cryptography PKC 2014, pp.345-361, 2014. ,
DOI : 10.1007/978-3-642-54631-0_20
URL : https://hal.archives-ouvertes.fr/hal-00983084
Efficient Traceable Signatures in the Standard Model, Pairing-Based Cryptography Pairing, pp.187-205, 2009. ,
DOI : 10.1007/11426639_7
The Theory of Error-Correcting Codes, 1978. ,
Simpler efficient group signatures from lattices ,
Group signatures from lattices: simpler, tighter, shorter, ring-based, PKC 2015 ,
A new identification scheme based on syndrome decoding, Advances in Cryptology CRYPTO 93, pp.13-21, 1994. ,
DOI : 10.1007/3-540-48329-2_2
The intractability of computing the minimum distance of a code Information Theory, IEEE Transactions on, vol.43, issue.6, pp.1757-1766, 1997. ,