Publications

2019

• Linewidth enhancement factor and optical injection in a hybrid-silicon quantum dot comb laser
  
  • Dong Bozhang
  • Sawadogo Alfred Bewindin
  • Duan Jianan
  • Huang Heming
  • Kurczveil Geza
  • Liang Di
  • Grillot Frédéric
  , 2019. This work reports on the impact of the linewidth enhancement factor and the optical injection in a hybrid quantum dot comb laser. Results show that both the optical bandwidth and the flatness of the optical frequency comb can be improved.
• Odyn: Deadlock Prevention and Hybrid Scheduling Algorithm for Real-Time Dataflow Applications
  
  • Dauphin Benjamin
  • Enrici Andrea
  • Apvrille Ludovic
  • Pacalet Renaud
  , 2019. In recent wireless communication standards (4G, 5G), the growing need for dynamic adjustments of transmission parameters (e.g., modulation, bandwidth, channel coding rate) makes traditional static scheduling approaches less and less efficient. The reason being that precomputed fixed mapping and scheduling prevent the system from dynamically adapting to changes of the operating conditions (e.g. wireless channel quality, available bandwidth). In this paper, we present Odyn, a hybrid approach for the scheduling and memory management of periodic dataflow applications on parallel, heterogeneous, Non-Uniform Memory Architecture (NUMA) platforms. In Odyn, the ordering of tasks and memory allocation are distributed and computed simultaneously at run-time for each Processing Element. Odyn also proposes a mechanism to prevent deadlocks caused by attempts to allocate buffers in size-limited memories. This technique, based on the static computation of exclusion relations among buffers in a target application, removes the need for backtracking that is typical of dynamic scheduling algorithms. We demonstrate the effectiveness of Odyn on a testbench that simulates the interactions of randomly generated concurrent applications. We also demonstrate its deadlock prevention technique on a selection of use cases.
• LAOCOÖN: A Run-Time Monitoring and Verification Approach for Hardware Trojan Detection
  
  • Danger Jean-Luc
  • Fribourg Laurent
  • Kühne Ulrich
  • Naceur Maha
  , 2019, pp.269-276. (10.1109/DSD.2019.00047)
  DOI : 10.1109/DSD.2019.00047
• A generic coordinate descent solver for nonsmooth convex optimization
  
  • Fercoq Olivier
  Optimization Methods and Software, Taylor & Francis, 2019, pp.1-21. We present a generic coordinate descent solver for the minimization of a nonsmooth convex objective with structure. The method can deal in particular with problems with linear constraints. The implementation makes use of efficient residual updates and automatically determines which dual variables should be duplicated. A list of basic functional atoms is pre-compiled for efficiency and a modelling language in Python allows the user to combine them at run time. So, the algorithm can be used to solve a large variety of problems including Lasso, sparse multinomial logistic regression, linear and quadratic programs. (10.1080/10556788.2019.1658758)
  DOI : 10.1080/10556788.2019.1658758
• A strategy for soft-error vulnerability estimation using the single-event transient susceptibilities of each gate
  
  • Batagin Armelin Fábio
  , 2019. The Soft-Error Vulnerability (SEV) is an estimated parameter that, in conjunction with the characteristics of the radiation environment, is used to obtain the Soft-Error Rate (SER), that is a metric used to predict how digital systems will behave in this environment. Currently, the most confident method for SER estimation is the radiation test, since it has the actual interaction of the radiation with the electronic device. However, this test is expensive and requires the real device, that becomes available late on the design cycle. These restrictions motivated the development of other SER and SEV estimation methods, including analytical, electrical and logic simulations, and emulation-based approaches. These techniques usually incorporate the logical, electrical and latching-window masking effects into the estimation process. Nevertheless, most of them do not take into account a factor that is intrinsic to the radiation test: the probability of the radiation particle to produce a Soft-Error (SE) at the output of the gates of the circuit, referred to as Single-Event Transient (SET) susceptibility. In this context, we propose a strategy for SEV estimation based on these SET susceptibilities, suitable for simulation- and emulation-based frameworks. In a simplified version of this strategy, the SET susceptibilities take into account only the effects of the gate topology, while in a complete version, these susceptibilities consider both the topology and the operation of the circuit, that affects its input pattern distribution. The proposed strategy was evaluated with a simulation-based framework, estimating the SEV of 38 benchmark circuits. The results show that both versions of the strategy lead to an improvement in the estimation accuracy, with the complete version presenting the lowest estimation error. Finally, we show the feasibility of adopting the proposed strategy with an emulation-based framework.
