Christoph Dobraunig
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Christoph Dobraunig has a total of 64 co-authors. Here are the top co-authors by number of shared publications:
- Maria Eichlseder
Graz University of Technology
23 shared publications - Florian Mendel
Infineon Technologies AG
20 shared publications Florian Mendel
Infineon Technol AG, Neubiberg, Germany
10 shared publicationsStefan Mangard
Graz University of Technology
6 shared publications- Bart Mennink
Maastricht University
5 shared publications Bart Mennink
Radboud Univ Nijmegen, Toernooiveld 212, Nijmegen 6525 EC, Netherlands
4 shared publications
Latest Publications
- 10 May 2025
- Published by Springer Nature
- p. 1198-1200
Ineffective Fault Attack
- 10 May 2025
- Published by Springer Nature
- p. 2535-2537
Statistical Fault Attack
- 27 April 2025
- Published by Springer Nature
- p. 62-92
Efficient Instances of Docked Double Decker with AES, and Application to Authenticated Encryption
- 27 April 2025
- Published by Springer Nature
- p. 62-92
Efficient Instances of Docked Double Decker with AES, and Application to Authenticated Encryption
- Open Access
- 2 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 50-58
Cryptographic Memory Tagging: Towards Stateless Integrity
- 2 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 50-58
Open AccessCryptographic Memory Tagging: Towards Stateless Integrity
- 29 February 2024
- Published by Springer Nature
- p. 460-484
Generalized Initialization of the Duplex Construction
- 29 February 2024
- Published by Springer Nature
- p. 460-484
Generalized Initialization of the Duplex Construction
- Open Access
- 16 June 2023
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Symmetric Cryptology
- Vol. 2023 (2) , 69-93
EliMAC: Speeding Up LightMAC by around 20%
Universal hash functions play a prominent role in the design of message authentication codes and the like. Whereas it is known how to build highly efficient sequential universal hash functions, parallel non-algebraic universal hash function designs are always built on top of a PRP. In such case, one employs a relatively strong primitive to obtain a function with a relatively weak security model. In this work, we present EliHash, a construction of a parallel universal hash function from non-compressing universal hash functions, and we back it up with supporting security analysis. We use this construction to design EliMAC, a message authentication code similar to LightMAC. We consider a heuristic instantiation of EliMAC with roundreduced AES, and argue that this instantiation of EliMAC is much more efficient than LightMAC, it is around 21% faster, and additionally allows for precomputation of the keys, albeit with a stronger assumption on the AES primitive than in LightMAC. These observations are backed up with an implementation of our scheme.
- 16 June 2023
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Symmetric Cryptology
- Vol. 2023 (2) , 69-93
Open AccessEliMAC: Speeding Up LightMAC by around 20%
Universal hash functions play a prominent role in the design of message authentication codes and the like. Whereas it is known how to build highly efficient sequential universal hash functions, parallel non-algebraic universal hash function designs are always built on top of a PRP. In such case, one employs a relatively strong primitive to obtain a function with a relatively weak security model. In this work, we present EliHash, a construction of a parallel universal hash function from non-compressing universal hash functions, and we back it up with supporting security analysis. We use this construction to design EliMAC, a message authentication code similar to LightMAC. We consider a heuristic instantiation of EliMAC with roundreduced AES, and argue that this instantiation of EliMAC is much more efficient than LightMAC, it is around 21% faster, and additionally allows for precomputation of the keys, albeit with a stronger assumption on the AES primitive than in LightMAC. These observations are backed up with an implementation of our scheme.
- 13 November 2022
- Published by Springer Nature
- p. 1-3
Statistical Fault Attack
- 13 November 2022
- Published by Springer Nature
- p. 1-3
Ineffective Fault Attack
- 25 May 2022
- Published by Springer Nature
- p. 168-191
Information-Combining Differential Fault Attacks on DEFAULT
- 25 May 2022
- Published by Springer Nature
- p. 168-191
Information-Combining Differential Fault Attacks on DEFAULT