Publications

2022

• Threats to Adversarial Training for IDSs and Mitigation
  
  • Chaitou Hassan
  • Robert Thomas
  • Leneutre Jean
  • Pautet Laurent
  , 2022, pp.226-236. Intrusion Detection Systems (IDS) are essential tools to protect network security from malicious traffic. IDS have recently made significant advancements in their detection capabilities through deep learning algorithms compared to conventional approaches. However, these algorithms are susceptible to new types of adversarial evasion attacks. Deep learning-based IDS, in particular, are vulnerable to adversarial attacks based on Generative Adversarial Networks (GAN). First, this paper identifies the main threats to the robustness of IDS against adversarial sample attacks that aim at evading IDS detection by focusing on potential weaknesses in the structure and content of the dataset rather than on its representativeness. In addition, we propose an approach to improve the performance of adversarial training by driving it to focus on the best evasion candidates samples in the dataset. We find that GAN adversarial attack evasion capabilities are significantly reduced when our method is used to strengthen the IDS. (10.5220/0011277600003283)
  DOI : 10.5220/0011277600003283
• On the Practicality of Relying on Simulations in Different Abstraction Levels for Pre-silicon Side-Channel Analysis
  
  • Bahrami Javad
  • Ebrahimabadi Mohammad
  • Takarabt Sofiane
  • Danger Jean-Luc
  • Guilley Sylvain
  • Karimi Naghmeh
  , 2022, 1, pp.661-668. Cryptographic chips are prone to side-channel analysis attacks aiming at extracting their secrets. Side-channel leakage is particularly hard to remove completely, unless using a bottom-up approach (compositional security). On the contrary, industrial secure-by-design methods are rather relying on a top-down approach: (would-be) protected circuits are synthesized by Electronic Design Automation (EDA) tools. Tracking that no leakage exists at any refinement stage is therefore a challenge. Experience has shown that multiple leakages can resurge out of the blue when a sound RTL design is turned into a technology-mapped netlist. Checking for leaks and identifying them is a challenge. When the netlist is unstructured (e.g., it results from an EDA tool), dynamic checking appears as the most straightforward approach. It is feasible, given only a few thousand execution traces, to decide with a great certainty whether a leakage hides at some time samples within the trace or not. In pr actice, such easy detection is fostered by the fact that the activity of signals in cryptographic implementations (even more true for masked implementations) is almost maximal (=50%). The remaining question is about the adequate abstraction level of the simulation. The higher as possible abstractions are preferred, as they potentially capture more situations. However, if the simulation is too abstract, it may model the reality inappropriately. In this paper, we explore whether or not an evenemential simulation (toggle count) is faithful with respect to a low-level simulation (at SPICE level). Our results show that both abstraction levels match qualitatively for unprotected implementations. However, abstract toggle count simulations are no longer connected to real SPICE simulations in masked implementations. The reason is that the effect of the random mask is to mix evenemential simulations (which only reflect “approximately” the SPICE reality) together, in such a way that the useful information is lost. Therefore, masked logic netlist implementations shall be analysed only at SPICE level (10.5220/0011307600003283)
  DOI : 10.5220/0011307600003283
• Quantum Dots for Photonic Integrated Circuits: From Isolation-Free to Amplitude Noise Squeezing
  
  • Dong Bozhang
  • Zhao Shiyuan
  • Duan Jianan
  • Huang Heming
  • Norman Justin
  • Bowers John
  • Grillot Frederic
  , 2022, pp.1-2. This paper reports on an InAs/GaAs quantum-dot (QD) laser for uncooled and isolation-free photonic integrated circuits. All lasing properties are improved with the increase of temperature by applying a design of optical wavelength detuning. The QD laser can also be used for squeezed light generation. (10.1109/SUM53465.2022.9858311)
  DOI : 10.1109/SUM53465.2022.9858311
• Interband cascade technology for next-generation mid-IR communication and quantum applications
  
  • Spitz Olivier
  • Zhao Shiyuan
  • Didier Pierre
  • Diaz-Thomas Daniel Andres
  • Cerutti Laurent
  • Baranov Alexei
  • Knotig Hedwig
  • Weih Robert
  • Koth Johannes
  • Schwarz Benedikt
  • Grillot Frederic
  , 2022, pp.1-2. To achieve mid-infrared wavelength operation with semiconductor technology, efforts were mainly focused on in-tersubband devices requiring high voltage and current. In this work, we show our latest progress with energy -efficient interband emitters and receivers, paving the way towards application like free-space communication and squeezed light. (10.1109/SUM53465.2022.9858128)
  DOI : 10.1109/SUM53465.2022.9858128
