T. Limitations-au-stade, 79 2.6.1 Limitations L0 et L1 ou le manque d'attributs diversifiés, p.82

F. Instanciation-de and L. , 99 3.4.1 Une solution basée sur les Fuzzy, p.107

T. Limitations-au-stade, 118 3.7.1 Limitations L4 et L5 ou un manque de pratique, p.120

=. Hz and G. ?t, ?t(y) = ?} 3. b ? TVerif gs (m

=. Hz and G. ?t, ?t(y) = ?} 4. For i = 1 . . . N b ? TestWit gs (m, skO

?. If-?j and . Cu-?-s, Open(skO, gpk, m, ?) = j

=. For-i, l ? Generate rsp[l] according to ch[l] and Figure 3

M. Bellare, A. Desai, E. Jokipii, and P. Rogaway, A concrete security treatment of symmetric encryption, Proceedings 38th Annual Symposium on Foundations of Computer Science, pp.394-403, 1997.
DOI : 10.1109/SFCS.1997.646128

S. Cauchie, Method and system for authentication, p.787705, 2013.

Q. Alamélou and S. Cauchie, Assessment of a confidence level in the collection by a communication terminal of information relative to fingerprints, p.306675, 2016.

Q. Alamélou, S. Cauchie, P. Gaborit, and O. Maas, Authentification Numérique bassée sur les Fuzzy Extractors, Atelier sur la Protection pour la Vie Privée, 2014.

Q. Alamélou, P. Berthier, C. Cachet, S. Cauchie, B. Fuller et al., Pseudoentropic isometries: A new framework for fuzzy extractor reusability, Cryptology ePrint Archive, 1100.

Q. Alamélou, O. Blazy, S. Cauchie, and P. Gaborit, A code-based group signature scheme, The 9th International Workshop on Coding and Cryptography 2015 WCC2015, ser. Proceedings of the 9th International Workshop on Coding and Cryptography 2015 WCC2015, J.-P. T. Pascale Charpin, 2015.
DOI : 10.1007/978-3-642-10366-7_6

A. Yger and J. Weil, Mathématiques L3-Mathématiques appliquées: Cours complet avec 500 tests et exercices corrigés, 2009.

D. R. Bose, On a class of error correcting binary group codes, Information and Control, vol.3, issue.1, pp.68-79, 1960.
DOI : 10.1016/S0019-9958(60)90287-4

A. Hocquenghem, Codes correcteurs d'erreurs, pp.147-156, 1959.

Y. Dodis, L. Reyzin, and A. Smith, Fuzzy extractors: How to generate strong keys from biometrics and other noisy data, Advances in Cryptology -EUROCRYPT 2004, ser. Lecture Notes in Computer Science
DOI : 10.1007/978-3-540-24676-3_31
URL : http://arxiv.org/pdf/cs/0602007

Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith, Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data, SIAM Journal on Computing, vol.38, issue.1, pp.97-139, 2008.
DOI : 10.1137/060651380
URL : http://arxiv.org/pdf/cs/0602007

E. Berlekamp and L. Welch, Error correction of algebraic block codes

A. Juels and M. Sudan, A Fuzzy Vault Scheme, Designs, Codes and Cryptography, vol.22, issue.1, pp.237-257, 2006.
DOI : 10.1007/s10623-005-6343-z

J. Faugère, V. Gauthier-umaña, A. Otmani, L. Perret, and J. Tillich, A distinguisher for high rate mceliece cryptosystems, pp.282-286, 2011.

V. D. Goppa, A new class of linear correcting codes, Problemy Peredachi Informatsii, vol.6, issue.3, pp.24-30, 1970.

E. M. Gabidulin, Theory of codes with maximum rank distance, Probl. Peredachi Inf, vol.21, issue.1, pp.3-16, 1985.

P. Loidreau, Properties of codes in rank metric, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00459620

P. Gaborit, G. Murat, O. Ruatta, and G. Zémor, Low Rank Parity Check codes and their application to cryptography, WCC 13, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00913719

A. Kerckhoffs, La cryptographie militaire, Journal des sciences militaires, pp.5-83, 1883.

S. Goldwasser and S. Micali, Probabilistic encryption, Journal of Computer and System Sciences, vol.28, issue.2, pp.270-299, 1984.
DOI : 10.1016/0022-0000(84)90070-9
URL : https://doi.org/10.1016/0022-0000(84)90070-9

M. Bellare and P. Rogaway, Random oracles are practical, Proceedings of the 1st ACM conference on Computer and communications security , CCS '93, pp.62-73, 1993.
DOI : 10.1145/168588.168596

S. Goldwasser and Y. T. Kalai, On the (In)security of the Fiat-Shamir paradigm, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pp.102-113, 2003.
DOI : 10.1109/SFCS.2003.1238185

R. Canetti, O. Goldreich, and S. Halevi, The random oracle methodology, revisited, Journal of the ACM, vol.51, issue.4, pp.557-594, 2004.
DOI : 10.1145/1008731.1008734
URL : http://arxiv.org/pdf/cs/0010019

N. Koblitz and A. J. Menezes, The random oracle model: a twenty-year retrospective, Designs, Codes and Cryptography, vol.77, issue.2-3, pp.587-610, 2015.
DOI : 10.1007/978-3-662-46803-6_15

R. L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.21, issue.2, pp.120-126, 1978.
DOI : 10.1145/359340.359342

P. W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM Review, vol.41, issue.2, pp.303-332, 1999.
DOI : 10.1137/S0036144598347011
URL : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.144.6148&rep=rep1&type=pdf

R. G. Michael and S. J. David, Computers and intractability: a guide to the theory of np-completeness, 1979.

E. Bresson, Protocoles cryptographiques pour l'authentification et l'anonymat dans les groupes, 2002.

O. Goldreich, Foundations of cryptography: volume 1, Basic Tools, 2001.

O. Goldreich, S. Goldwasser, and S. Micali, How to construct random functions, Journal of the ACM, vol.33, issue.4, pp.792-807, 1986.
DOI : 10.1145/6490.6503
URL : http://dl.acm.org/ft_gateway.cfm?id=6503&type=pdf

N. Nisan and D. Zuckerman, Randomness is Linear in Space, Journal of Computer and System Sciences, vol.52, issue.1, pp.43-52, 1996.
DOI : 10.1006/jcss.1996.0004
URL : https://doi.org/10.1006/jcss.1996.0004

L. Trevisan, Extractors and pseudorandom generators, Journal of the ACM, vol.48, issue.4, pp.860-879, 2001.
DOI : 10.1145/502090.502099
URL : http://www.cs.berkeley.edu/~luca/pubs/extractor-full.pdf

R. Shaltiel, RECENT DEVELOPMENTS IN EXPLICIT CONSTRUCTIONS OF EXTRACTORS, Bulletin of the EATCS, vol.77, pp.67-95, 2002.
DOI : 10.1142/9789812562494_0013

H. Krawczyk, Cryptographic Extraction and Key Derivation: The HKDF Scheme, Annual Cryptology Conference, pp.631-648, 2010.
DOI : 10.1007/978-3-642-14623-7_34
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.593.5659

D. Dachman-soled, R. Gennaro, H. Krawczyk, and T. Malkin, Computational Extractors and Pseudorandomness, Theory of Cryptography Conference, pp.383-403, 2012.
DOI : 10.1007/978-3-642-28914-9_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.5844

H. Krawczyk, R. Canetti, and M. Bellare, Hmac: Keyed-hashing for message authentication, 1997.
DOI : 10.17487/rfc2104
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.383.2086

W. Diffie and M. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.644-654, 2006.
DOI : 10.1109/TIT.1976.1055638
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.9720

J. Daemen and V. Rijmen, The design of Rijndael: AES-the advanced encryption standard, 2013.
DOI : 10.1007/978-3-662-04722-4

M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway, Relations among notions of security for public-key encryption schemes, pp.26-45, 1998.
DOI : 10.1007/BFb0055718

M. Dworkin, Nist special publication 800-38b recommendation for block cipher modes of operation: The cmac mode for authentication, 2005.

D. Mcgrew and J. Viega, The galois/counter mode of operation (gcm), " Submission to NIST Modes of Operation Process, 2004.

J. Song, R. Poovendran, J. Lee, and T. Iwata, The aes-cmac algorithm, Tech. Rep, 2006.

A. Fiat and A. Shamir, How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Advances in Cryptology -CRYPTO '86, pp.186-194, 1986.
DOI : 10.1007/3-540-47721-7_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.8796

S. Goldwasser, S. Micali, and R. L. Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks, SIAM Journal on Computing, vol.17, issue.2, pp.281-308, 1988.
DOI : 10.1137/0217017
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.8353

D. Chaum and E. Van-heyst, Group Signatures, Advances in Cryptology ? EUROCRYPT '91
DOI : 10.1007/3-540-46416-6_22

G. Brassard, D. Chaum, and C. Crépeau, Minimum disclosure proofs of knowledge, Journal of Computer and System Sciences, vol.37, issue.2, pp.156-189, 1988.
DOI : 10.1016/0022-0000(88)90005-0

U. Fiege, A. Fiat, and A. Shamir, 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

U. Feige and A. Shamir, Zero Knowledge Proofs of Knowledge in Two Rounds, pp.526-544, 1990.
DOI : 10.1007/0-387-34805-0_46

S. Goldwasser, S. Micali, and C. Rackoff, The knowledge complexity of interactive proof-systems, Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pp.291-304, 1985.

T. Itoh and K. Sakurai, On the complexity of constant round ZKIP of possession of knowledge, Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology, ser. ASIACRYPT '91, pp.331-345, 1993.
DOI : 10.1007/3-540-57332-1_28

E. R. Berlekamp, R. J. Mceliece, and H. C. Van-tilborg, 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

N. Courtois, M. Finiasz, and N. Sendrier, How to Achieve a McEliece-Based Digital Signature Scheme, Advances in Cryptology -ASIACRYPT 2001, pp.157-174, 2001.
DOI : 10.1007/3-540-45682-1_10
URL : https://hal.archives-ouvertes.fr/inria-00072511

A. Vardy, The intractability of computing the minimum distance of a code Information Theory, IEEE Transactions on, vol.43, issue.6, pp.1757-1766, 1997.

R. Mceliece, A public-key cryptosystem based on algebraic, Coding Thv, vol.4244, pp.114-116, 1978.

A. Canteaut and N. Sendrier, Cryptanalysis of the Original McEliece Cryptosystem, 1998.
DOI : 10.1007/3-540-49649-1_16

D. J. Bernstein, T. Lange, and C. Peters, Attacking and Defending the McEliece Cryptosystem, 2008.
DOI : 10.1007/0-387-34799-2_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.139.3548

M. Finiasz and N. Sendrier, Security Bounds for the Design of Code-Based Cryptosystems, International Conference on the Theory and Application of Cryptology and Information Security, pp.88-105, 2009.
DOI : 10.1007/978-3-642-10366-7_6

D. J. Bernstein, T. Lange, and C. Peters, Smaller Decoding Exponents: Ball-Collision Decoding, Annual Cryptology Conference, pp.743-760, 2011.
DOI : 10.1007/978-3-642-22792-9_42

H. Niederreiter, Knapsack-type cryptosystems and algebraic coding theory, Problems of Control and Information Theory, pp.159-166, 1986.

Y. X. Li, R. H. Deng, and X. M. Wang, On the equivalence of mceliece's and niederreiter's public-key cryptosystems, IEEE Transactions on Information Theory, vol.40, issue.1, pp.271-273, 1994.

J. Stern, 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://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.751

D. Wagner, A Generalized Birthday Problem, Annual International Cryptology Conference, pp.288-304, 2002.
DOI : 10.1007/3-540-45708-9_19

C. H. Bennett, G. Brassard, and J. Robert, Privacy Amplification by Public Discussion, SIAM Journal on Computing, vol.17, issue.2, pp.210-229, 1988.
DOI : 10.1137/0217014
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.205.7470

R. Pappu, B. Recht, J. Taylor, and N. Gershenfeld, Physical one-way functions Zoom sur le capteur d'iris du samsung galaxy note 7
DOI : 10.1126/science.1074376

. Bibliographie, La reconnaissance de l'iris déverrouillera 300 millions de smartphones en 2021

A. Juels and M. Wattenberg, A fuzzy commitment scheme, Proceedings of the 6th ACM conference on Computer and communications security , CCS '99, pp.28-36, 1999.
DOI : 10.1145/319709.319714
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.763

G. I. Davida, Y. Frankel, and B. J. Matt, On enabling secure applications through off-line biometric identification, Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186), pp.148-157, 1998.
DOI : 10.1109/SECPRI.1998.674831

