Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Helena Handschuh

dblp:28/6334 · DBLP profile ↗
← Back
18ranked-venue papers
10as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 17 · 10 first-authorSystems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
4 papers
Cryptographic primitives and cryptanalysis · 55% Hardware security and side channels · 45%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
message authentication codes
0.112008
Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms · CRYPTO 2008
Hardware security and side channels
tamper-resistant hardware
0.012001
Fast Primitives for Internal Data Scrambling in Tamper Resistant Hardware · CHES 2001
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography
0.011999
ECC: Do We Need to Count? · ASIACRYPT 1999
Hardware security and side channels
physical attacks
0.011999
Probing Attacks on Tamper-Resistant Devices · CHES 1999
Hardware security and side channels › physical attacks
probing attack
0.011999
Probing Attacks on Tamper-Resistant Devices · CHES 1999
Hardware security and side channels
tamper-resistant device
0.011999
Probing Attacks on Tamper-Resistant Devices · CHES 1999

Methods — techniques the papers use, named apart from their topics

data scrambling · 0.0physical attack · 0.0
YearPublicationVenuePosition
2021 Security, Reliability and Test Aspects of the RISC-V Ecosystem
abstract
RISC-V has emerged as a viable solution on academia and industry. However, to use open source hardware for safety-critical applications, we need a deep understanding of the way in which well established mechanisms for testing and reliability could be integrated and deployed on the RISC-V ecosystem, and we need a clear knowledge on how such an ecosystem can be leveraged to improve security. This paper includes four contributions presenting the potential of RISC-V in security research, the way in which RISC-V can be hardened against power analysis attacks, how to implement, using RISC-V, software and hardware/software solutions for dual core lock step, and how to perform system-level testing in the RISC-V ecosystem.
Jaume Abella 0001, Sergi Alcaide, Jens Anders, Francisco Bas, Steffen Becker 0001, Elke De Mulder, Nourhan Elhamawy, Frank K. Gürkaynak, Helena Handschuh, Carles Hernández 0001, Michael Hutter, Leonidas Kosmidis, Ilia Polian, Matthias Sauer 0002, Stefan Wagner 0001, Francesco Regazzoni 0001
ETS9
2009 Blinded Fault Resistant Exponentiation Revisited
abstract
Cryptographic algorithm implementations are subject to specific attacks, called side channel attacks, focusing on the analysis of their power consumption or execution time or on the analysis of faulty computations. At FDTC06, Fumaroli and Vigilant presented a generic method to compute an exponentiation resistant against different side channel attacks. However, even if this algorithm does not reveal information on the secrets in case of a fault attack, it can not be used to safely implement a crypto-system involving an exponentiation. In this paper, we propose a new exponentiation method without this drawback and give a security proof of resistance to fault attacks. As an application, we propose an RSA algorithm implemented using the Chinese Remainder Theorem protected against side channel attacks. The exponentiation algorithm is also 33% faster than the previous method.
Arnaud Boscher, Helena Handschuh, Elena Trichina
FDTC2
2008 Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
Helena Handschuh, Bart Preneel
CRYPTO1
2008 Masking Does Not Protect Against Differential Fault Attacks
abstract
Over the past ten years, cryptographic algorithms have been found to be vulnerable against side-channel attacks such as power analysis attacks, timing attacks, electromagnetic radiation attacks and fault attacks. These attacks capture leaking information from an implementation of the algorithm in software or in hardware and apply cryptanalytical and statistical tools to recover the secret keys. A very well-known countermeasure against these attacks is to randomize every execution of the algorithm and every intermediate piece of data with a so-called masking method. In this paper we demonstrate that traditional countermeasures such as masking methodsfor symmetric cryptosystems are completely inefficient against fault attacks. In other words, differential fault attacks still apply on masked data. As an example we show how to recover secret keys from two masked AES implementations using a basic differential fault attack.
Arnaud Boscher, Helena Handschuh
FDTC2
2007 Securing Flash Technology
abstract
Flash memory is a type of non-volatile semiconductor memory that can be electrically erased and programmed. It can be found in almost every high-capacity consumer electronic device in the market. Examples of such mass memory products include USB flash drives, digital cameras, mobile handsets, set-top boxes for Pay-TV applications, and many more. Some of them use NAND flash technology and others use NOR flash technology. To put it simply, NAND flash is the most adequate for mass-storage of user data because of its high speed access and because the organization of user data is usually error-tolerant (digital pictures, music) and NOR flash is more adequate for code-type data because of its highly reliable nature and its XIP (execute in place) capability, meaning that a program stored in NOR flash does not need to be transferred to RAM before being executed. When it comes to set-top boxes or handsets, manufacturers and operators are becoming increasingly security concerned. Conditional Access providers do not want to see their operating system and security codes dispatched over the internet and mobile phone operators fear that viruses or Trojan horses will eventually reach the handset platform. Thus new security features start appearing on those types of flash memory devices. Another sector which needs increasing data and program storage capacity is the smart card industry. Current high-end cards have a few hundred kilobytes of embedded ROM and EEPROM memory to hold their operating system and application data when several megabytes would ideally be required. The new high density smart cards will address such requirements in the near future by providing increased on-board storage capacity. The question then becomes how to reach the required security level operators expect for all these new devices.
Helena Handschuh, Elena Trichina
FDTC1
2004 On Related-Key and Collision Attacks: The Case for the IBM 4758 Cryptoprocessor
Raphael C.-W. Phan, Helena Handschuh
ISC2
2002 Provably Secure Chipcard Personalization, or, How to Fool Malicious Insiders
Helena Handschuh, David Naccache, Pascal Paillier, Christophe Tymen
CARDIS1
2002 GEM: A Generic Chosen-Ciphertext Secure Encryption Method
Jean-Sébastien Coron, Helena Handschuh, Marc Joye, Pascal Paillier, David Pointcheval, Christophe Tymen
CT-RSA2
2001 Fast Primitives for Internal Data Scrambling in Tamper Resistant Hardware
Eric Brier, Helena Handschuh, Christophe Tymen
CHES2
2001 Analysis of SHA-1 in Encryption Mode
Helena Handschuh, Lars R. Knudsen, Matthew J. B. Robshaw
CT-RSA1
2000 A Statistical Attack on RC6
Henri Gilbert, Helena Handschuh, Antoine Joux, Serge Vaudenay
FSE2
1999 ECC: Do We Need to Count?
Jean-Sébastien Coron, Helena Handschuh, David Naccache
ASIACRYPT2
1999 Probing Attacks on Tamper-Resistant Devices
Helena Handschuh, Pascal Paillier, Jacques Stern
CHES1
1999 On the Security of Double and 2-Key Triple Modes of Operation
Helena Handschuh, Bart Preneel
FSE1
1998 Reducing the Collision Probability of Alleged Comp128
Helena Handschuh, Pascal Paillier
CARDIS1
1998 Smart Card Crypto-Coprocessors for Public-Key Cryptography
Helena Handschuh, Pascal Paillier
CARDIS1
1998 A Timing Attack on RC5
Helena Handschuh, Howard M. Heys
Selected Areas in Cryptography1
1997 x2 Cryptanalysis of the SEAL Encryption Algorithm
Helena Handschuh, Henri Gilbert
FSE1