Publications

2017

• Empirical Minimum Volume Set on the Sphere: A Canonical Anomaly Detection Method
  
  • Clémençon Stéphan
  • Gramfort Alexandre
  • Sabourin Anne
  • Thomas Albert
  , 2017.
• Pour une fédération de dépôts locaux d’articles scientifiques sémantiquement reliés.
  
  • Moissinac Jean-Claude Jc
  , 2017.
• A Learning Theory of Ranking Aggregation
  
  • Clémençon Stéphan
  • Korba Anna
  • Sibony Eric
  , 2017.
• Critical Regions for Anomaly Detection via Empirical MV-sets on the Sphere
  
  • Clémençon Stéphan
  , 2017.
• A Coalition Formation Game for Distributed Node Clustering in Mobile Ad Hoc Networks
  
  • Massin Raphaël
  • Le Martret C.
  • Ciblat Philippe
  IEEE Transactions on Wireless Communications, Institute of Electrical and Electronics Engineers, 2017, 16 (6), pp.3940-3952.
• Can we accelerate quantum cryptography commercial take-off?
  
  • Alleaume Romain
  , 2017. Invited Talk at CEWQO Industry sessions
• A 2.5ns-Latency 0.39pJ/b 289µm2/Gb/s Ultra-Light-Weight PRINCE Cryptographic Processor
  
  • Miura Noriyuki
  • Matsuda Kohei
  • Myszkowski Karol
  • Nagata Makoto
  • Bhasin Shivam
  • Yli-Mayry Ville
  • Homma Naofumi
  • Mathieu Yves
  • Graba Tarik
  • Danger Jean-Luc
  , 2017, Digest of Technical Papers, pp.C266-C267. An ultra-light-weight PRINCE cryptographic processor is developed. A fully-unrolled differential-logic architecture saves delay, energy, and area (i.e. hardware weight) of XOR as a dominant cipher component. An S-box is composed only by four kinds of compact composite gates and a replica-delay-based transition-edge aligner prevents glitches accumulated in the long unrolled combinational- logic data path to further suppress the weight. A 28nm CMOS prototype successfully demonstrates 2.5ns-latency with 0.39pJ/b and 289µm 2 /Gb/s of ultra-light-weight cryptographic performance.
• Improved Converses and Gap-Results for Coded Caching
  
  • Wang Chien-Yi
  • Saeedi Bidokhti Shirin
  • Wigger Michèle
  , 2017.
• An efficient Secure Storage Scheme Based on Information Fragmentation
  
  • Qiu Han
  • Memmi Gérard
  • Noura Hassan
  , 2017, pp.108-113.
• Analog-to-Information Converter design for low-power acquisition of astrophysical signals
  
  • Gargouri Yosra
  • Petit Hervé
  • Loumeau Patrick
  • Cecconi Baptiste
  • Desgreys Patricia
  , 2017, pp.113-116. (10.1109/NEWCAS.2017.8010118)
  DOI : 10.1109/NEWCAS.2017.8010118
• Secure video-transmission method, decoder and system, reconfigurable for selective encryption
  
  • Bergeron Cyril
  • Roué Benoit
  • Boyadjis Benoit
  , 2017.
• Controllable Rare Events in Optically-Injected Semiconductor Lasers
  
  • Schires Kevin
  • Grillot Frédéric
  , 2017, pp.paper# CB-9.2 THU.
• Complexity results on dominating codes
  
  • Hudry Olivier
  • Lobstein Antoine
  , 2017.