G. I. Davida, Y. Frankel, B. J. Matt, and R. Peralta, On the relation of error correction and cryptography to an off line biometric based identification scheme, 1999.

J. Bringer, H. Chabanne, G. Cohen, B. Kindarji, and G. Zemor, Optimal Iris Fuzzy Sketches, 2007 First IEEE International Conference on Biometrics: Theory, Applications, and Systems, pp.1-6, 2007.
DOI : 10.1109/BTAS.2007.4401904
URL : https://hal.archives-ouvertes.fr/hal-00269913

J. Linnartz and P. Tuyls, New Shielding Functions to Enhance Privacy and Prevent Misuse of Biometric Templates, pp.393-402, 2003.
DOI : 10.1007/3-540-44887-X_47

B. Fuller, X. Meng, and L. Reyzin, Computational Fuzzy Extractors, pp.174-193, 2013.
DOI : 10.1007/978-3-642-42033-7_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.5704

G. Cohen and G. Zemor, The wiretap channel applied to biometrics Available: https, ISITA, pp.1-5, 2004.

X. Boyen, Reusable cryptographic fuzzy extractors, Proceedings of the 11th ACM conference on Computer and communications security , CCS '04, pp.82-91, 2004.
DOI : 10.1145/1030083.1030096
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.7298

