Accueil


    


*      Technical Expert in Cyber Sécurity at Assystem.

 

 

 

Cédric TAVERNIER


Email : Tavernier.Cedric@gmail.com


CV

 

Research interests:

My research activity concerns the theory of error-correcting codes and their applications in cryptography, the complexity theory, the problems of reconstruction, the algorithmic, the construction of Boolean functions for cryptography and more generally, discrete mathematics. I develop in this frame an optimised library of decoding algorithms. I am also interested in security and in quality of service in networks with strong pressures as networks Ad Hoc. I am more generally interested in the security of network and information systems. 


More precisely, the treated topics are the following:

*      Deterministic list decoding of Reed-Muller codes. These techniques allow to construct the list degree r Boolean functions that coincide with a given Boolean function f, on more than k entries.

*      Construction of Boolean function that have a high degree r non-linearity. We mean that we want to construct some Boolean function that are far on the point of view of Hamming distance from any degree r polynomials. We would like to improve the existing bounds on the covering radius.

*      Application of list decoding to cryptanalysis: I want to apply the decoding algorithm to cryptanalysis of symmetric cryptosystems. My thesis was my first action this sense. I chose a probabilistic approach to treat the cryptanalysis.

*      Privacy for high-pressured network as Ad Hoc networks and Cloud computing. The privacy is more constraining than the simply data protection. Added considerations, as anonymity has to be insured. Therefore the cryptography cannot insure itself, the privacy. For this kind of problem we try to use some multipath strategy in order to solve some problems linked to the privacy and the performance. 

*      I am recently interested by algorithms for Big Data. I started few years ago to work formal concept analysis and I want to come back on this subject.

________________________________________


PhD in computer science and algorithmic:


*      C. Tavernier, “Testeurs, problèmes de reconstruction univariés et multivariés, et application à la cryptanalyse du DES”. PhD thesis of the school  “Ecole Polytechnique”, financed by the DGA, prepared in codes project of INRIA (in Rocquencourt) and directed by Daniel Augot and Pascale Charpin, January 2004 [pdf] [pdf].

 

Publications in journal:

 

*      I. Dumer, G. Kabatiansky and C. Tavernier “List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity”, in IEEE Transactions on Information Theory Oct. 2008, Vol. 54; No. 10, pages 4488-4492. [pdf][pdf]


*      R. Fourquet and C. Tavernier, “An improved List Decoding Algorithm for the Second Order Reed-Muller Codes and its Applications”, in Designs, codes and cryptography (DCC), Mai 2007. [pdf]

 

*      H. Aiache, F. Haettel, L. Lebrun and C. Tavernier, “Improving Security and Performances in an Ad-Hoc Network through a Multipath Routing Strategy”, Journal in Computer Virology (JCV), 2007. [pdf]

 

*      I. Dumer, G. Kabatiansky and C. Tavernier “List Decoding of the First-Order Binary Reed–Muller Codes”, Problems of Information Transmission, 2007, Vol. 43, No. 3, pp. 225–232. [pdf]

 

*      P. Charpin, E. Pasalic and C. Tavernier  “On bent and semi-bent quadratic Boolean functions”, in IEEE Transactions on Information Theory 2005, Vol. 51; No. 12, pages 4286-4298 [pdf][pdf]

 

*      C. Tavernier  “Construction of modular curves and computation of their cardinality over Fp”, Finite Fields with Applications to Coding Theory, Cryptography and Related Areas. LNCS Springer, Oaxaca, Mexique, p 313-328 mai 2001. [pdf]

 

Publications in conference with proceeding :


      *    A. Daif and C. Tavernier, "An efficient certificateless key management architecture to solve the IBE and PKI issues", in Proceeding  ACCT 2016, 

      Albena, Bulgaria, June 2016.


      *    Grigory Kabatiansky, Cedric Tavernier, Serge Vladuts, "On the Doubly Sparse Compressed Sensing Problem", in fifteenth IMA  international conference 

      on cryptography and coding, Oxford, UK, 2015 [pdf].


      *   C. Claude, A. Daif, J. Danger, S. Guillet, Z. Najm, T. Xuan, T. Porteboeuf and C. Tavernier, "Optimized linear complementary codes implementation for 

      hardware trojan prevention",  in European Conference on Circuit Theory  and Design (ECCTD), 2015 [pdf].


      *    M. Avril, L. Basta, L. Bouillet, A. Daif, G. Landais and C. Tavernier, "Identity Based Cryptography for Smart- Grid Protection", in 9th  International 

      conference on Computer Engineering and Applications (CEA '15), Dubai, UAE, 22-24 Feb 2015.


      *      G. Kabatiansky, S. Vladut and C. Tavernier, “Doubly Sparce Compressed Sensing Problem”, In Information Theory and Application (ITA 2015), 

      San Diego, CA, USA, February 1-6, 2015.  


*     G. Kabatiansky and C. Tavernier, “Double Sparse Compressed Sensing Problem”, Fourteenth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT-XIV) Svetlogorsk (Kaliningrad region), Russia, September 7–13, 2014.

 