• Influence of the polarization anisotropy on the linewidth enhancement factor and reflection sensitivity of 1.55- μm InP-based InAs quantum dash lasers
  
  • Dong Bozhang
  • Duan Jianan
  • Shang Chen
  • Huang Heming
  • Sawadogo Alfred Bewindin
  • Jung Dahwan
  • Wan Yating
  • Bowers John
  • Grillot Frédéric
  Applied Physics Letters, American Institute of Physics, 2019, 115 (9), pp.091101. (10.1063/1.5110768)
  DOI : 10.1063/1.5110768
• Appariement difféomorphique robuste de faisceaux neuronaux
  
  • Roussillon Pierre
  • Thiery Jean-Marc
  • Bloch Isabelle
  • Gori Pietro
  , 2019. Dans cet article, nous nous intéressons à l'appariement difféomorphique de faisceaux du cerveau. Ce problème est complexe car deux faisceaux n'ont presque jamais le même nombre de fibres. Ces variations topologiques peuvent détériorer les déformations obtenues et fausser les interprétations cliniques. Nous proposons ici une méthode robuste aux différences topologiques, grâce à la combinaison de normes L p et de métriques à noyaux adaptées à l'espace des fibres. Les résultats sur des exemples jouets et sur des données réelles sont prometteurs. Abstract-In this article, we study the diffeomorphic matching of brain fibers bundles. This problem is complex because there is no topological correspondence between two bundles, namely two bundles do not have the same number of fibers. This strongly deteriorates the deformations obtained and can lead to a wrong clinical intepretation. We present a method that is robust to topological differences, by combining L p norms and kernel-based metrics adapted to the space of fibers. We test the effectivenes of our method on both toy examples and brain fiber bundles.
• Multi-library coded caching with partial secrecy
  
  • Wigger Michèle
  • Sarkiss Mireille
  , 2020. The paper considers a coded caching setup with two libraries and where only one of them needs to be kept secret from an external eavesdropper. We provide upper and lower bounds on the secrecy rate-memory tradeoff for systems with K = 2 or K = 3 receivers. Our bounds are tight in some regimes and show that the standard (non-secure) coded caching upper bound can be approached for a wide range of parameters. In some cases, the proposed upper bound on the secrecy rate-memory tradeoff is even lower than the lower bound for standard coded caching. The reason is that in our setup the ratio of receivers requesting secure files over those requesting nonsecure files is fixed and known to everyone in advance. The transmitter can thus adjust the contents stored in the cache memories to this ratio. (10.1109/ITW44776.2019.8989309)
  DOI : 10.1109/ITW44776.2019.8989309
• Precise Spatio-Temporal Electromagnetic Fault Injections on Data Transfers
  
  • Menu Alexandre
  • Bhasin Shivam
  • Dutertre Jean-Max
  • Rigaud Jean-Baptiste
  • Danger Jean-Luc
  , 2019, pp.1-8. Fault injection techniques allow an attacker to alter the behavior of an electronic device in order to extract confidential information or be granted unauthorized privileges. To this end, local electromagnetic fault injections (EMFI) are commonly used to corrupt or prevent the execution of instructions. However, little attention is devoted to practical data corruption. This article investigates the local effects of EMFI on data transfer from the Flash memory to the 128-bit data buffer of a cortex-M microcontroller. We demonstrate that the corrupted bits are closely related to the location of the injection probe, allowing us to set or reset from 0 to 128 bits with a byte- level precision. Moreover, the spatial and temporal accuracy of the injection technique allowed us to target the data prefetch mechanism without corrupting the code execution. We highlight the efficiency of the derived fault model with three practical case studies. Firstly, we demonstrate precise key- zeroing and key-setting capability, with further extension to a DFA on the secret key of a cipher from Biham and Shamir, that was never implemented practically. Next, we report practical persistent faults on ARM microcontroller, which allows an attacker to retrieve the secret key of a cipher with a single successful injection. (10.1109/FDTC.2019.00009)
  DOI : 10.1109/FDTC.2019.00009
