Quentin L. Meunier
Research Subjects
Quentin L. Meunier has a total of 56 co-authors. Here are the top co-authors by number of shared publications:
- Karine Heydemann
Sorbonne University, CNRS, LIP6, Paris, France
5 shared publications Alain Greiner
LIP6 Lab, University Paris Sorbonne, 75252 Paris, France
2 shared publicationsChristian Gerin
ID Gabon Libreville Gabon
2 shared publicationsInès Ben El Ouahma
Sorbonne Universite
2 shared publicationsLoic Espinasse
Archéovision, UMS 3657, Université Bordeaux Montaigne Pessac France
2 shared publications- Sacha Kacki
PACEA, UMR 5199, CNRS, Université de Bordeaux, Ministère de la Culture Pessac France
2 shared publications
Latest Publications
- Open Access
- 29 July 2024
- Published by Wiley in American Journal of Biological Anthropology
- Vol. 185 (2) , e24997
Population affinities in pre‐colonial West Africa: The case of the burial cave Iroungou (Gabon, 14th–15th century CE)
Introduction: Our knowledge of the populations of sub‐Saharan Africa in the periods before European colonization is limited. Few archeological sites containing human remains have been identified, and written sources for these periods are rare. The discovery in 2018 of the Iroungou sepulchral cave (Gabon), whose use predates the arrival of the Portuguese (14th–15th centuries CE), is an exceptional source of information: at least 28 individuals associated with numerous metal artifacts were found there. The anthropobiological remains were left in situ, but the eight best preserved crania were digitized.Objectives: This study focuses on the population affinities of these crania, whose morphology was described using 237 landmarks.Materials and Methods: Geometric morphometric analyses were used to compare the eight Iroungou specimens with 154 individuals representing 12 well‐defined African populations. After alignment (Generalized Procrustes Analysis), morphological affinity was assessed using Euclidean and Mahalanobis distances, and posterior probabilities of population membership (discriminant analysis).Results: Results indicate that the eight Iroungou crania have, on average, more affinity with Bayaka Pygmy, followed by Central African Bantu. Nevertheless, individually, the Iroungou specimens show an important morphological variation and the eight crania can be separated into different affinity groups: Bayaka and Central African Bantu, KhoeSan, and East‐African Bantu. Finally, one individual presents strong affinity with Somalis.Conclusion: This phenetic mapping of the Iroungou sample raises questions about the profile of the individuals deposited in the cave in a geographical area known for the Loango pre‐colonial kingdom, which ruling class seemed to have had privileged relationships with the Pygmy populations.
- 29 July 2024
- Published by Wiley in American Journal of Biological Anthropology
- Vol. 185 (2) , e24997
Open AccessPopulation affinities in pre‐colonial West Africa: The case of the burial cave Iroungou (Gabon, 14th–15th century CE)
Introduction: Our knowledge of the populations of sub‐Saharan Africa in the periods before European colonization is limited. Few archeological sites containing human remains have been identified, and written sources for these periods are rare. The discovery in 2018 of the Iroungou sepulchral cave (Gabon), whose use predates the arrival of the Portuguese (14th–15th centuries CE), is an exceptional source of information: at least 28 individuals associated with numerous metal artifacts were found there. The anthropobiological remains were left in situ, but the eight best preserved crania were digitized.Objectives: This study focuses on the population affinities of these crania, whose morphology was described using 237 landmarks.Materials and Methods: Geometric morphometric analyses were used to compare the eight Iroungou specimens with 154 individuals representing 12 well‐defined African populations. After alignment (Generalized Procrustes Analysis), morphological affinity was assessed using Euclidean and Mahalanobis distances, and posterior probabilities of population membership (discriminant analysis).Results: Results indicate that the eight Iroungou crania have, on average, more affinity with Bayaka Pygmy, followed by Central African Bantu. Nevertheless, individually, the Iroungou specimens show an important morphological variation and the eight crania can be separated into different affinity groups: Bayaka and Central African Bantu, KhoeSan, and East‐African Bantu. Finally, one individual presents strong affinity with Somalis.Conclusion: This phenetic mapping of the Iroungou sample raises questions about the profile of the individuals deposited in the cave in a geographical area known for the Loango pre‐colonial kingdom, which ruling class seemed to have had privileged relationships with the Pygmy populations.
- 6 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 49 (6) , 3359-3375
LeakageVerif: Efficient and Scalable Formal Verification of Leakage in Symbolic Expressions
Side-channel attacks are a powerful class of attacks targeting cryptographic devices. Masking is a popular protection technique to thwart such attacks as it can be theoretically proven secure. However, correctly implementing masking schemes is a non-trivial task and error-prone. If several techniques have been proposed to formally verify masked implementations, they all come with limitations regarding expressiveness, scalability or accuracy. In this work, we propose a symbolic approach, based on a variant of the classical substitution method, for formally verifying arithmetic and boolean masked programs. This approach is more accurate and scalable than existing approaches thanks to a careful design and implementation of key heuristics, algorithms and data structures involved in the verification process. We present all the details of this approach and the open-source tool called LeakageVerif which implements it as a python library, and which offers constructions for symbolic expressions and functions for their verification. We compare LeakageVerif to three existing state-of-the-art tools on a set of 46 masked programs, and we show that it has very good scalability and accuracy results while providing all the necessary constructs for describing algorithmic to assembly masking schemes. Finally, we also provide the set of 46 benchmarks, named MaskedVerifBenchs and written for comparing the different verification tools, in the hope that they will be useful to the community for future comparisons.
- 6 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 49 (6) , 3359-3375
LeakageVerif: Efficient and Scalable Formal Verification of Leakage in Symbolic Expressions
Side-channel attacks are a powerful class of attacks targeting cryptographic devices. Masking is a popular protection technique to thwart such attacks as it can be theoretically proven secure. However, correctly implementing masking schemes is a non-trivial task and error-prone. If several techniques have been proposed to formally verify masked implementations, they all come with limitations regarding expressiveness, scalability or accuracy. In this work, we propose a symbolic approach, based on a variant of the classical substitution method, for formally verifying arithmetic and boolean masked programs. This approach is more accurate and scalable than existing approaches thanks to a careful design and implementation of key heuristics, algorithms and data structures involved in the verification process. We present all the details of this approach and the open-source tool called LeakageVerif which implements it as a python library, and which offers constructions for symbolic expressions and functions for their verification. We compare LeakageVerif to three existing state-of-the-art tools on a set of 46 masked programs, and we show that it has very good scalability and accuracy results while providing all the necessary constructs for describing algorithmic to assembly masking schemes. Finally, we also provide the set of 46 benchmarks, named MaskedVerifBenchs and written for comparing the different verification tools, in the hope that they will be useful to the community for future comparisons.
- 9 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 41 (11) , 3733-3744
ARMISTICE: Microarchitectural Leakage Modeling for Masked Software Formal Verification
Side-channel attacks are powerful attacks for retrieving secret data by exploiting physical measurements, such as power consumption or electromagnetic emissions. Masking is a popular countermeasure as it can be proven secure against an attacker model. In practice, software-masked implementations suffer from a security reduction due to a mismatch between the considered leakage sources in the security proof and the real ones, which depend on the microarchitecture. We propose ARMISTICE, a framework for formally verifying the absence of leakage in first-order masked implementations taking into account modeled microarchitectural sources of leakage. As a proof of concept, we present the modeling of an Arm Cortex-M3 core from its RTL description and leakage test vectors, as well as the modeling of the memory of an STM32F1 board, exclusively using leakage test vectors. We show that, with these models, ARMISTICE pinpoints vulnerable instructions in real-world masked implementations and helps the design of masked software implementations which are practically secure.
- 9 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 41 (11) , 3733-3744
ARMISTICE: Microarchitectural Leakage Modeling for Masked Software Formal Verification
Side-channel attacks are powerful attacks for retrieving secret data by exploiting physical measurements, such as power consumption or electromagnetic emissions. Masking is a popular countermeasure as it can be proven secure against an attacker model. In practice, software-masked implementations suffer from a security reduction due to a mismatch between the considered leakage sources in the security proof and the real ones, which depend on the microarchitecture. We propose ARMISTICE, a framework for formally verifying the absence of leakage in first-order masked implementations taking into account modeled microarchitectural sources of leakage. As a proof of concept, we present the modeling of an Arm Cortex-M3 core from its RTL description and leakage test vectors, as well as the modeling of the memory of an STM32F1 board, exclusively using leakage test vectors. We show that, with these models, ARMISTICE pinpoints vulnerable instructions in real-world masked implementations and helps the design of masked software implementations which are practically secure.
- Open Access
- 1 January 2021
- Published by OpenEdition in Bulletins Et Mémoires de La Société D'anthropologie de Paris
- Vol. 33 ((S))
Nouvelles données sur les comportements mortuaires en Afrique Centrale à l’âge du Fer : la grotte sépulcrale d’Iroungou, Gabon (XIVe-XVe siècles EC)
- 1 January 2021
- Published by OpenEdition in Bulletins Et Mémoires de La Société D'anthropologie de Paris
- Vol. 33 ((S))
Open AccessNouvelles données sur les comportements mortuaires en Afrique Centrale à l’âge du Fer : la grotte sépulcrale d’Iroungou, Gabon (XIVe-XVe siècles EC)
- Top Cited Papers
- 10 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Solid-State Circuits
- Vol. 56 (1) , 79-97
IntAct: A 96-Core Processor With Six Chiplets 3D-Stacked on an Active Interposer With Distributed Interconnects and Integrated Power Management
In the context of high-performance computing, the integration of more computing capabilities with generic cores or dedicated accelerators for artificial intelligence (AI) application is raising more and more challenges. Due to the increasing costs of advanced nodes and the difficulties of shrinking analog and circuit input output signals (IOs), alternative architecture solutions to single die are becoming mainstream. Chiplet-based systems using 3D technologies enable modular and scalable architecture and technology partitioning. Nevertheless, there are still limitations due to chiplet integration on passive interposers--silicon or organic. In this article we present the first CMOS active interposer, integrating: 1) power management without any external components; 2) distributed interconnects enabling any chiplet-to-chiplet communication; and3) system infrastructure, design-for-test, and circuit IOs. The IntAct circuit prototype integrates six chiplets in FDSOI 28-nm technology, which are 3D-stacked onto this active interposer in 65-nm process, offering a total of 96 computing cores. Full scalability of the computing system is achieved using an innovative scalable cache-coherent memory hierarchy, enabled by distributed network-on-chips, with 3-Tbit/s/mm² high bandwidth 3D-plug interfaces using 20-μm pitch micro-bumps, 0.6-ns/mm low latency asynchronous interconnects, while the six chiplets are locally power-supplied with 156-mW/mm2 at 82%-peak-efficiency dc-dc converters through the active interposer. Thermal dissipation is studied showing the feasibility of such approach.
- 10 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Solid-State Circuits
- Vol. 56 (1) , 79-97
Top Cited PapersIntAct: A 96-Core Processor With Six Chiplets 3D-Stacked on an Active Interposer With Distributed Interconnects and Integrated Power Management
In the context of high-performance computing, the integration of more computing capabilities with generic cores or dedicated accelerators for artificial intelligence (AI) application is raising more and more challenges. Due to the increasing costs of advanced nodes and the difficulties of shrinking analog and circuit input output signals (IOs), alternative architecture solutions to single die are becoming mainstream. Chiplet-based systems using 3D technologies enable modular and scalable architecture and technology partitioning. Nevertheless, there are still limitations due to chiplet integration on passive interposers--silicon or organic. In this article we present the first CMOS active interposer, integrating: 1) power management without any external components; 2) distributed interconnects enabling any chiplet-to-chiplet communication; and3) system infrastructure, design-for-test, and circuit IOs. The IntAct circuit prototype integrates six chiplets in FDSOI 28-nm technology, which are 3D-stacked onto this active interposer in 65-nm process, offering a total of 96 computing cores. Full scalability of the computing system is achieved using an innovative scalable cache-coherent memory hierarchy, enabled by distributed network-on-chips, with 3-Tbit/s/mm² high bandwidth 3D-plug interfaces using 20-μm pitch micro-bumps, 0.6-ns/mm low latency asynchronous interconnects, while the six chiplets are locally power-supplied with 156-mW/mm2 at 82%-peak-efficiency dc-dc converters through the active interposer. Thermal dissipation is studied showing the feasibility of such approach.
- 30 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 39 (11) , 3774-3786
Maskara: Compilation of a Masking Countermeasure With Optimized Polynomial Interpolation
Side-channel attacks are amongst the major threats for embedded systems and IoT devices. Masking is one of the most used countermeasure against such attacks, but its application remains a difficult process. We propose a target-independent approach for applying a first-order boolean masking countermeasure during compilation, on the static single assignment form. Contrary to state-of-the art automated approaches that require to simplify the control flow of the input program, our approach supports regular control-flow program structures. Moreover, our compiler is the first to automatically mask table lookups using a polynomial interpolation approach. We also present new optimisations to speed up the evaluation of polynomials: we reduce the number of terms of the polynomial, and we accelerate finite field multiplication. We show that our approach is faster than the standard masked table approach with mask refresh after each access, with speedups up to ×2.4 in our experiments. Finally, using a formal verification approach, we show that the compiled machine code is secure, i.e., that all intermediate computations are statistically independent of the secrets.
- 30 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 39 (11) , 3774-3786
Maskara: Compilation of a Masking Countermeasure With Optimized Polynomial Interpolation
Side-channel attacks are amongst the major threats for embedded systems and IoT devices. Masking is one of the most used countermeasure against such attacks, but its application remains a difficult process. We propose a target-independent approach for applying a first-order boolean masking countermeasure during compilation, on the static single assignment form. Contrary to state-of-the art automated approaches that require to simplify the control flow of the input program, our approach supports regular control-flow program structures. Moreover, our compiler is the first to automatically mask table lookups using a polynomial interpolation approach. We also present new optimisations to speed up the evaluation of polynomials: we reduce the number of terms of the polynomial, and we accelerate finite field multiplication. We show that our approach is faster than the standard masked table approach with mask refresh after each access, with speedups up to ×2.4 in our experiments. Finally, using a formal verification approach, we show that the compiled machine code is secure, i.e., that all intermediate computations are statistically independent of the secrets.
- 16 March 2019
- Published by Springer Nature in Journal of Cryptographic Engineering
- Vol. 9 (3) , 231-242
Side-channel robustness analysis of masked assembly codes using a symbolic approach
- 16 March 2019
- Published by Springer Nature in Journal of Cryptographic Engineering
- Vol. 9 (3) , 231-242
Side-channel robustness analysis of masked assembly codes using a symbolic approach
- Open Access
- 23 January 2018
- Published by EasyChair in EPiC Series in Computing
- Vol. 49, 17
Symbolic Approach for Side-Channel Resistance Analysis of Masked Assembly Codes
Masking is a popular countermeasure against side-channel attacks, that randomizes secret data with random and uniform variables called masks. At software level, masking is usually added in the source code and its effectiveness needs to be verified. In this paper, we propose a symbolic method to verify side-channel robustness of masked programs. The analysis is performed at the assembly level since compilation and optimizations may alter the added protections. Our proposed method aims to verify that intermediate computations are statistically independent from secret variables using defined distribution inference rules. We verify the first round of a masked AES in 22s and show that some secure algorithms or source codes are not leakage-free in their assembly implementations.
- 23 January 2018
- Published by EasyChair in EPiC Series in Computing
- Vol. 49, 17
Open AccessSymbolic Approach for Side-Channel Resistance Analysis of Masked Assembly Codes
Masking is a popular countermeasure against side-channel attacks, that randomizes secret data with random and uniform variables called masks. At software level, masking is usually added in the source code and its effectiveness needs to be verified. In this paper, we propose a symbolic method to verify side-channel robustness of masked programs. The analysis is performed at the assembly level since compilation and optimizations may alter the added protections. Our proposed method aims to verify that intermediate computations are statistically independent from secret variables using defined distribution inference rules. We verify the first round of a masked AES in 22s and show that some secure algorithms or source codes are not leakage-free in their assembly implementations.
- 1 February 2017
- Published by Elsevier in Microprocessors and Microsystems
- Vol. 48, 21-35
Executing secured virtual machines within a manycore architecture
- 1 February 2017
- Published by Elsevier in Microprocessors and Microsystems
- Vol. 48, 21-35
Executing secured virtual machines within a manycore architecture
- Open Access
- 1 July 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21593469,p. 434-439
RWT: Suppressing Write-Through Cost When Coherence is Not Needed
In shared-memory multicore architectures, handling a write cache operation is more complicated than in single processor systems. A cache line may be present in more than one private L1 cache. Any cache willing to write this line must inform all the other sharers. Therefore, it is necessary to implement a cache coherence protocol for multicore architectures. At present, directory based protocols are popular cache coherence protocols in both industry and academic domains because of their reduced coherence traffic compared to snooping protocols, at the expense of an indirection. The write policy - write through or write back - is crucial in the protocol design. The write-through policy reduces the bandwidth because it augments the write traffic in the interconnection network, and also augments the energy consumption. However, it can efficiently solve the false sharing problem via write updates. In this paper, we introduce a new way to reduce the write traffic of a write-through coherence protocol by combining write-through coherence with a write-back policy for non coherent lines. The baseline write-through used as reference is a scalable hybrid invalidate/update protocol. Simulation results show that with our enhanced protocol, we can reduce at least by 50% the write traffic in the interconnection network, and gain up to 20% performance compared with the baseline write-through protocol.
- 1 July 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21593469,p. 434-439
Open AccessRWT: Suppressing Write-Through Cost When Coherence is Not Needed
In shared-memory multicore architectures, handling a write cache operation is more complicated than in single processor systems. A cache line may be present in more than one private L1 cache. Any cache willing to write this line must inform all the other sharers. Therefore, it is necessary to implement a cache coherence protocol for multicore architectures. At present, directory based protocols are popular cache coherence protocols in both industry and academic domains because of their reduced coherence traffic compared to snooping protocols, at the expense of an indirection. The write policy - write through or write back - is crucial in the protocol design. The write-through policy reduces the bandwidth because it augments the write traffic in the interconnection network, and also augments the energy consumption. However, it can efficiently solve the false sharing problem via write updates. In this paper, we introduce a new way to reduce the write traffic of a write-through coherence protocol by combining write-through coherence with a write-back policy for non coherent lines. The baseline write-through used as reference is a scalable hybrid invalidate/update protocol. Simulation results show that with our enhanced protocol, we can reduce at least by 50% the write traffic in the interconnection network, and gain up to 20% performance compared with the baseline write-through protocol.