Ward Beullens
Orcid: 0000-0003-0888-283XAffiliations:
- IBM Research Europe, Zürich, Switzerland
According to our database1,
Ward Beullens
authored at least 33 papers
between 2017 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025
Shorter, Tighter, FAESTer: Optimizations and Improved (QROM) Analysis for VOLE-in-the-Head Signatures.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025
2024
IACR Commun. Cryptol., 2024
Proceedings of the Selected Areas in Cryptography - SAC 2024, 2024
One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024
2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023
2022
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2022
IACR Cryptol. ePrint Arch., 2022
Group Signatures and More from Isogenies and Lattices: Generic, Simple, and Efficient.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022
2021
Proceedings of the Selected Areas in Cryptography - 28th International Conference, 2021
Proceedings of the Post-Quantum Cryptography - 12th International Workshop, 2021
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021
2020
Not enough LESS: An improved algorithm for solving Code Equivalence Problems over 픽<sub>q</sub>.
IACR Cryptol. ePrint Arch., 2020
Not Enough LESS: An Improved Algorithm for Solving Code Equivalence Problems over $\mathbb {F}_q$.
Proceedings of the Selected Areas in Cryptography - SAC 2020, 2020
Proceedings of the Post-Quantum Cryptography - 11th International Conference, 2020
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020
Calamari and Falafl: Logarithmic (Linkable) Ring Signatures from Isogenies and Lattices.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020
2019
IACR Cryptol. ePrint Arch., 2019
IACR Cryptol. ePrint Arch., 2019
Proceedings of the Public-Key Cryptography - PKC 2019, 2019
Proceedings of the Progress in Cryptology - INDOCRYPT 2019, 2019
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019
2018
Proceedings of the Selected Areas in Cryptography - SAC 2018, 2018
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018
2017
Proceedings of the Post-Quantum Cryptography - 8th International Workshop, 2017
Proceedings of the Progress in Cryptology - INDOCRYPT 2017, 2017