• Detecting Faults in Inner-Product Masking Scheme - IPM-FD: IPM with Fault Detection
  
  • Cheng Wei
  • Carlet Claude
  • Goli Kouassi
  • Danger Jean-Luc
  • Guilley Sylvain
  , 2019, 11, pp.17-32. Side-channel analysis and fault injection attacks are two typical threats to cryptographic implementations, especially in modern embedded devices. Thus there is an insistent demand for dual side-channel and fault injection protections. As it is known, masking scheme is a kind of provable countermeasures against side-channel attacks. Recently, inner product masking (IPM) was proposed as a promising higher-order masking scheme against side-channel analysis, but not for fault injection attacks. In this paper, we devise a new masking scheme named IPM-FD. It is built on IPM, which enables fault detection. This novel masking scheme has three properties: the security orders in the word-level probing model, bit-level probing model, and the number of detected faults. IPM-FD is proven secure both in the word-level and in the bit-level probing models, and allows for end-to-end fault detection against fault injection attacks. Furthermore, we illustrate its security order by linking it to one defining parameters of linear code, and show its implementation cost by applying IPM-FD to AES-128. (10.29007/fv2n)
  DOI : 10.29007/fv2n
• Object removal from complex videos using a few annotations
  
  • Le Thuc Trinh
  • Almansa Andrés
  • Gousseau Yann
  • Masnou Simon
  Computational Visual Media, Springer, 2019, 5, pp.267–291. We present a system for the removal of objects from videos. As an input, the system only needs a user to draw a few strokes on the first frame, roughly delimiting the objects to be removed. To the best of our knowledge, this is the first system allowing the semi-automatic removal of objects in videos with complex backgrounds. The key steps of our system are the following: after initialization, segmentation masks are first refined and then automatically propagated through the video. The missing regions are then synthesized using video inpainting techniques. Our system can deal with multiple, possibly crossing objects, with complex motions, and with dynamic textures. This results in a computational tool that can alleviate tedious manual operations for editing high-quality videos. (10.1007/s41095-019-0145-0)
  DOI : 10.1007/s41095-019-0145-0
• COSMOS: optical architecture and prototyping
  
  • Gutterman Craig
  • Minakhmetov Artur
  • Sherman Michael
  • Yu Jiakai
  • Chen Tingjun
  • Zhu Shengxiang
  • Zussman Gil
  • Seskar Ivan
  • Raychaudhuri Dipankar
  • Kilper Dan
  , 2019, pp.1-1. (10.1145/3363542.3363546)
  DOI : 10.1145/3363542.3363546
• Understanding the Role of Alternatives in Data Analysis Practices
  
  • Liu Jiali
  • Boukhelifa Nadia
  • Eagan James
  IEEE Transactions on Visualization and Computer Graphics, Institute of Electrical and Electronics Engineers, 2019, 26 (1), pp.66--76. Data workers are people who perform data analysis activities as a part of their daily work but do not formally identify as data scientists. They come from various domains and often need to explore diverse sets of hypotheses and theories, a variety of data sources, algorithms, methods, tools, and visual designs. Taken together, we call these alternatives. To better understand and characterize the role of alternatives in their analyses, we conducted semi-structured interviews with 12 data workers with different types of expertise. We conducted four types of analyses to understand 1) why data workers explore alternatives; 2) the different notions of alternatives and how they fit into the sensemaking process; 3) the high-level processes around alternatives; and 4) their strategies to generate, explore, and manage those alternatives. We find that participants' diverse levels of domain and computational expertise, experience with different tools, and collaboration within their broader context play an important role in how they explore these alternatives. These findings call out the need for more attention towards a deeper understanding of alternatives and the need for better tools to facilitate the exploration, interpretation, and management of alternatives. Drawing upon these analyses and findings, we present a framework based on participants' 1) degree of attention, 2) abstraction level, and 3) analytic processes. We show how this framework can help understand how data workers consider such alternatives in their analyses and how tool designers might create tools to better support them. (10.1109/TVCG.2019.2934593)
  DOI : 10.1109/TVCG.2019.2934593