X. Boyen, Y. Dodis, J. Katz, R. Ostrovsky, and A. Smith, Secure Remote Authentication Using Biometric Data, pp.147-163, 2005.
DOI : 10.1007/11426639_9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.8800

Y. Dodis, J. Katz, L. Reyzin, and A. Smith, Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets, pp.232-250, 2006.
DOI : 10.1007/11818175_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.6309

R. Cramer, Y. Dodis, S. Fehr, C. Padró, and D. Wichs, Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
DOI : 10.1007/978-3-540-78967-3_27

Y. Dodis, B. Kanukurthi, J. Katz, L. Reyzin, and A. D. Smith, Robust Fuzzy Extractors and Authenticated Key Agreement From Close Secrets, IEEE Transactions on Information Theory, vol.58, issue.9, pp.6207-6222, 2012.
DOI : 10.1109/TIT.2012.2200290
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.6309

K. Simoens, P. Tuyls, and B. Preneel, Privacy Weaknesses in Biometric Sketches, 2009 30th IEEE Symposium on Security and Privacy, pp.188-203, 2009.
DOI : 10.1109/SP.2009.24

M. Blanton and M. Aliasgari, On the (non-)reusability of fuzzy sketches and extractors and security improvements in the computational setting, IACR Cryptology ePrint Archive, vol.2012, p.608, 2012.