• Parallelization of independently addressable frequency domain quantum gates for measurement and distribution of spectrally entangled photons pairs
  
  • Henry Antoine
  • Zaquine Isabelle
  • Fioretto Dario
  • Procopio Lorenzo
  • Monfray Stephane
  • Boeuf Frédéric
  • Vivien Laurent
  • Belabas Nadia
  • Cassan Eric
  • Ramos Carlos Alonso
  • Bencheikh K.
  , 2022.
• Interactive authoring of 3D shapes represented as programs
  
  • Michel Élie
  , 2022. Although hardware and techniques have considerably improved over the years at handling heavy content, digital 3D creation remains fairly complex, partly because the bottleneck also lies in the cognitive load imposed over the designers. A recent shift to higher-order representation of shapes, encoding them as computer programs that generate their geometry, enables creation pipelines that better manage the cognitive load, but this also comes with its own sources of friction. We study in this thesis new challenges and opportunities introduced by program-based representations of 3D shapes in the context of digital content authoring. We investigate ways for the interaction with the shapes to remain as much as possible in 3D space, rather than operating on abstract symbols in program space. This includes both assisting the creation of the program, by allowing manipulation in 3D space while still ensuring a good generalization upon changes of the free variables of the program, and helping one to tune these variables by enabling direct manipulation of the output of the program. We explore diversity of program-based representations, focusing various paradigms of visual programming interfaces, from the imperative directed acyclic graphs (DAG) to the declarative Wang tiles, through more hybrid approaches. In all cases we study shape programs that evaluate at interactive rate, so that they fit in a creation process, and we push this by studying synergies of program-based representations with real time rendering pipelines.We enable the use of direct manipulation methods on DAG output thanks to automated rewriting rules and a non-linear filtering of differential data. We help the creation of imperative shape programs by turning geometric selection into semantic queries and of declarative programs by proposing an interface-first editing scheme for authoring 3D content in Wang tiles. We extend tiling engines to handle continuous tile parameters and arbitrary slot graphs, and to suggest new tiles to add to the set. We blend shape programs into the visual feedback loop by delegating tile content evaluation to the real-time rendering pipeline or exploiting the program's semantics to drive an impostor-based level-of-details system. Overall, our series of contributions aims at leveraging program-based representations of shapes to make the process of authoring 3D digital scenes more of an artistic act and less of a technical task.
• PE-AONT: Partial Encryption All or Nothing Transform
  
  • Kapusta Katarzyna
  • Memmi Gerard
  , 2022, pp.636-641. We introduce PE-AONT: a novel algorithm for very fast computational secret sharing scheme. The core idea of this scheme is to encrypt the data only partially before applying an all-or-nothing transform that will blend the encrypted and non-encrypted data. By doing this, we achieve much better performance than relevant techniques including straightforward encryption. To this regard, a performance benchmark is provided. Interestingly, when the ratio between the number of encrypted and non-encrypted fragments is wisely chosen, data inside fragments are protected against exposure of the encryption key unless all fragments are gathered by an attacker. Therefore, by choosing the right parameters, we can achieve key exposure protection, faster processing, and a better overall protection. (10.5220/0011300600003283)
  DOI : 10.5220/0011300600003283
• Weighted Metamorphosis for registration of images with different topologies
  
  • François Anton
  • Maillard Matthis
  • Oppenheim Catherine
  • Pallud Johan
  • Bloch Isabelle
  • Gori Pietro
  • Glaunès Joan
  , 2022, 13386, pp.8-17. We present an extension of the Metamorphosis algorithm to align images with different topologies and/or appearances. We propose to restrict/limit the metamorphic intensity additions using a timevarying spatial weight function. It can be used to model prior knowledge about the topological/appearance changes (e.g., tumour/oedema). We show that our method improves the disentanglement between anatomical (i.e., shape) and topological (i.e., appearance) changes, thus improving the registration interpretability and its clinical usefulness. As clinical application, we validated our method using MR brain tumour images from the BraTS 2021 dataset. We showed that our method can better align healthy brain templates to images with brain tumours than existing state-of-the-art methods. Our PyTorch code is freely available here: https://github.com/antonfrancois/Demeter metamorphosis. (10.1007/978-3-031-11203-4_2)
  DOI : 10.1007/978-3-031-11203-4_2
