Balthazar Bauer

Orcid: 0009-0003-1469-5405

According to our database1, Balthazar Bauer authored at least 18 papers between 2015 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Hybrid Quantum Cryptography from Communication Complexity.
Quantum, 2025

2024
On Security Proofs of Existing Equivalence Class Signature Schemes.
IACR Cryptol. ePrint Arch., 2024

The Uber-Knowledge Assumption: A Bridge to the AGM.
IACR Commun. Cryptol., 2024

On Proving Equivalence Class Signatures Secure from Non-interactive Assumptions.
Proceedings of the Public-Key Cryptography - PKC 2024, 2024

Fine-Grained Non-interactive Key Exchange, Revisited.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

On Security Proofs of Existing Equivalence Class Signature Schemes.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
Aggregate Signatures with Versatile Randomization and Issuer-Hiding Multi-Authority Anonymous Credentials.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
Practical Delegatable Anonymous Credentials From Equivalence Class Signatures.
IACR Cryptol. ePrint Arch., 2022

Beyond Uber: Instantiating Generic Groups via PGGs.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

2021
Transferable E-Cash: A Cleaner Model and the First Practical Instantiation.
Proceedings of the Public-Key Cryptography - PKC 2021, 2021

The One-More Discrete Logarithm Assumption in the Generic Group Model.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
Transferable e-cash: an analysis in the Algebraic Group Model. (Monnaies numériques transférables: une analyse de sécurité dans le modèle du groupe algébrique).
PhD thesis, 2020

Efficient Signatures on Randomizable Ciphertexts.
Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

A Classification of Computational Assumptions in the Algebraic Group Model.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2018
Discrete Morse theory for the collapsibility of supremum sections.
CoRR, 2018

On the Inner Product Predicate and a Generalization of Matching Vector Families.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Combiners for Backdoored Random Oracles.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2015
Internal Compression of Protocols to Entropy.
Proceedings of the Approximation, 2015


  Loading...