• Effect of Color Space on High Dynamic Range Video Compression Performance
  
  • Zerman Emin
  • Hulusic Vedad
  • Valenzise Giuseppe
  • Mantiuk, Rafal
  • Dufaux Frederic
  , 2017. High dynamic range (HDR) technology allows for capturing and delivering a greater range of luminance levels compared to traditional video using standard dynamic range (SDR). At the same time, it has brought multiple challenges in content distribution, one of them being video compression. While there has been a significant amount of work conducted on this topic, there are some aspects that could still benefit this area. One such aspect is the choice of color space used for coding. In this paper, we evaluate through a subjective study how the performance of HDR video compression is affected by three color spaces: the commonly used Y'CbCr, and the recently introduced ITP (ICtCp) and Ypu'v'. Five video sequences are compressed at four bit rates, selected in a preliminary study, and their quality is assessed using pairwise comparisons. The results of pairwise comparisons are further analyzed and scaled to obtain quality scores. We found no evidence of ITP improving compression performance over Y'CbCr. We also found that Ypu'v' results in a moderately lower performance for some sequences. (10.1109/qomex.2017.7965632)
  DOI : 10.1109/qomex.2017.7965632
• ConnexSensors: An open IoT solution designed for and by industrials
  
  • Devic Catherine
  • Livolant Erwan
  • Carrié Jean-Patrick
  • Minet Pascale
  • Bellot Patrick
  , 2017.
• À la racine du parallélisme
  
  • Bonald Thomas
  • Comte Céline
  • Mathieu Fabien
  , 2017. Nous considérons un cluster de serveurs traitant des requêtes en parallèle. Si les clients ont en général intérêt à ce que leurs requêtes soient traitées par le plus grand nombre de serveurs, l'impact du parallélisme sur les serveurs est moins clair : trop faible, il ne permet pas d'utiliser pleinement les ressources disponibles ; trop fort, il risque d'encombrer inutilement les serveurs de requêtes en attente. Nous étudions ce phénomène à l'aide d'un modèle de files d'attente où les requêtes arrivent selon un processus de Poisson et requièrent des traitements dont le volume suit une loi exponentielle. Chaque nouvelle requête est affectée à un certain nombre de serveurs, choisis de manière aléatoire, uniforme, et indépendante de l'état du système. Chaque serveur traite ses requêtes dans leur ordre d'arrivée. Nous montrons qu'il existe un degré de parallélisme qui minimise le nombre moyen de requêtes présentes dans chaque serveur. Ce degré optimal est de l'ordre de la racine carrée du nombre de serveurs pour une charge faible à modérée, et décroît jusqu'à deux à très forte charge.
• ASN.1 Specification for ETSI Certificates and Encoding Performance Study
  
  • Hammi Badis
  • Monteuuis Jean Philippe
  • Daniel Eduardo Salles
  • Labiod Houda
  , 2017, pp.291-298. Cooperative Intelligent Transportation Systems (C-ITS) are gaining ground and are almost part of our everyday life. Within these environments, huge amounts of messages are exchanged. Besides, these messages should be secure in order to ensure users' privacy. Public Key Infrastructures (PKI) represent the most common security solution. Due to the vehicles speed, the communication with the PKI should be fully optimized. The European Telecommunications Standards Institute (ETSI) proposes a PKI architecture for C-ITS environments. However, unlike most of security standards as IEEE 1609.2, there is no Abstract Syntax Notation One (ASN.1) specification for the used certificates. For this reason, in this paper, we propose an ASN.1 definition for the ETSI certificate to help developers in its implementation. In addition, we provide an extensive comparative study of the different encoding schemes, applied to this proposal. (10.1109/MDM.2017.47)
  DOI : 10.1109/MDM.2017.47
• Détection et localisation d'anomalies dans des données hétérogènes en utilisant des modèles graphiques non orientés mixtes
  
  • Laby Romain
  , 2017. Cette thèse s’articule autour d’un besoin industriel de la société Thales Système Aéroportés et du radar de combat RBE2 équipant les avions de chasses Dassault Rafale. Elle développe une méthodologie de localisation d’anomalies dans des flux de données hétérogènes en utilisant un modèle graphique mixte non orienté et pairs à pairs. Les données sont un mélange de variables catégorielles et quantitatives, et le modèle est appris à partir d’un jeu de données dont on suppose qu’il ne contient pas de données anormales. Les algorithmes de localisation d’anomalies utilisent une version adaptée de l’algorithme CUSUM, dont la fonction de décision est basée sur le calcul de ratios de vraisemblance conditionnelles. Cette fonction permet de réaliser une détection d’anomalies variable par variable et de localiser précisément les variables impliquées dans l’anomalie.