• Cryptographic primitives adapted to connected car requirements
  
  • Tehrani Etienne
  , 2022. Communications are one of the key functions in future vehicles and require protection. Cryptography is an obvious answer to secure communications, specifically we studied lightweight cryptography to fit the constrained resources of the environment. A second emerging problem, specific to embedded systems, is resilience to side-channel attacks.The main objectives of the thesis are to study the feasibility of implementing a wide variety of symmetric lightweight encryption algorithms and their protection. An optimal solution is to have an agile implementation, able to quickly execute different lightweight encryption algorithms, using few resources and guaranteeing protection against physical attacks. Our main architecture starts from a modification of the instruction set of a RISC-V processor to satisfy the agility property of lightweight cryptography algorithms. We have studied many encryption algorithms and have proposed a first approach with a fully hardware architecture and a second approach with a dedicated processor in order to efficiently implement Lightweight Cryptography and their protection in a constrained embedded system
• Security Vulnerabilities Detection Through Assertion-Based Approach
  
  • Kissi Salim Yahia
  • Ameur-Boulifa Rabéa
  • Seladji Yassamine
  , 2022.
• Sharing resources for enhanced distributed hypothesis testing
  
  • Hamad Mustapha
  , 2022. Distributed hypothesis testing has many applications in security, health monitoring, automotive car control, or anomaly detection. With the help of distributed sensors, the decision centers (DCs) in such systems aim to distinguish between a normal situation (null hypothesis) and an alert situation (alternative hypothesis). Our focus will be on maximizing the exponential decay of the type-II error probabilities (corresponding to missed detections), with increasing numbers of observations, while keeping the type-I error probabilities (corresponding to false alarms) below given thresholds. In this thesis, we assume that different systems or applications share the limited network resources and impose expected-rate constraints on the system's communication links. We characterize the first information-theoretic fundamental limits under expected-rate constraints for multi-sensor multi-DC systems. Our characterization reveals a new tradeoff between the maximum type-II error exponents at the different DCs that stems from different margins to exploit under expected-rate constraints corresponding to the DCs' different type-I error thresholds. We propose a new multiplexing and rate-sharing strategy to achieve the error-exponents. Our strategy also generalizes to any setup with expected-rate constraints with promising gains compared to the results on the same setup under maximum-rate constraints. The converse proof method that we use to characterize the information-theoretic limits can also be used to derive new strong converse results under maximum-rate constraints. It is even applicable to other problems such as distributed compression or computation.
• FVTD simulation of the acoustics of the Phonocamptic Cave in Noyon
  
  • Duval Hugo
  • Thomas Antoine
  • Meacham Aidan
  • Badeau Roland
  • Valière Jean-Christophe
  • Polack Jean-Dominique
  , 2022. Starting from new measurements of the acoustical pots and room geometry in the phonocamptic cave at the Cathedral of Noyon, a numerical study was undertaken to understand the acoustical effects at the boundaries, and to provide an auralization of the space. An implementation of the finite volume time domain (FVTD) method was used to model the cave, including fitting the impedance presented by the acoustical pots on certain boundaries. The individual impedances of the pots were estimated from impulse responses collected pot-by-pot and parameterized in terms of a Helmholtz resonator model. Then, using the electroacoustic analogy, the sum effect of the pots was modeled as an equivalent spatial distribution in the FVTD boundary conditions. Additionally, the space was discretized with an unstructured mesh in order to capture the complex geometry, minimize dispersion error, and to check the accuracy of the FVTD implementation.
• Personal HSM, Privacy for Subscribers in 5G/6G Networks
  
  • Urien Pascal
  , 2022, pp.1-6. This paper presents the concept of personal HSM for 5G/6G networks. In cloud infrastructures, Hardware Secure Modules provide cryptographic services, typically for bank or WEB companies. We introduce the idea of deploying USIM like devices in Edge or Core datacenters, in order to support on-demand applications. We define two planes first for application providers, using legacy ISO7816 standards, and second for subscribers based on TLS1.3 secure channel. We present an experimental platform that could be integrated in emerging embedded secure element (eSE). We detail secure element communication stacks and attestation procedure that transfers exclusive ownership of secure element from application provider to subscriber (10.1109/6GNet54646.2022.9830453)
  DOI : 10.1109/6GNet54646.2022.9830453