• Handwriting and Drawing Features for Detecting Negative Moods
  
  • Cordasco Gennaro
  • Scibelli Filomena
  • Faundez-Zanuy Marcos
  • Likforman-Sulem Laurence
  • Esposito Anna
  , 2019, 103, pp.73-86. In order to provide support to the implementation of on-line and remote systems for the early detection of interactional disorders, this paper reports on the exploitation of handwriting and drawing features for detecting negative moods. The features are collected from depressed, stressed, and anxious subjects, assessed with DASS-42, and matched by age and gender with handwriting and drawing features of typically ones. Mixed ANOVA analyses, based on a binary categorization of the groups, reveal significant differences among features collected from subjects with negative moods with respect to the control group depending on the involved exercises and features categories (in time or frequency of the considered events). In addition, the paper reports the description of a large database of handwriting and drawing features collected from 240 subjects (10.1007/978-3-319-95095-2_7)
  DOI : 10.1007/978-3-319-95095-2_7
• Locator/ID Separation Protocol (LISP) Map-Versioning.
  
  • Iannone Luigi
  • Saucez Damien
  • Bonaventure Olivier
  Internet Engineering Task Force, IETF, 2019. This document describes the LISP (Locator/ID Separation Protocol) Map-Versioning mechanism, which provides in-packet information about Endpoint ID to Routing Locator (EID-to-RLOC) mappings used to encapsulate LISP data packets. The proposed approach is based on associating a version number to EID-to-RLOC mappings and the transport of such a version number in the LISP-specific header of LISP-encapsulated packets. LISP Map-Versioning is particularly useful to inform communicating Ingress Tunnel Routers (ITRs) and Egress Tunnel Routers (ETRs) about modifications of the mappings used to encapsulate packets. The mechanism is optional and transparent to implementations not supporting this feature, since in the LISP- specific header and in the Map Records, bits used for Map-Versioning can be safely ignored by ITRs and ETRs that do not support or do not want to use the mechanism. This document obsoletes RFC 6834 "Locator/ID Separation Protocol (LISP) Map-Versioning", which is the initial experimental specifications of the mechanisms updated by this document.
• Determinants of Social Networking Usage and Regret in Two Cultural Settings: France and Thailand
  
  • Hajer Kefi
  • Nanthaamornphong Aziz
  • Bressan Stéphane
  • Abdessalem Talel
  , 2019, pp.1-10. Regret is an unpleasant outcome of social networking sites (SNS) usage which is exponentially experi-enced and could negatively affect the continuance intention to social networking on SNS. In this pa-per, we address this issue with reference to the Uses and Gratification Theory and position interper-sonal connectivity, entertainment, exhibitionism and voyeurism as determinants of social networking usage and also of social networking regret. We investigate how actual social networking usage could lead to regret and how both could affect the continuous intention of social networking usage on Face-book. The model is tested within two samples representing a Western culture (France, N=246) and an Asian culture (Thailand, N=206 respectively). Our results show that SNS usage and regret are experi-enced differently by the two samples. To date, empirical works that investigate SNS usage and regret in a multicultural setting have been rare. This paper contributes to filling this theoretical and empirical gap.
• Towards practical hologram streaming using progressive coding
  
  • El Rhammad Anas
  • Gioia Patrick
  • Gilles Antonin
  • Cagnazzo Marco
  , 2019, pp.50. Digital holography is an emerging technology for 3D visualization which is expected to dethrone conventional stereoscopic devices in the future. Aside from their specific signal properties, high quality holograms with broad viewing angles contain massive amount of data. For a reasonable transmission time, efficient scalable compression schemes are needed to bridge the gap between the overwhelming volume of data and the limited bandwidth of the communication channels. The viewpoint scalability is a powerful property since it allows to encode and transmit only the information corresponding to the observer’s view. However, this approach imposes an online encoding at the server which may increase the latency of the transmission chain. To overcome this hurdle, we propose a scalable compression framework based on Gabor-wavelets decomposition, where the whole hologram is encoded offline. First, the observer plane is divided into spatial blocks. Then, the Gabor atoms are assigned to these blocks by exploiting the duality between Gabor wavelets and light rays. The atoms of each block are then classified into different layers according to their importance for the reconstruction and encoded in packets. At the decoder side, the atoms’ packets are progressively decoded based on the viewer’s position. Then, the corresponding sub-hologram is generated using a GPU implementation. Results show that our approach enables a practical progressive streaming of digital holograms with a low latency. (10.1117/12.2529202)
  DOI : 10.1117/12.2529202
