- Book Chapter
- 10.1007/978-3-032-10536-3_26
Picking up the Fallen Mask: Breaking and Fixing the RS-Mask Countermeasure
- Jan 01, 2026
- Dilara Toprakhisar + 2 more +2
Publications from 2021 to 2026
Showing 10 of 46 papers
Picking up the Fallen Mask: Breaking and Fixing the RS-Mask Countermeasure
432P: Real-world biomarker testing and treatment patterns in Belgian lung cancer patients: Insights from the AIBED study
Contactless Cards
HaWANet: Road Scene Understanding with Multi-modal Sensor Data Using Height-Width-Driven Attention Network
Vicinity Card
Enabling FrodoKEM on Embedded Devices
FrodoKEM is a lattice-based Key Encapsulation Mechanism (KEM) based on unstructured lattices. From a security point of view this makes it a conservative option to achieve post-quantum security, hence why it is favored by several European authorities (e.g., German BSI and French ANSSI). Relying on unstructured instead of structured lattices (e.g., CRYSTALS-Kyber) comes at the cost of additional memory usage, which is particularly critical for embedded security applications such as smart cards. For example, prior FrodoKEM-640 implementations (using AES) on Cortex-M4 require more than 80 kB of stack making it impossible to run on some embedded systems. In this work, we explore several stack reduction strategies and the resulting time versus memory trade-offs. Concretely, we reduce the stack consumption of FrodoKEM by a factor 2–3x compared to the smallest known implementations with almost no impact on performance. We also present various time-memory trade-offs going as low as 8 kB for all AES parameter sets, and below 4 kB for FrodoKEM-640. By introducing a minor tweak to the FrodoKEM specifications, we additionally reduce the stack consumption down to 8 kB for all the SHAKE versions. As a result, this work enables FrodoKEM on more resource constrained embedded systems.
Read moreValidation of an Artificial Intelligence driven framework to automatically detect red flag symptoms in screening for rare diseases in electronic health records: hereditary transthyretin amyloidosis polyneuropathy as a key example.
Rare life-threatening conditions, such as multisystemic hereditary transthyretin amyloidosis (ATTRv) polyneuropathy, are often underdiagnosed or diagnosed late in the disease course, although early diagnosis is crucial for treatment success. Red flag symptoms have been identified, but manual screening of multidisciplinary medical records on this set of symptoms is time-consuming. This study aimed to validate a Natural Language Processing (NLP) algorithm to perform such a search in an automated manner, in order to improve early diagnosis and treatment. A novel state-of-the-art NLP procedure was applied to extract red flag symptoms from patients' electronic medical records and to select patients at risk for ATTRv polyneuropathy for further clinical review. Accuracy of the algorithm was assessed through comparison with a manual standard on a random sample of 300 patients. Out of a retrospective sample of 1015 patients, the NLP algorithm yielded 128 patients with three or more red flag symptoms of which 69 patients were considered eligible for genetic testing after clinical review. High accuracy was found in the detection of red flag symptoms, with F1 scores between 0.88 and 0.98. A relative increase of 48.6% in genetic testing, to identify patients with a rare disease earlier, was demonstrated. An NLP algorithm, after clinical validation, offers a valid and accurate tool to detect red flag symptoms in medical records across multiple disciplines, supporting better screening for patients with rare diseases. This opens the door to further NLP applications, facilitating rapid diagnosis and early treatment of rare diseases.
Read moreEfficient privacy-preserving aggregation for demand side management of residential loads
Efficient Modular Arithmetic
In Chapter 8, Efficient Modular Arithmetic, Joppe W. Bos, Thorsten Kleinjung and Dan Page discuss how to realise efficient modular arithmetic in practice on a range of platforms. They cover generic modular multiplication routines such as the popular Montgomery multiplication as well as special routines for primes of a specific shape. Moreover, especially fast methods are outlined that might produce errors with a very small probability. Such faster 'sloppy reduction' techniques are especially beneficial in cryptanalytic settings. Bos, Kleinjung and Page have all been involved in various cryptographic and cryptanalytic record-setting software implementations. In Chapter 8 they explain how to select the most efficient modular arithmetic routines for the cryptologic implementation task at hand.
Read moreA privacy-friendly aggregation algorithm for demand side management of residential loads
One of the main challenges of residential demand-side management (DSM) is achieving enough aggregated flexibility to participate in the different energy markets. Aggregators enable such operation by managing a large portfolio of individual customers. However, this also involves a continuous flow of information from the individual users to the Aggregator. Due to the sensitive nature of energy data, from which behaviour and usage patterns can be inferred easily, not every customer is willing to share this information. What is more, considering the current efforts to protect personal data, the limitation of data collection and exposure should be a priority of any modern system. To achieve such functionality, this work presents a novel privacy-friendly aggregation algorithm that combines market-based control (MBC), public-key cryptography and secret sharing, with the goal to provide the same energy aggregation services but without revealing the individual user profiles.
Read more