• Adapting the EST method to ancient theatres: a proposal
  
  • Polack Jean-Dominique
  • Meacham Aidan
  • Badeau Roland
  • Valière Jean-Christophe
  , 2022. The paper investigates under which assumptions the EST method, initially developed for modelling the propagation of acoustical energy in flat spaces such as hallways and open space offices, can be adapted to unbounded spaces such as ancient theatres. It turns out that it mainly requires that the air column above any position in the open theatre contains finite acoustical energy, whatever its height. This is indeed the case since at high altitudes above the theatre, energy decreases with the square of the height due to the increasingly accurate assimilation of the theatre to a point source. In other words, one must use high enough elements, so that the intensity on the top of the elements can be considered as negligible, leading to negligible absorption and scattering on the top boundary. Therefore, one only needs considering absorption and scattering at the bottom boundary of the elements; and the integration on the elements must be revisited to account for the decrease of intensity with altitude. The corresponding bi-dimensional equations will be presented and solved for a variety of absorption and scattering coefficients on the surface of the theatre, and compared to measurements in an actual theatre.
• Joint Power and Subcarrier Allocation in Multi-Cell Multi-Carrier NOMA
  
  • Banerjee Subhankar
  • Chen Chung Shue
  • Coupechoux Marceau
  • Sinha Abhishek
  , 2022. Non-orthogonal multiple access (NOMA) is a technology proposed for next generation cellular networks because of its high spectral efficiency and enhanced user connectivity. However, in the literature the optimal joint power and sub-carrier allocation for NOMA has been proposed for single cell only. Consequently, a global optimal algorithm for the joint power and sub-carrier allocation for NOMA system in multi-cell scenario is still an open problem. In this work, we propose a polyblock optimization based algorithm for obtaining a global optimal solution. It has reduced complexity due to a necessary and sufficient condition for feasible successive interference cancellation (SIC). Besides, we can adjust its optimization approximation parameter to serve as benchmark solution or to provide suitable solution for multi-cell multi-carrier NOMA systems. Numerical studies have shown its effectiveness.
• Génération et manipulation de photons jumeaux dans des guides en niobate de lithium en couche mince
  
  • Henry Antoine
  • Zaquine Isabelle
  • Mitchell Arnan
  • Boes Andreas
  • Belabas Nadia
  • Bencheikh K.
  , 2022.
• How to measure usable security: Natural strategies in voting protocols1
  
  • Jamroga Wojciech
  • Kurpiewski Damian
  • Malvone Vadim
  Journal of Computer Security, IOS Press, 2022, 30 (3), pp.381-409. Formal analysis of security is often focused on the technological side of the system. One implicitly assumes that the users will behave in the right way to preserve the relevant security properties. In real life, this cannot be taken for granted. In particular, security mechanisms that are difficult and costly to use are often ignored by the users, and do not really defend the system against possible attacks. Here, we propose a graded notion of security based on the complexity of the user’s strategic behavior. More precisely, we suggest that the level to which a security property φ is satisfied can be defined in terms of: (a) the complexity of the strategy that the user needs to execute to make φ true, and (b) the resources that the user must employ on the way. The simpler and cheaper to obtain φ, the higher the degree of security. We demonstrate how the idea works in a case study based on an electronic voting scenario. To this end, we model the vVote implementation of the Prêt à Voter voting protocol for coercion-resistant and voter-verifiable elections. Then, we identify “natural” strategies for the voter to obtain voter-verifiability, and measure the voter’s effort that they require. We also consider the dual view of graded security, measured by the complexity of the attacker’s strategy to compromise the relevant properties of the election. (10.3233/JCS-210049)
  DOI : 10.3233/JCS-210049
• TOMOGRAPHIE QUANTIQUE ET PROTOCOLE DE DISTRIBUTION RECONFIGURABLE MULTI-UTILISATEURS À BASE DE PORTES QUANTIQUES FR ÉQUENTIELLES
  
  • Henry Antoine
  • Fioretto Dario
  • Procopio Lorenzo
  • Monfray Stéphane
  • Boeuf Frédéric
  • Vivien Laurent
  • Cassan Eric
  • Ramos Carlos
  • Bencheikh Kamel
  • Zaquine Isabelle
  • Belabas Nadia
  , 2022.
• Multi-core Erbium/Ytterbium doped fiber amplifier with extended bandwidth for submarine applications
  
  • Lebreton Aurelien
  • Jaouen Yves
  • Antona Jean-Christophe
  • Chao Lu
  , 2022, pp.1-3. (10.23919/OECC/PSC53152.2022.9850178)
  DOI : 10.23919/OECC/PSC53152.2022.9850178
• Receiver-Based Localization and Estimation of Polarization Dependent Loss
  
  • May Alix
  • Awwad Elie
  • Ramantanis Petros
  • Ciblat Philippe
  , 2022. (10.23919/OECC/PSC53152.2022.9849907)
  DOI : 10.23919/OECC/PSC53152.2022.9849907