*      Aurelia Delfosse, Jeremy Fanton, Thierry Floriani, Vincent Malguy, Nargisse Marine, Cedric Tavernier, "Cloud Data Security and Privacy in IAAS Model", in WSEAS conference,  International Conference on Information Technology and Computer Networks (ITCN '13), October 2013, Antalya, Turkey.  

       

*      I. Dumer, G. Kabatiansky and C. Tavernier “More Steganography via covering codes”, YACC'12, Septembre 2012, Porquerolles Island, France.


*     A. S. Abdouli, I. Dumer, G. Kabatiansky, C. Tavernier, “The Goldreich-Levin Algorithm with reduced complexity”, Algebraic and Combinatorial Coding Theory (ACCT 2012), Pomorie, Bulgaria. Juin 2012 [pdf].


*      I. Dumer, R. Fourquet, C. Tavernier, “Cryptanalysis of block ciphers via List Decoding of long Reed-Muller codes”, Algebraic and Combinatorial Coding Theory (ACCT 2010), Novosibirsk, Russia September 2010 [pdf].

 

*      I. Dumer, G. Kabatiansky and C. Tavernier “Soft-decision list decoding of Reed-Muller codes with linear complexity”, IEEE symposium ISIT 2011, Saint-Petersburg, Russia. [pdf].


*      A. Barg, G.R. Blakley, G. Kabatiansky and C. Tavernier “Robust Parent-identifying codes”, IEEE Information theory workshop, ITW 2010, Dublin, Ireland.[pdf]


*      T. Roche and C. Tavernier, “Multi-Linear cryptanalysis in Power Analysis: MLPA”, in iAWACS ESIEA - Laval - 23rd to 25th October 2009. [pdf][pdf]

 

*      R. Fourquet, P. Loidreau and C. Tavernier, Finding good linear approximations of block ciphers and its application to cryptanalysis of reduced round DES”, Workshop on Coding Theory and cryptography WCC 2009, Ullensvang, Norway. [pdf]

 

*      I. Dumer, G. Kabatiansky and C. Tavernier “On complexity of decoding Reed-Muller codes within their code distance”, eleventh International Workshop On Algebraic and Combinatorial Coding Theory, Proceedings ACCT-11, Pamporovo Bulgarie,  juin 2008. [pdf]

 

*      H. Aiache, C. Sieux and C. Tavernier, "Reed-Solomon Codes and Multi-Path Strategies to Improve Privacy Performance over Ad Hoc Networks", in IEEE symposium ISWPC 2008, Santorini, Greece, may 2008. [pdf]

 

*      H. Aiache, C. Sieux and C. Tavernier, “Automatisation de tunnels IPSec imbriqués pour établir des communications anonymes”, dans CFIP 2008, Arc, France, mars 2008. [pdf]

 

*      H. Aiache, M. Lauriano, C. Sieux and C. Tavernier, “Nested Encryption Library for automated IPSec-based Anonymous Circuits Establishment”, 6th WSEAS International Conference on Information Security and Privacy (ISP '07), Puerto De La Cruz, Tenerife, Canary Islands, Espagne décembre 14-16, 2007. [pdf]

 

*      I. Dumer, G. Kabatiansky and C. Tavernier “Soft-decision list decoding with linear complexity for the first-order Reed-Muller codes”, IEEE symposium ISIT 2007, Nice, France. [pdf]

 

*      R. Fourquet and C. Tavernier ”List Decoding of second order Reed-Muller Codes and its covering radius implications”, Workshop on Coding Theory and cryptography WCC 2007, Versailles, France. [pdf]

 

*      G. Kabatiansky and C. Tavernier, “List decoding of first order Reed-Muller codes II”, tenth International Workshop on Algebraic and Combinatorial Coding Theory, Proceedings ACCT-10, Zvenigorod, Russia, September 2006. [pdf]

 

*      I. Dumer, G. Kabatiansky and C. Tavernier, “List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity”, IEEE symposium ISIT 2006, Seattle, USA. [pdf]

 

*      G. Kabatiansky and C. Tavernier, “List decoding of second order Reed-Muller codes”, ISCTA’05, Martin's College, Ambleside, july 2005. [pdf]

 

*      G. Kabatiansky and C. Tavernier, “List decoding with Reed-Muller codes of order one”, nine International Workshop On Algebraic and Combinatorial Coding Theory, Proceedings ACCT-9, Bulgaria, p 230-236 June 2004. [pdf]

 

*      C. Tavernier, “Low degree Testing or Distance to Reed-Solomon Codes”, Eight International Workshop On Algebraic and Combinatorial Coding Theory, Proceedings ACCT-8, St-Petersburg, Russia, p 238-242 September 2002. [pdf]

 

Publication for the poster session:

 

*      R. Fourquet, P. Loidreau and C. Tavernier, Finding good linear approximations of block ciphers and its application to cryptanalysis of reduced round DES”, poster session of Eurocrypt 2009, Cologne. [pdf]

 

Conference on invitation:


*      C. Tavernier, “Multi-Linear cryptanalysis and application to Side channel attack”, YESS 2009, ambassade française de Washington, USA, 6-9 Juillet 2009.[link][pdf]

 

*      C. Tavernier “List decoding of Reed-Muller codes and Application to Cryptanalysis”, NATO Advanced Research Workshop 6 - 9 October 2008 Veliko Tarnovo, Bulgaria. [link][pdf]

 

Patents:

 

*      H. Aiache and C. Tavernier “Procédé de chiffrement de données”, EP2119095A1, US8213615, US20100086132,WO2008095784A1,  janvier 2007.

 

*      H. Aiache and C. Tavernier “Procédé pour sécuriser la transmission d'informations”, Publication number EP2119096 A1,US8347084, US20100088511,WO2008095788A1,  janvier 2007.


*      J-L. Rogier and C. Tavernier “Étiquetage réduit et quasi optimal d'un sous-ensemble de concepts formels”, Publication number: WO2010057936 A1, EP2356591 A1, US20120005210 A1, 2008.



________________________________________

 

Participation in European projects:

 

*      ICT project SCISSOR (coordinator) link1, link2, link3, link4, link5, link6.

 

*      IST project DISCREET (participant).

 

*      CELTIC project RED (participant).

 

________________________________________

Cédric Tavernier (Tavernier.Cedric@gmail.com)

Last modification on 27/11/09