Serge Vaudenay
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Serge Vaudenay has a total of 48 co-authors. Here are the top co-authors by number of shared publications:
- Loïs Huguenin-Dumittan
EPFL
4 shared publications - Bénédikt Tran
LASEC, École Polytechnique Fédérale de Lausanne
3 shared publications - Aikaterini Mitrokotsa
University of St. Gallen, St. Gallen, Switzerland
2 shared publications F. Betül Durak
Robert Bosch LLC - Research and Technology Center
2 shared publications- Florian Tramèr
EPFL, Lausanne, Switzerland
2 shared publications - Ioana Boureanu
Akamai Technology Limited, London, UK.
2 shared publications
Latest Publications
- 23 October 2026
- Published by Springer Nature
- p. 541-556
VeinoCert: Binding an Object to an Owner
- 15 October 2025
- Published by Springer Nature
- p. 235-260
Hybrid Homomorphic Encryption Resistance to Side-Channel Attacks
- 15 October 2025
- Published by Springer Nature
- p. 235-260
Hybrid Homomorphic Encryption Resistance to Side-Channel Attacks
- 13 March 2025
- Published by Springer Nature
- p. 151-177
SILBE: An Updatable Public Key Encryption Scheme from Lollipop Attacks
- 13 March 2025
- Published by Springer Nature
- p. 151-177
SILBE: An Updatable Public Key Encryption Scheme from Lollipop Attacks
- Open Access
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 2460-2474
Non-Transferable Anonymous Tokens by Secret Binding
Non-transferability (NT) is a security notion which ensures that credentials are only used by their intended owners. Despite its importance, it has not been formally treated in the context of anonymous tokens (AT) which are lightweight anonymous credentials. In this work, we consider a client who "buys" access tokens which are forbidden to be transferred although anonymously redeemed. We extensively study the trade-offs between privacy (obtained through anonymity) and security in AT through the notion of non-transferability. We formalise new security notions, design a suite of protocols with various flavors of NT, prove their security, and implement the protocols to assess their efficiency. Finally, we study the existing anonymous credentials which offer NT, and show that they cannot automatically be used as AT without security and complexity implications.
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 2460-2474
Open AccessNon-Transferable Anonymous Tokens by Secret Binding
Non-transferability (NT) is a security notion which ensures that credentials are only used by their intended owners. Despite its importance, it has not been formally treated in the context of anonymous tokens (AT) which are lightweight anonymous credentials. In this work, we consider a client who "buys" access tokens which are forbidden to be transferred although anonymously redeemed. We extensively study the trade-offs between privacy (obtained through anonymity) and security in AT through the notion of non-transferability. We formalise new security notions, design a suite of protocols with various flavors of NT, prove their security, and implement the protocols to assess their efficiency. Finally, we study the existing anonymous credentials which offer NT, and show that they cannot automatically be used as AT without security and complexity implications.
- Open Access
- 9 April 2024
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 1 (1)
New Attacks on LowMC Using Partial Sets in the Single-Data Setting
The LowMC family of block ciphers was proposed by Albrecht et al. in Eurocrypt 2015, specifically targeting adoption in FHE and MPC applications due to its low multiplicative complexity. The construction operates a 3-bit quadratic S-box as the sole non-linear transformation in the algorithm. In contrast, both the linear layer and round key generation are achieved through multiplications of full rank matrices over GF(2). The cipher is instantiable using a diverse set of default configurations, some of which have partial non-linear layers i.e., in which the S-boxes are not applied over the entire internal state of the cipher. The significance of cryptanalysing LowMC was elevated by its inclusion into the NIST PQC digital signature scheme PICNIC in which a successful key recovery using a single plaintext/ciphertext pair is akin to retrieving the secret signing key. The current state-of-the-art attack in this setting is due to Dinur at Eurocrypt 2021, in which a novel way of enumerating roots of a Boolean system of equation is morphed into a key-recovery procedure that undercuts an ordinary exhaustive search in terms of time complexity for the variants of the cipher up to five rounds. In this work, we demonstrate that this technique can efficiently be enriched with a specific linearization strategy that reduces the algebraic degree of the non-linear layer as put forward by Banik et al. at IACR ToSC 2020(4). This amalgamation yields new attacks on certain instances of LowMC up to seven rounds.
- 9 April 2024
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 1 (1)
Open AccessNew Attacks on LowMC Using Partial Sets in the Single-Data Setting
The LowMC family of block ciphers was proposed by Albrecht et al. in Eurocrypt 2015, specifically targeting adoption in FHE and MPC applications due to its low multiplicative complexity. The construction operates a 3-bit quadratic S-box as the sole non-linear transformation in the algorithm. In contrast, both the linear layer and round key generation are achieved through multiplications of full rank matrices over GF(2). The cipher is instantiable using a diverse set of default configurations, some of which have partial non-linear layers i.e., in which the S-boxes are not applied over the entire internal state of the cipher. The significance of cryptanalysing LowMC was elevated by its inclusion into the NIST PQC digital signature scheme PICNIC in which a successful key recovery using a single plaintext/ciphertext pair is akin to retrieving the secret signing key. The current state-of-the-art attack in this setting is due to Dinur at Eurocrypt 2021, in which a novel way of enumerating roots of a Boolean system of equation is morphed into a key-recovery procedure that undercuts an ordinary exhaustive search in terms of time complexity for the variants of the cipher up to five rounds. In this work, we demonstrate that this technique can efficiently be enriched with a specific linearization strategy that reduces the algebraic degree of the non-linear layer as put forward by Banik et al. at IACR ToSC 2020(4). This amalgamation yields new attacks on certain instances of LowMC up to seven rounds.
- Open Access
- 9 April 2024
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 1 (1)
Impossibility of Post-Quantum Shielding Black-Box Constructions of CCA from CPA
Proving whether it is possible to build IND-CCA public-key encryption (PKE) from IND-CPA PKE in a black-box manner is a major open problem in theoretical cryptography. In a significant breakthrough, Gertner, Malkin and Myers showed in 2007 that shielding black-box reductions from IND-CCA to IND-CPA do not exist in the standard model. Shielding means that the decryption algorithm of the IND-CCA scheme does not call the encryption algorithm of the underlying IND-CPA scheme. In other words, it implies that every tentative construction of IND-CCA from IND-CPA must have a re-encryption step when decrypting. This result was only proven with respect to classical algorithms. In this work we show that it stands in a post-quantum setting. That is, we prove that there is no post-quantum shielding black-box construction of IND-CCA PKE from IND-CPA PKE. In the type of reductions we consider, i.e. post-quantum ones, the constructions are still classical in the sense that the schemes must be computable on classical computers, but the adversaries and the reduction algorithm can be quantum. This suggests that considering quantum notions, which are stronger than their classical counterparts, and allowing for quantum reductions does not make building IND-CCA public-key encryption easier.
- 9 April 2024
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 1 (1)
Open AccessImpossibility of Post-Quantum Shielding Black-Box Constructions of CCA from CPA
Proving whether it is possible to build IND-CCA public-key encryption (PKE) from IND-CPA PKE in a black-box manner is a major open problem in theoretical cryptography. In a significant breakthrough, Gertner, Malkin and Myers showed in 2007 that shielding black-box reductions from IND-CCA to IND-CPA do not exist in the standard model. Shielding means that the decryption algorithm of the IND-CCA scheme does not call the encryption algorithm of the underlying IND-CPA scheme. In other words, it implies that every tentative construction of IND-CCA from IND-CPA must have a re-encryption step when decrypting. This result was only proven with respect to classical algorithms. In this work we show that it stands in a post-quantum setting. That is, we prove that there is no post-quantum shielding black-box construction of IND-CCA PKE from IND-CPA PKE. In the type of reductions we consider, i.e. post-quantum ones, the constructions are still classical in the sense that the schemes must be computable on classical computers, but the adversaries and the reduction algorithm can be quantum. This suggests that considering quantum notions, which are stronger than their classical counterparts, and allowing for quantum reductions does not make building IND-CCA public-key encryption easier.
- 20 October 2023
- Published by Springer Nature
- p. 197-214
Private Message Franking with After Opening Privacy
- 20 October 2023
- Published by Springer Nature
- p. 197-214
Private Message Franking with After Opening Privacy
- 24 August 2023
- Published by Springer Nature
- p. 173-192
Making Classical (Threshold) Signatures Post-quantum for Single Use on a Public Ledger
- 24 August 2023
- Published by Springer Nature
- p. 173-192
Making Classical (Threshold) Signatures Post-quantum for Single Use on a Public Ledger
- 24 August 2023
- Published by Springer Nature
- p. 152-172
Extractable Witness Encryption for the Homogeneous Linear Equations Problem
- 24 August 2023
- Published by Springer Nature
- p. 152-172
Extractable Witness Encryption for the Homogeneous Linear Equations Problem
- 9 August 2023
- Published by Springer Nature
- p. 362-395
On Active Attack Detection in Messaging with Immediate Decryption
- 9 August 2023
- Published by Springer Nature
- p. 362-395
On Active Attack Detection in Messaging with Immediate Decryption