• Rate-Distortion Theoretic Generalization Bounds for Stochastic Learning Algorithms
  
  • Sefidgaran Milad
  • Gohari Amin
  • Richard Gael
  • Şimşekli Umut
  , 2022, 178. Understanding generalization in modern machine learning settings has been one of the major challenges in statistical learning theory. In this context, recent years have witnessed the development of various generalization bounds suggesting different complexity notions such as the mutual information between the data sample and the algorithm output, compressibility of the hypothesis space, and the fractal dimension of the hypothesis space. While these bounds have illuminated the problem at hand from different angles, their suggested complexity notions might appear seemingly unrelated, thereby restricting their high-level impact. In this study, we prove novel generalization bounds through the lens of rate-distortion theory, and explicitly relate the concepts of mutual information, compressibility, and fractal dimensions in a single mathematical framework. Our approach consists of (i) defining a generalized notion of compressibility by using source coding concepts, and (ii) showing that the 'compression error rate' can be linked to the generalization error both in expectation and with high probability. We show that in the 'lossless compression' setting, we recover and improve existing mutual information-based bounds, whereas a 'lossy compression' scheme allows us to link generalization to the rate-distortion dimension-a particular notion of fractal dimension. Our results bring a more unified perspective on generalization and open up several future research directions.
• Implementing the cumulative difference plot in the IOHanalyzer
  
  • Arza Etor
  • Ceberio Josu
  • Irurozki Ekhiñe
  • Pérez Aritz
  , 2022, pp.11-12. The IOHanalyzer is a web-based framework that enables an easy visualization and comparison of the quality of stochastic optimization algorithms. IOHanalyzer offers several graphical and statistical tools analyze the results of such algorithms. In this work, we implement the cumulative difference plot in the IOHanalyzer. The cumulative difference plot [1] is a graphical approach that compares two samples through the first-order stochastic dominance. It improves upon other graphical approaches with the ability to distinguish between a small magnitude of difference and high uncertainty (10.1145/3520304.3534050)
  DOI : 10.1145/3520304.3534050
• A cross‐layered scheme for multichannel and reactive routing in vehicular ad hoc networks
  
  • Chbib Fadlallah
  • Khoukhi Lyes
  • Fahs Walid
  • Haydar Jamal
  • Khatoun Rida
  Transactions on emerging telecommunications technologies, Wiley-Blackwell, 2022, 33 (7). (10.1002/ett.4468)
  DOI : 10.1002/ett.4468
• Survey on recent trends towards generalized differential and boomerang uniformities
  
  • Liu Qi
  • Ding Cunsheng
  • Mesnager Sihem
  • Tang Chunming
  • Tonchev Vladimir
  Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences, Springer, 2022, 14 (4), pp.691-735. (10.1109/TIT.2021.3139687)
  DOI : 10.1109/TIT.2021.3139687
• Cross-PUF Attacks: Targeting FPGA Implementation of Arbiter-PUFs
  
  • Kroeger Trevor
  • Cheng Wei
  • Danger Jean-Luc
  • Guilley Sylvain
  • Karimi Naghmeh
  Journal of Electronic Testing: : Theory and Applications, Springer Verlag, 2022, 38 (3), pp.261-277. The hardware primitives known as Physically Unclonable Functions (PUFs) generate unique signatures based on uncontrollable variations which occur during the manufacturing process of silicon chips. These signatures are in turn used for securing Integrated Circuits either as a secret key for cryptographic modules, or as a medium for authenticating devices. Naturally being a security primitive, PUFs are the target for attacks as such it is important to mitigate such vulnerabilities. This paper in particular investigates PUFs’ vulnerability to power-based modeling attacks. Here, we expand upon our previous simulation based Cross-PUF attacks by targeting PUFs realized in real-silicon; namely, we consider PUFs deployed in Field-Programmable Gate Array (FPGA) fabrics. In Cross-PUF attacks, a model of a reference PUF is used to attack another PUF realized from the same HSPICE simulated design or the same bitstream in FPGA. We also investigate the impact of such attacks on multi-bit parallel PUFs. The HSPICE simulation results are compared vis-a-vis with the FPGA implementation outcome of these attacks confirming the effectiveness of such simulations. Finally we show that a combination of Dual Rail logic and Random Initialization logic, named DRILL, can be effectively used to thwart such power-based modeling attacks (10.1007/s10836-022-06012-z)
  DOI : 10.1007/s10836-022-06012-z