• Secrecy capacity-memory tradeoff of erasure broadcast channels
  
  • Kamel Sarah
  • Sarkiss Mireille
  • Wigger Michèle
  • Rekaya-Ben Othman Ghaya
  IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2019, 65 (8), pp.5094-5124. This paper derives upper and lower bounds on the secrecy capacity-memory tradeoff of a wiretap erasure broadcast channel (BC) with K w weak receivers and K s strong receivers, where weak receivers and strong receivers have the same erasure probabilities and cache sizes, respectively. The lower bounds are achieved by the schemes that meticulously combine joint cache-channel coding with wiretap coding and key-aided one-time pads. The presented upper bound holds more generally for arbitrary degraded BCs and arbitrary cache sizes. When only weak receivers have cache memories, upper and lower bounds coincide for small and large cache memories, thus providing the exact secrecy capacity-memory tradeoff for this setup. The derived bounds further allow us to conclude that the secrecy capacity is positive even when the eavesdropper is stronger than all the legitimate receivers with cache memories. Moreover, they show that the secrecy capacity-memory tradeoff can be significantly smaller than its non-secure counterpart, but it grows much faster when cache memories are small. This paper also presents a lower bound on the global secrecy capacity-memory tradeoff where one is allowed to optimize the cache assignment subject to a total cache budget. It is close to the best known lower bound without secrecy constraint. For small total cache budget, the global secrecy capacity-memory tradeoff is achieved by assigning all the available cache memory uniformly over all the receivers if the eavesdropper is stronger than all the legitimate receivers, and it is achieved by assigning the cache memory uniformly only over the weak receivers if the eavesdropper is weaker than the strong receivers. (10.1109/TIT.2019.2902578)
  DOI : 10.1109/TIT.2019.2902578
• Channel Model and Optimal Core Scrambling for Multi-Core Fiber Transmission System
  
  • Abouseif Akram
  • Rekaya-Ben Othman Ghaya
  • Jaouën Yves
  Optics Communications, Elsevier, 2019, pp.55. Space division multiplexing (SDM) is a potential candidate to increase the capacity of the conventional single mode fiber based transmission systems. Several multi-core fiber (MCF) structures have been proposed, each one is impaired by different core depen- dent loss (CDL) resulting from the fiber structure, crosstalk, splicing in the optical fiber link and inline components. One of the solutions to mitigate the CDL is the core scrambling. In this paper, we introduce three deterministic core scrambling strategies for different MCFs. The strategies show their efficiency to reduce the CDL compared to the random scrambling. Moreover, in order to estimate the CDL level and predict the system performance for any MCF structure, we propose a theoretical channel model depends on the system configuration and the number of core scrambling installed in the transmission link. Lastly, the optimal deterministic core scrambler is obtained for further reduction of the scramblers number.
• Weightwise perfectly balanced functions with high weightwise nonlinearity profile
  
  • Liu Jian
  • Mesnager Sihem
  Designs, Codes and Cryptography, Springer Verlag, 2019, 87 (8), pp.1797-1813. (10.1007/s10623-018-0579-x)
  DOI : 10.1007/s10623-018-0579-x
• Zero Forcing Pre-Compensation Technique for Multi-Core Fiber Transmission System
  
  • Abouseif Akram
  • Rekaya-Ben Othman Ghaya
  • Jaouën Yves
  , 2019.
