default search action
Balthazar Bauer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Balthazar Bauer
, Pooya Farshim
The Uber-Knowledge Assumption: A Bridge to the AGM. IACR Commun. Cryptol. 1(3): 31 (2024) - [c12]Balthazar Bauer, Georg Fuchsbauer, Fabian Regen:
On Security Proofs of Existing Equivalence Class Signature Schemes. ASIACRYPT (2) 2024: 3-37 - [c11]Balthazar Bauer, Geoffroy Couteau, Elahe Sadeghi:
Fine-Grained Non-interactive Key Exchange, Revisited. CRYPTO (2) 2024: 286-312 - [c10]Balthazar Bauer, Georg Fuchsbauer, Fabian Regen:
On Proving Equivalence Class Signatures Secure from Non-interactive Assumptions. Public Key Cryptography (1) 2024: 3-36 - [i15]Balthazar Bauer, Georg Fuchsbauer:
On Security Proofs of Existing Equivalence Class Signature Schemes. IACR Cryptol. ePrint Arch. 2024: 183 (2024) - [i14]Balthazar Bauer, Geoffroy Couteau, Elahe Sadeghi:
Fine-Grained Non-Interactive Key Exchange, Revisited. IACR Cryptol. ePrint Arch. 2024: 834 (2024) - 2023
- [j1]Omid Mir, Daniel Slamanig
Practical Delegatable Anonymous Credentials From Equivalence Class Signatures. Proc. Priv. Enhancing Technol. 2023(3): 488-513 (2023) - [c9]Omid Mir
Aggregate Signatures with Versatile Randomization and Issuer-Hiding Multi-Authority Anonymous Credentials. CCS 2023: 30-44 - [i13]Omid Mir, Balthazar Bauer, Scott Griffy, Anna Lysyanskaya, Daniel Slamanig:
Aggregate Signatures with Versatile Randomization and Issuer-Hiding Multi-Authority Anonymous Credentials. IACR Cryptol. ePrint Arch. 2023: 1016 (2023) - [i12]Balthazar Bauer, Pooya Farshim, Patrick Harasser, Markulf Kohlweiss:
The Uber-Knowledge Assumption: A Bridge to the AGM. IACR Cryptol. ePrint Arch. 2023: 1601 (2023) - 2022
- [c8]Balthazar Bauer, Pooya Farshim, Patrick Harasser, Adam O'Neill:
Beyond Uber: Instantiating Generic Groups via PGGs. TCC (3) 2022: 212-242 - [i11]Omid Mir, Daniel Slamanig, Balthazar Bauer, René Mayrhofer:
Practical Delegatable Anonymous Credentials From Equivalence Class Signatures. IACR Cryptol. ePrint Arch. 2022: 680 (2022) - [i10]Balthazar Bauer, Pooya Farshim, Patrick Harasser, Adam O'Neill:
Beyond Uber: Instantiating Generic Groups via PGGs. IACR Cryptol. ePrint Arch. 2022: 1502 (2022) - 2021
- [c7]Balthazar Bauer, Georg Fuchsbauer, Antoine Plouviez:
The One-More Discrete Logarithm Assumption in the Generic Group Model. ASIACRYPT (4) 2021: 587-617 - [c6]Balthazar Bauer, Georg Fuchsbauer, Chen Qian
Transferable E-Cash: A Cleaner Model and the First Practical Instantiation. Public Key Cryptography (2) 2021: 559-590 - [i9]Balthazar Bauer, Georg Fuchsbauer, Antoine Plouviez:
The One-More Discrete Logarithm Assumption in the Generic Group Model. IACR Cryptol. ePrint Arch. 2021: 866 (2021) - 2020
- [b1]Balthazar Bauer:
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). Paris Sciences et Lettres University, France, 2020 - [c5]Balthazar Bauer, Georg Fuchsbauer, Julian Loss:
A Classification of Computational Assumptions in the Algebraic Group Model. CRYPTO (2) 2020: 121-151 - [c4]Balthazar Bauer, Georg Fuchsbauer:
Efficient Signatures on Randomizable Ciphertexts. SCN 2020: 359-381 - [i8]Balthazar Bauer, Georg Fuchsbauer:
Efficient Signatures on Randomizable Ciphertexts. IACR Cryptol. ePrint Arch. 2020: 524 (2020) - [i7]Balthazar Bauer, Georg Fuchsbauer, Julian Loss:
A Classification of Computational Assumptions in the Algebraic Group Model. IACR Cryptol. ePrint Arch. 2020: 859 (2020) - [i6]Balthazar Bauer, Georg Fuchsbauer, Chen Qian:
Transferable E-cash: A Cleaner Model and the First Practical Instantiation. IACR Cryptol. ePrint Arch. 2020: 1400 (2020)
2010 – 2019
- 2018
- [c3]Balthazar Bauer, Pooya Farshim, Sogol Mazaheri:
Combiners for Backdoored Random Oracles. CRYPTO (2) 2018: 272-302 - [c2]Balthazar Bauer, Jevgenijs Vihrovs, Hoeteck Wee:
On the Inner Product Predicate and a Generalization of Matching Vector Families. FSTTCS 2018: 41:1-41:13 - [i5]Balthazar Bauer, Lucas Isenmann:
Discrete Morse theory for the collapsibility of supremum sections. CoRR abs/1803.09577 (2018) - [i4]Balthazar Bauer, Jevgenijs Vihrovs, Hoeteck Wee:
On the Inner Product Predicate and a Generalization of Matching Vector Families. CoRR abs/1810.02396 (2018) - [i3]Balthazar Bauer, Pooya Farshim, Sogol Mazaheri:
Combiners for Backdoored Random Oracles. IACR Cryptol. ePrint Arch. 2018: 770 (2018) - [i2]Balthazar Bauer, Jevgenijs Vihrovs, Hoeteck Wee:
On the Inner Product Predicate and a Generalization of Matching Vector Families. IACR Cryptol. ePrint Arch. 2018: 945 (2018) - 2015
- [c1]Balthazar Bauer, Shay Moran, Amir Yehudayoff:
Internal Compression of Protocols to Entropy. APPROX-RANDOM 2015: 481-496 - 2014
- [i1]Balthazar Bauer, Shay Moran, Amir Yehudayoff:
Internal compression of protocols to entropy. Electron. Colloquium Comput. Complex. TR14 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-06 02:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: