"Codes, Cryptology and Information Security" Second International Conference in honor of Professor Claude Carlet at Mohammed V University in Rabat, Morocco, April 10 -12, 2017.
Conference announcement
Mohammed V University is hosting a conference in Rabat to pay tribute to Pr. Claude CARLET for the significant contributions he made to develop teaching and research in the fields of cryptology, coding theory and information security at Mohammed V University in Rabat. The conference also aims to bring together experts and young researchers from all over the world to exchange ideas and discuss recent developments in the areas that have interested Pr. C. Carlet.
The presentations will focus on some of the many topics that Claude has worked on during his career ; like error correcting codes, Boolean functions for cryptography and bent functions, substitution boxes for block ciphers, authentication schemes, secret sharing, side channel attacks, and recently fully homomorphic encryption; and other topics as well, like information theory, algebraic cryptanalysis and polynomial systems, quantum cryptology, protocols based on the identity or attributes, algebraic identification, signature and non-repudiation, communications and network security, Internet of Things and Mobile agents security. Please, find a more detailed description of the topics in the Conference Topics section.
Important dates
- Submission deadline: December 15, 2016
extended to January 02, 2017 - 23:59 utc
- Authors Notification: January 30, 2017
- Camera Ready: February 7, 2017
- Early Registration: Mars 15, 2017
- Conference Date: 10-12 April , 2017
- Social event : 13- 15 April, 2017 : A travel to Marzouga and Marrakech.
See the programm
The Proceeding of this conference will be published in Springer LNCS serie
Keynote Speakers
- Mohammed ESSAAIDI, IEEE Section Morocco, Mohammed V University in Rabat, Morocco
Title: An Overview of The State-of-the-art of cloud computing cyber-security 
Abstract: During the last few years, there has been a rapid and an increasing development and adoption of cloud computing systems, technologies, applications and services. This is owing mainly to many benefits this technology offers for businesses and organizations. However, Cyber-security is considered among the most important issues and concerns for widespread adoption of cloud computing. Indeed, there are several major  security issues and concerns facing Cloud Computing today such as  data security, intrusions attacks, confidentiality and data integrity. This talk is dedicated to an overview of the state of the art of cloud computing cyber-security with the main objective to identify the main challenges and issues in this field, the different approaches and solutions proposed to address them and the open problems that need to be addressed.

- Caroline FONTAINE , Telecom Bretagne, Rennes, France
Title: Somewhat/Fully Homomorphic Encryption: implementation progresses and challenges
Abstract: The goal of this talk is to provide an analysis of the existing efforts to secure and implement Somewhat/Fully Homomorphic Encryption ((S/F)HE) schemes, and to discuss the problems to be tackled in order to progress toward their adoption. For that purpose, we will provide a brief and comprehensive introduction regarding (S/F)HE. Then, we will focus on some practical issues related to the adoption of (S/F)HE schemes, i.e. the security parameters, the existing implementations and their limitations, and the management of the huge complexity caused by homomorphic calculation. These issues will be analyzed and recent related works will be described. Finally, we will discuss some important lessons learned through the literature and through experiments.

- Maria Isabel Garcia Planas, Catalonia University, Barcelone, Espagne
Title: Families of convolutional codes over product of finite fields. A survey
Abstract: The goal of this work is to give explicit  interconnections between control theory and coding. It is well-known the existence of a closed relation between linear systems over finite fields and convolutional codes that allow  to understand some properties of convolutional codes and to construct them. The connection between convolutional codes and linear systems permit to consider control well a and analyze observability of convolutional codes under linear systems point of view.
  An accurate look at the algebraic structure of convolutional codes using techniques of linear systems theory as well  a study of input-state-output representation control systems. A particular  property considered in  control  systems theory called  output-controllability property is analyzed and used for solve the decoding process of these kind of codes.
Finally, the concept of convolutional code as a linear system is extended to  of convolutional codes  over the product of finite fields views as families of convolutional codes.

- Sylvain GUILLEY, TELECOM-ParisTech & Secure-IC S.A.S., France
TITLE : Codes for side-channel attacks and protections
ABSTRACT : This talk will revisit side-channel analysis from the standpoint of coding theory.
On the one hand, the attacker is shown to apply an optimal decoding algorithm in order to recover the secret key from the analysis of the side-channel.
On the other hand, the side-channel protections are presented as a coding problem where the information is mixed with randomness to weaken as much as possible the sensitive information leaked in the side-channel.
Therefore, the field of side-channel analysis is viewed as a struggle between a coder and a decoder.
In this paper, we focus on the main results obtained through this analysis. In terms of attacks, we discuss optimal strategy in various practical contexts, such as type of noise, dimensionality of the leakage and of the model, etc.
Regarding countermeasures, we give a formal analysis of some masking schemes, including enhancements based on codes contributed via fruitful collaborations with Claude.

- Tor HELLESETH, Bergen University, Norway
Title: Some Results on the Known Classes of Quadratic APN functions
Abstract : A function f: GF(2^n) → GF(2^n) is called an APN function if the equation f(x+a) + f(x) = b has at most 2 solutions for any nonzero a and all b in GF(2^n). APN functions are motivated by cryptographic applications but have also strong connections to coding theory and other areas of discrete mathematics.
This paper provides a survey and history of known results on APN functions and their Walsh transform. The Walsh spectra of three classes of quadratic APN functions with previously unknown Walsh spectra are determined, making use of some techniques developed by Dobbertin and Bracken et. al. Furthermore, we prove that a class of quadratic trinomial APN functions recently constructed by Gologlu is affine equivalent to Gold functions.
keywords : Finite fields, APN functions, Walsh transform.

Conference topics TOPICS
Topics of interest include but are not limited to:
Coding theory,
Error correcting codes
Boolean Functions,
Information theory,
Elliptic curves
Finite fields
Information Hiding
Cryptography of algebraic curves,
Euclidean networks Based Cryptography
Stream ciphers
Quantum Cryptology
Symmetric and Asymmetric Cryptographic Protocols
Random generators and pseudorandom
Algebraic Cryptanalysis and polynomial systems
hardware implementations and side channel attacks
Information Security
Identification, Authentication, Signature and Non-repudiation
protocols based on identity or attributes
Intrusion Detection & Prevention
Mobile Security
Smart cards Security
Network Security
Identity and Security in IoT
Big data and Security
Mobile Agents and Security
Operating systems security
Security Models and Architectures
Security Policies, Formal methods & verification
Access Control Models
Ministère     Lab MIA    Faculté des Sciences    Centre Marocain de Recherches Polytechniques et d'Innovation (CMRPI)    Faculté des Sciences