• Small Cell Deployment Along Roads: Coverage Analysis and Slice-Aware RAT Selection
  
  • Ghatak Gourab
  • de Domenico Antonio
  • Coupechoux Marceau
  IEEE Transactions on Communications, Institute of Electrical and Electronics Engineers, 2019, 67 (8), pp.5875 - 5891. We characterize a multi-tier wireless network consisting of multi-radio access technology (RAT) small cells, operating in both sub-6GHz and millimeter wave (mm-wave) bands, overlaid on top of traditional macro cells. To realistically characterize the user equipment (UE) performance, we model the position of the small cells along roads. First, we provide tractable, yet realistic models to characterize the mm-wave interference and the effect of vehicular blockages on the mm-wave signals. Then, we introduce an association policy, where an UE selects the serving tier using the powers measured on the sub-6GHz band, and then, using the biased power of the mm-wave band, selects the RAT. Based on this, we derive the signal to interference plus noise ratio (SINR) coverage probabilities of pedestrian UEs. We investigate the effect of the RAT selection bias on the vehicular blockage, SINR coverage, and rate coverage experienced by the UEs. Leveraging the results of our analysis, we propose to use a varied range of RAT selection biases to support the diverse applications of the fifth generation (5G) mobile networks. Accordingly, we provide a slice-aware RAT selection strategy to support three types of services, characterized by different requirements in terms of reliability, coverage, and data rates. (10.1109/TCOMM.2019.2916794)
  DOI : 10.1109/TCOMM.2019.2916794
• Malliavin and Dirichlet structures for independent random variables
  
  • Decreusefond Laurent
  • Halconruy Hélène
  Stochastic Processes and their Applications, Elsevier, 2019, 129 (8), pp.2611-2653. On any denumerable product of probability spaces, we construct a Malliavin gradient and then a divergence and a number operator. This yields a Dirichlet structure which can be shown to approach the usual structures for Poisson and Brownian processes. We obtain versions of almost all the classical functional inequalities in discrete settings which show that the Efron-Stein inequality can be interpreted as a Poincaré inequality or that Hoeffding decomposition of U-statistics can be interpreted as a chaos decomposition. We obtain a version of the Lyapounov central limit theorem for independent random variables without resorting to ad-hoc couplings, thus increasing the scope of the Stein method. (10.1016/j.spa.2018.07.019)
  DOI : 10.1016/j.spa.2018.07.019
• The Curse of Class Imbalance and Conflicting Metrics with Machine Learning for Side-channel Evaluations
  
  • Picek Stjepan
  • Heuser Annelie
  • Jovic Alan
  • Bhasin Shivam
  • Regazzoni Francesco
  IACR Transactions on Cryptographic Hardware and Embedded Systems, IACR, 2019, 2019 (1), pp.1-29. We concentrate on machine learning techniques used for profiled side-channel analysis in the presence of imbalanced data. Such scenarios are realistic and often occurring, for instance in the Hamming weight or Hamming distance leakage models. In order to deal with the imbalanced data, we use various balancing techniques and we show that most of them help in mounting successful attacks when the data is highly imbalanced. Especially, the results with the SMOTE technique are encouraging, since we observe some scenarios where it reduces the number of necessary measurements more than 8 times. Next, we provide extensive results on comparison of machine learning and side-channel metrics, where we show that machine learning metrics (and especially accuracy as the most often used one) can be extremely deceptive. This finding opens a need to revisit the previous works and their results in order to properly assess the performance of machine learning in side-channel analysis. (10.13154/tches.v2019.i1.209-237)
  DOI : 10.13154/tches.v2019.i1.209-237
• Oblique Wide-Angle Multi-Sector Metamaterial Absorber for Space Applications
  
  • Rance Olivier
  • Lepage Anne Claire
  • Begaud Xavier
  • Elis Kevin
  • Capet Nicolas
  Applied Sciences, Multidisciplinary digital publishing institute (MDPI), 2019, 9 (16), pp.3425. This article presents the design, realization and measurement of lightweight absorbing material for space applications. The electromagnetic absorber, operating on the [2 GHz, 2.3 GHz] frequency band, is designed for oblique incidence ranging from 35° to 65°. Wide-angle designs are demonstrated to be particularly challenging at oblique incidence and an approach consisting in dividing the surface in two different sectors with respect to the incoming angle is proposed. A specific measurement setup is presented in order to characterize this new kind of evolutive absorber. The measurement results show that the sectorial absorber achieves a reflection coefficient inferior to −11.5 dB, corresponding to an absorptivity above 0.965 on the frequency band [2 GHz, 2.3 GHz] for both TE and TM polarizations for angles of incidence varying from 35° to 65°. (10.3390/app9163425)
  DOI : 10.3390/app9163425