• Articulatory dynamics in ePGG, Pio, airflow and acoustic data for the Korean fricatives /s, s’
  
  • Hyunsoon Kim S.
  • Maeda Shinji
  • Honda Kiyoshi
  • Crevier-Buchman Lise
  , 2017. This paper is concerned with the speech mechanism and representation of the two-way phonation contrast in Korean fricatives /s, s’/ based on a new non-invasive technique called external lighting and sensing photoglottograph (ePGG) as well as Pio (intra-oral air pressure) above the glottis, airflow and acoustic data. The adduction-abduction movement of the glottis during the production of the fricatives was monitored with light emitting diodes (IR LEDs) placed on the neck exterior surface between the hyoid bone and the thyroid cartilage. Airflow rate was also measured by the principle of pressure-difference anemometry using a protection mask made of synthetic fibers and a differential pressure sensor. Pio was measured by inserting a pressure probe to the pharyngeal cavity via the nostril, and the distance between the end of the probe and the glottis was around 4-5 cm. A multichannel data recorder (Dash-8x, Astro-Med) was used for simultaneous recordings of ePGG, airflow and acoustic data and also for those of Pio, airflow and acoustic data. Four native speakers (2 male and 2 female) of Seoul Korean participated in the experiments.
• Feature Learning with Matrix Factorization Applied to Acoustic Scene Classification
  
  • Bisot Victor
  • Serizel Romain
  • Essid Slim
  • Richard Gael
  IEEE/ACM Transactions on Audio, Speech and Language Processing, Institute of Electrical and Electronics Engineers, 2017, 25 (6), pp.1216 - 1229. In this paper, we study the usefulness of various matrix factorization methods for learning features to be used for the specific Acoustic Scene Classification problem. A common way of addressing ASC has been to engineer features capable of capturing the specificities of acoustic environments. Instead, we show that better representations of the scenes can be automatically learned from time-frequency representations using matrix factorization techniques. We mainly focus on extensions including sparse, kernel-based, convolutive and a novel supervised dictionary learning variant of Principal Component Analysis and Nonnegative Matrix Factorization. An experimental evaluation is performed on two of the largest ASC datasets available in order to compare and discuss the usefulness of these methods for the task. We show that the unsupervised learning methods provide better representations of acoustic scenes than the best conventional hand-crafted features on both datasets. Furthermore, the introduction of a novel nonnegative supervised matrix factorization model and Deep Neural networks trained on spectrograms, allow us to reach further improvements. (10.1109/TASLP.2017.2690570)
  DOI : 10.1109/TASLP.2017.2690570
• At every corner: Determining corner points of two-user Gaussian interference channels
  
  • Rioul Olivier
  , 2017. (10.1109/ICC.2017.7996882)
  DOI : 10.1109/ICC.2017.7996882
• Distributed faulty node detection in DTNs in presence of Byzantine attack
  
  • Li Wenjie
  • Bassi Francesca
  • Kieffer Michel
  • Calisti Alex
  • Pasolini Gianni
  • Dardari Davide
  , 2017, pp.1 - 6. This paper considers a delay tolerant network consisting of nodes equipped with sensors, some of them producing outliers. A distributed faulty node detection (DFD) algorithm, whose aim is to help each node in estimating the status of its sensors, has been proposed recently by the authors. The aim of this paper is to analyze the robustness of the DFD algorithm to the presence of misbehaving nodes performing Byzantine attacks. Two types of attacks are considered and analyzed, each trying to mislead the other nodes in the estimation of the status of their sensors. This provides insights on the way the parameters of the DFD algorithm should be adapted to minimize the impact of misbehaving nodes. Theoretical results are illustrated with simulations considering nodes with random displacements, as well as traces of node inter-contact times from real databases. (10.1109/ICC.2017.7996846)
  DOI : 10.1109/ICC.2017.7996846