O. Regev, On lattices, learning with errors, random linear codes, and cryptography, Journal of the ACM (JACM), vol.56, issue.6, p.34, 2009.
DOI : 10.1145/1060590.1060603
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.5202

I. Buhan, J. Doumen, P. H. Hartel, and R. N. Veldhuis, Fuzzy extractors for continuous distributions, Proceedings of the 2nd ACM symposium on Information, computer and communications security , ASIACCS '07, pp.353-355, 2007.
DOI : 10.1145/1229285.1229325
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.2298

V. P. Parente and J. Van-de-graaf, A Practical Fuzzy Extractor for Continuous Features, pp.241-258, 2016.
DOI : 10.1109/ICPR.2006.423

F. Monrose, M. K. Reiter, Q. Li, and S. Wetzel, Cryptographic key generation from voice, Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001, p.202, 2001.
DOI : 10.1109/SECPRI.2001.924299

Y. Chang, W. Zhang, and T. Chen, Biometrics-based cryptographic key generation, IEEE International Conference on Multimedia and Expo (ICME) (IEEE Cat, pp.2203-2206, 2004.

W. Zhang, Y. Chang, and T. Chen, Optimal thresholding for key generation based on biometrics, Image Processing International Conference on, pp.3451-3454, 2004.

A. Van-herrewege, S. Katzenbeisser, R. Maes, R. Peeters, A. Sadeghi et al., Reverse Fuzzy Extractors: Enabling Lightweight Mutual Authentication for PUF-Enabled RFIDs, 2012.
DOI : 10.1007/978-3-642-32946-3_27

P. Eckersley, How Unique Is Your Web Browser?, Privacy Enhancing Technologies, 10th International Symposium, PETS 2010, pp.1-18, 2010.
DOI : 10.1109/TDSC.2005.26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.381.1264

A. Kurtz, H. Gascon, T. Becker, K. Rieck, and F. Freiling, Abstract, Proceedings on Privacy Enhancing Technologies, pp.4-19, 2016.
DOI : 10.1515/popets-2015-0027

M. E. Khan and F. Khan, A comparative study of white box, black box and grey box testing techniques, International Journal of Advanced Computer Science and Applications (IJACSA), vol.3, issue.6, 2012.

P. C. Kocher, Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems, 1996.
DOI : 10.1007/3-540-68697-5_9

S. Chow, P. Eisen, H. Johnson, and P. C. Van-oorschot, White-Box Cryptography and an AES Implementation, 2003.
DOI : 10.1007/3-540-36492-7_17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.7710

Z. Brakerski and O. Dagmi, Shorter Circuit Obfuscation in Challenging Security Models, Security and Cryptography for Networks -10th International Conference, pp.551-570, 2016.
DOI : 10.1007/978-3-662-46803-6_15

Y. D. Mulder and K. Leuven, White-box cryptography. analysis of white-box aes implementations, 2014.

T. Lepoint, M. Rivain, Y. D. Mulder, P. Roelse, and B. Preneel, Two Attacks on a White-Box AES Implementation, Selected Areas in Cryptography -SAC 2013 - 20th International Conference, pp.265-285, 2013.
DOI : 10.1007/978-3-662-43414-7_14
URL : https://hal.archives-ouvertes.fr/hal-00872844

U. Rührmair, F. Sehnke, J. Sölter, G. Dror, S. Devadas et al., Modeling attacks on physical unclonable functions, Proceedings of the 17th ACM Conference on Computer and Communications Security, ser. CCS '10, pp.237-249, 2010.

U. Ruhrmair and M. Van-dijk, PUFs in Security Protocols: Attack Models and Security Evaluations, 2013 IEEE Symposium on Security and Privacy, pp.286-300, 2013.
DOI : 10.1109/SP.2013.27
URL : http://doi.org/10.1109/sp.2013.27

K. Boda, A. M. Földes, G. G. Gulyás, and S. Imre, User Tracking on the Web via Cross-Browser Fingerprinting, Proceedings of the 16th Nordic Conference on Information Security Technology for Applications, ser. NordSec'11, pp.31-46, 2012.
DOI : 10.1007/978-3-642-29615-4_4

K. Mowery and H. Shacham, Pixel perfect: Fingerprinting canvas in HTML5, Proceedings of W2SP 2012, 2012.

N. Nikiforakis, A. Kapravelos, W. Joosen, C. Kruegel, F. Piessens et al., Cookieless Monster: Exploring the Ecosystem of Web-Based Device Fingerprinting, 2013 IEEE Symposium on Security and Privacy
DOI : 10.1109/SP.2013.43

G. Acar, C. Eubank, S. Englehardt, M. Juarez, A. Narayanan et al., The Web Never Forgets, Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, CCS '14, pp.674-689, 2014.
DOI : 10.1007/978-3-642-31284-7_25

S. Kamkar, Evercookie-virtually irrevocable persistent cookies, His Blog, vol.9, 2010.

A. Soltani, S. Canty, Q. Mayo, L. Thomas, and C. J. Hoofnagle, Flash Cookies and Privacy, AAAI spring symposium: intelligent information privacy management, pp.158-163, 2010.
DOI : 10.2139/ssrn.1446862
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.401.7830

B. Krishnamurthy and C. Wills, Privacy diffusion on the web, Proceedings of the 18th international conference on World wide web, WWW '09, pp.541-550, 2009.
DOI : 10.1145/1526709.1526782

J. R. Mayer and J. C. Mitchell, Third-Party Web Tracking: Policy and Technology, 2012 IEEE Symposium on Security and Privacy, pp.413-427, 2012.
DOI : 10.1109/SP.2012.47
URL : http://doi.org/10.1109/sp.2012.47

J. Lukas, J. Fridrich, and M. Goljan, Digital Camera Identification From Sensor Pattern Noise, IEEE Transactions on Information Forensics and Security, vol.1, issue.2, pp.205-214, 2006.
DOI : 10.1109/TIFS.2006.873602

M. Chen, J. Fridrich, M. Goljan, and J. Lukás, Determining Image Origin and Integrity Using Sensor Noise, IEEE Transactions on Information Forensics and Security, vol.3, issue.1, pp.74-90, 2008.
DOI : 10.1109/TIFS.2007.916285
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.6468

H. Bojinov, Y. Michalevsky, G. Nakibly, and D. Boneh, Mobile device identification via sensor fingerprinting, 2014.

A. Das, N. Borisov, and M. Caesar, Do You Hear What I Hear?, Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, CCS '14, pp.441-452, 2014.
DOI : 10.1007/978-3-642-21599-5_7

Z. Zhou, W. Diao, X. Liu, and K. Zhang, Acoustic Fingerprinting Revisited, Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, CCS '14, pp.429-440, 2014.
DOI : 10.1109/MSP.2007.914237

S. Dey, N. Roy, W. Xu, R. R. Choudhury, and S. Nelakuditi, AccelPrint: Imperfections of Accelerometers Make Smartphones Trackable, Proceedings 2014 Network and Distributed System Security Symposium, 2014.
DOI : 10.14722/ndss.2014.23059

S. Seneviratne, A. Seneviratne, P. Mohapatra, and A. Mahanti, Predicting user traits from a snapshot of apps installed on a smartphone, ACM SIGMOBILE Mobile Computing and Communications Review, vol.18, issue.2, pp.1-8, 2014.
DOI : 10.1145/2636242.2636244

J. P. Achara, G. Acs, and C. Castelluccia, On the Unicity of Smartphone Applications, Proceedings of the 14th ACM Workshop on Privacy in the Electronic Society, WPES '15, pp.27-36, 2015.
DOI : 10.1007/s12243-013-0392-5
URL : https://hal.archives-ouvertes.fr/hal-01181040

A. K. Jain, K. Nandakumar, and A. Ross, 50 years of biometric research: Accomplishments, challenges, and opportunities, Pattern Recognition Letters, vol.79, 2016.
DOI : 10.1016/j.patrec.2015.12.013

B. Barak, Lecture 4 -Computational Indistinguishability, Pseudorandom Generators

J. Daugman, How Iris Recognition Works, IEEE Transactions on Circuits and Systems for Video Technology, vol.14, issue.1, pp.21-30, 2002.
DOI : 10.1109/TCSVT.2003.818350
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.570.8548

K. Nandakumar, A. K. Jain, and S. Pankanti, Fingerprint-Based Fuzzy Vault: Implementation and Performance, IEEE Transactions on Information Forensics and Security, vol.2, issue.4, pp.744-757, 2007.
DOI : 10.1109/TIFS.2007.908165
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.4945

A. K. Jain, K. Nandakumar, and A. Nagar, Biometric Template Security, EURASIP Journal on Advances in Signal Processing, vol.6, issue.2, pp.1-11317, 2008.
DOI : 10.1109/TIFS.2007.908165

U. Uludag, S. Pankanti, S. Prabhakar, and A. K. Jain, Biometric cryptosystems: issues and challenges, Proceedings of the IEEE, vol.92, issue.6, pp.948-960, 2004.
DOI : 10.1109/JPROC.2004.827372
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.1307

U. Uludag, A. Ross, and A. Jain, Biometric template selection and update: a case study in fingerprints, Pattern Recognition, vol.37, issue.7, pp.1533-1542, 2004.
DOI : 10.1016/j.patcog.2003.11.012

J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby, A Pseudorandom Generator from any One-way Function, SIAM Journal on Computing, vol.28, issue.4, pp.1364-1396, 1999.
DOI : 10.1137/S0097539793244708

C. Hsiao, C. Lu, and L. Reyzin, Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility, Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp.169-186, 2007.
DOI : 10.1007/978-3-540-72540-4_10

M. Bellare, A. Desai, E. Jokipii, and P. Rogaway, A concrete security treatment of symmetric encryption, Proceedings 38th Annual Symposium on Foundations of Computer Science, p.394, 1997.
DOI : 10.1109/SFCS.1997.646128

M. Bellare, H. Shi, and C. Zhang, Foundations of Group Signatures: The Case of Dynamic Groups, Topics in Cryptology ? CT-RSA 2005, ser. Lecture Notes in Computer Science, A. Menezes, pp.136-153, 2005.
DOI : 10.1007/978-3-540-30574-3_11

J. Stern, A new identification scheme based on syndrome decoding, Lecture Notes in Computer Science, vol.773, pp.13-21, 1994.
DOI : 10.1007/3-540-48329-2_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.9243

M. Bellare, D. Micciancio, and B. Warinschi, Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions, Advances in Cryptology ? EUROCRYPT 2003, pp.614-629, 2003.
DOI : 10.1007/3-540-39200-9_38

D. Boneh, X. Boyen, and H. Shacham, Short Group Signatures, Lecture Notes in Computer Science, M. Franklin, vol.3152, pp.41-55, 2004.
DOI : 10.1007/978-3-540-28628-8_3

D. Boneh and H. Shacham, 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

J. Camenisch and A. Lysyanskaya, Signature Schemes and Anonymous Credentials from Bilinear Maps, Advances in Cryptology -CRYPTO 2004, 24th Annual International CryptologyConference, pp.56-72, 2004.
DOI : 10.1007/978-3-540-28628-8_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.2381

C. Delerablée and D. Pointcheval, Dynamic Fully Anonymous Short Group Signatures, Progressin Cryptology -VIETCRYPT 2006, First International Conference on Cryptology in Vietnam, pp.193-210, 2006.
DOI : 10.1007/11958239_13

J. Groth, Fully Anonymous Group Signatures Without Random Oracles, Advances in Cryptology -ASIACRYPT 2007 13th International Conference on the Theory and Application of Cryptology and Information Security, 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

A. Kiayias, Y. Tsiounis, and M. Yung, Traceable Signatures, Lecture Notes in Computer Science, vol.3027, pp.571-589, 2004.
DOI : 10.1007/978-3-540-24676-3_34

B. Libert and M. Yung, Efficient Traceable Signatures in the Standard Model, Lecture Notes in Computer Science, vol.51, issue.4, pp.187-205, 2009.
DOI : 10.1007/11426639_7

S. Gordon, J. Katz, and V. Vaikuntanathan, A Group Signature Scheme from Lattice Assumptions, Advances in Cryptology -ASIACRYPT 2010, ser. Lecture Notes in Computer Science, pp.395-412, 2010.
DOI : 10.1007/978-3-642-17373-8_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.180.1522

F. Laguillaumie, A. Langlois, B. Libert, and D. Stehlé, Lattice-Based Group Signatures with Logarithmic Signature Size, Advances in Cryptology - ASIACRYPT 2013, ser. Lecture Notes in Computer Science, pp.41-61
DOI : 10.1007/978-3-642-42045-0_3
URL : https://hal.archives-ouvertes.fr/hal-00920420

A. Langlois, S. Ling, K. Nguyen, and H. Wang, Lattice-Based Group Signature Scheme with Verifier-Local Revocation, PKC 2014, ser. Lecture Notes in Computer Science, H. Krawczyk, pp.345-361
DOI : 10.1007/978-3-642-54631-0_20
URL : https://hal.archives-ouvertes.fr/hal-00983084

S. Ling, K. Nguyen, and H. Wang, Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based, PKC 2015, ser. Lecture Notes in Computer Science, pp.427-449, 2015.
DOI : 10.1007/978-3-662-46447-2_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.691.2753

P. Q. Nguyen, J. Zhang, and Z. Zhang, Simpler Efficient Group Signatures from Lattices, Public-Key Cryptography -PKC 2015 -18th IACR International Conference on Practice and Theory in Public-Key Cryptography, pp.401-426, 2015.
DOI : 10.1007/978-3-662-46447-2_18
URL : https://hal.archives-ouvertes.fr/hal-01256013

M. F. Ezerman, H. T. Lee, S. Ling, K. Nguyen, and H. Wang, A Provably Secure Group Signature Scheme from Code-Based Assumptions, Advances in Cryptology - ASIACRYPT 2015 -21st International Conference on the Theory and Application of Cryptology and Information Security Proceedings, Part I, pp.260-285, 2015.
DOI : 10.1007/978-3-662-48797-6_12

B. Libert, F. Mouhartem, and K. Nguyen, A Lattice-Based Group Signature Scheme with Message-Dependent Opening, Applied Cryptography and Network Security -14th International Conference, ACNS 2016, pp.137-155, 2016.
DOI : 10.1109/18.556672
URL : https://hal.archives-ouvertes.fr/hal-01302790

S. Arora, L. Babai, J. Stern, and Z. Sweedyk, The hardness of approximate optimia in lattices, codes, and systems of linear equations, 34th Annual Symposium on Foundations of Computer Science, pp.3-5, 1993.

M. Bellare, C. Namprempre, D. Pointcheval, and M. Semanko, The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme, Journal of Cryptology, vol.16, issue.3, pp.185-215, 2003.
DOI : 10.1007/s00145-002-0120-1

K. P. Mathew, S. Vasant, and C. P. Rangan, A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory, pp.342-362, 2014.
DOI : 10.1007/978-3-319-12160-4_21

A. Becker, A. Joux, A. May, and A. Meurer, Decoding Random Binary Linear Codes in 2 n/20: How 1???+???1???=???0 Improves Information Set Decoding, Advances in Cryptology -EUROCRYPT 2012 -31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp.520-536, 2012.
DOI : 10.1007/978-3-642-29011-4_31

P. Gaborit, O. Ruatta, J. Schrek, and G. Zémor, RankSign: An Efficient Signature Algorithm Based on the Rank Metric, Post-Quantum Cryptography, ser, pp.88-107, 2014.
DOI : 10.1007/978-3-319-11659-4_6
URL : https://hal.archives-ouvertes.fr/hal-01261425

P. Gaborit, O. Ruatta, J. Schrek, and G. Zémor, RankSign: An Efficient Signature Algorithm Based on the Rank Metric, 1606.
DOI : 10.1007/978-3-319-11659-4_6
URL : https://hal.archives-ouvertes.fr/hal-01261425

P. Gaborit, J. Schrek, and G. Zémor, Full Cryptanalysis of the Chen Identification Protocol, Lecture Notes in Computer Science, vol.8, issue.1, pp.35-50, 2011.
DOI : 10.1007/s002000050053
URL : https://hal.archives-ouvertes.fr/hal-00776245

J. Fischer and J. Stern, An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding, Advances in Cryptology -EUROCRYPT '96, International Conference on the Theory and Application of Cryptographic Techniques, pp.245-255, 1996.
DOI : 10.1007/3-540-68339-9_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.8163

B. Libert, S. Ling, K. Nguyen, and H. Wang, Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors, 2016.
DOI : 10.1007/978-3-662-49896-5_1
URL : https://hal.archives-ouvertes.fr/hal-01314642

P. Gaborit, O. Ruatta, J. Schrek, and G. Zémor, New Results for Rank-Based Cryptography, Progress in Cryptology -AFRICACRYPT 2014 -7th International Conference on Cryptology in Africa, pp.1-12, 2014.
DOI : 10.1007/978-3-319-06734-6_1
URL : https://hal.archives-ouvertes.fr/hal-01261421

P. Gaborit and G. Zémor, 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

P. Gaborit, O. Ruatta, and J. Schrek, On the complexity of the rank syndrome decoding problem Information Theory, IEEE Transactions on, vol.62, issue.2, pp.1006-1019, 2016.

P. Gaborit, A. Hauteville, and J. Tillich, RankSynd a PRNG Based on Rank Metric, Post-Quantum Cryptography -7th International Workshop, pp.18-28, 2016.
DOI : 10.1007/978-3-319-29360-8_2
URL : https://hal.archives-ouvertes.fr/hal-01289338

K. Chen, A new identification algorithm, Cryptography: Policy and Algorithms, International Conference, pp.244-249, 1995.
DOI : 10.1007/BFb0032363