• Achieving joint secrecy with cache-channel coding over erasure broadcast channels
  
  • Kamel S.
  • Sarkiss M.
  • Wigger M.
  , 2017. We derive upper and lower bounds on the secure capacity-memory tradeoff of the K-user (K > 2) wiretap erasure broadcast channel where Kw receivers are weak and have cache memories of equal size, and Ks receivers are strong and have no cache. The bounds coincide for small and large cache memories. The lower bound also exhibits that cache memories provide larger gains under a secrecy constraint than without such a constraint. The lower bound is based on a joint cache-channel coding scheme that simultaneously exploits the cache contents and the channel statistics. Moreover, we show for the two-user scenario that in the regime of small cache memories, the capacity-memory tradeoff is larger when only the weaker receiver has cache memory than when this cache memory is split equally among the two receivers. (10.1109/ICC.2017.7996927)
  DOI : 10.1109/ICC.2017.7996927
• Double Iterative Waterfilling for Sum Rate Maximization in Multicarrier NOMA Systems
  
  • Fu Yaru
  • Salaün Lou
  • Sung Chi Wan
  • Chen Chung Shue
  • Coupechoux Marceau
  , 2017. This paper investigates the subcarrier and power allocation for the downlink of a multicarrier non-orthogonal multiple access (MC-NOMA) system. A three-step algorithm is proposed to deal with the sum rate maximization problem. In Step 1, we assume that each user can use all the subcarriers simultaneously and apply the synchronous iterative waterfilling algorithm (SIWA) to obtain a power vector for each user. In Step 2, subcarriers are assigned to users by a heuristic greedy method based on the achieved power allocation result of Step 1. In Step 3, SIWA is used once again to further improve the system performance with the obtained subcarrier assignment result of Step 2. The convergence of SIWA in Step 3 is proved when the number of multiplexed users is no more than two. Since SIWA is applied twice, we call our three-step method Double Iterative Waterfilling Algorithm (DIWA). Numerical results show that the proposed DIWA achieves comparable performance to an existing near-optimal solution but with much lower time complexity. (10.1109/ICC.2017.7996797)
  DOI : 10.1109/ICC.2017.7996797
• Multivariate multitarget high order side-channel attacks
  
  • Bruneau Nicolas
  , 2017. Side Channel Attacks are a classical threat against cryptographic algorithms in embedded systems. They aim at exploiting the physical leakages unintentionally emitted by the devices during the execution of their embedded programs to recover sensitive data. As such attacks represent a real threat against embedded systems different countermeasures have been developed. In thesis we investigate their security in presence of multiple leakages. Indeed there often are in the leakage measurements several variables which can be exploited to mount Side Channel Attacks. In particular we show in this thesis the optimal way to exploit multiple leakages of a unique variable. This dimensionality reduction comes with no loss on the overall exploitable information. Based on this result we investigate further how such dimensionality reduction methodscan be applied in the case of protected implementations. We show that the impact of such methods increases with the security “level” of the implementation. We also investigate how to exploit the leakages of multiplevariables in order to improve the results of Side Channel Analysis. We start by improving the attacks against masking schemes, with a precomputed table recomputation step. Some protections have been developed to protect such schemes. As a consequence we investigate the security provided by these protections. In this context we present results which show that the main parameter to evaluate the security of the masking schemes is not sufficient to estimate the global security of the implementation. Finally we show that in the context of masking scheme with shuffling the optimal attack is not computable. As a consequence we present a truncated version of this attack with a better effectiveness.