default search action
Benedikt Auerbach
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c12]Benedikt Auerbach
, Christoph U. Günther
Trapdoor Memory-Hard Functions. EUROCRYPT (3) 2024: 315-344 - [c11]Joël Alwen, Benedikt Auerbach
DeCAF: Decentralizable CGKA with Fast Healing. SCN (2) 2024: 294-313 - [i13]Benedikt Auerbach, Christoph U. Günther, Krzysztof Pietrzak:
Trapdoor Memory-Hard Functions. IACR Cryptol. ePrint Arch. 2024: 312 (2024) - [i12]Michael Anastos, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Matthew Kwan, Guillermo Pascual-Perez, Krzysztof Pietrzak:
The Cost of Maintaining Keys in Dynamic Groups with Applications to Multicast Encryption and Group Messaging. IACR Cryptol. ePrint Arch. 2024: 1097 (2024) - 2023
- [c10]Benedikt Auerbach
On the Cost of Post-compromise Security in Concurrent Continuous Group-Key Agreement. TCC (3) 2023: 271-300 - [c9]Benedikt Auerbach
Generic-Group Lower Bounds via Reductions Between Geometric-Search Problems: With and Without Preprocessing. TCC (3) 2023: 301-330 - [i11]Benedikt Auerbach
Generic-Group Lower Bounds via Reductions Between Geometric-Search Problems: With and Without Preprocessing. IACR Cryptol. ePrint Arch. 2023: 808 (2023) - [i10]Benedikt Auerbach
On the Cost of Post-Compromise Security in Concurrent Continuous Group-Key Agreement. IACR Cryptol. ePrint Arch. 2023: 1123 (2023) - 2022
- [c8]Joël Alwen, Benedikt Auerbach
CoCoA: Concurrent Continuous Group Key Agreement. EUROCRYPT (2) 2022: 815-844 - [i9]Joël Alwen, Benedikt Auerbach, Miguel Cueto Noval, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter:
CoCoA: Concurrent Continuous Group Key Agreement. IACR Cryptol. ePrint Arch. 2022: 251 (2022) - [i8]Joël Alwen, Benedikt Auerbach
Coffee: Fast Healing Concurrent Continuous Group Key Agreement for Decentralized Group Messaging. IACR Cryptol. ePrint Arch. 2022: 559 (2022) - 2021
- [c7]Benedikt Auerbach
Inverse-Sybil Attacks in Automated Contact Tracing. CT-RSA 2021: 399-421 - [c6]Joël Alwen, Benedikt Auerbach
Grafting Key Trees: Efficient Key Management for Overlapping Groups. TCC (3) 2021: 222-253 - [i7]Joël Alwen, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter:
Grafting Key Trees: Efficient Key Management for Overlapping Groups. IACR Cryptol. ePrint Arch. 2021: 1158 (2021) - 2020
- [c5]Benedikt Auerbach
Everybody's a Target: Scalability in Public-Key Encryption. EUROCRYPT (3) 2020: 475-506 - [i6]Benedikt Auerbach, Suvradip Chakraborty, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter, Michelle Yeo:
Inverse-Sybil Attacks in Automated Contact Tracing. IACR Cryptol. ePrint Arch. 2020: 670 (2020)
2010 – 2019
- 2019
- [b1]Benedikt Auerbach:
On the security of public-key encrytion in mass-surveillance settings. Ruhr University Bochum, Germany, 2019 - [j1]Benedikt Auerbach
Zwei Betrachtungen von Sicherheit und Privatheit nach Snowden. Datenschutz und Datensicherheit 43(11): 706-712 (2019) - [c4]Benedikt Auerbach
Lossy Trapdoor Permutations with Improved Lossiness. CT-RSA 2019: 230-250 - [i5]Benedikt Auerbach, Federico Giacon, Eike Kiltz:
Everybody's a Target: Scalability in Public-Key Encryption. IACR Cryptol. ePrint Arch. 2019: 364 (2019) - 2018
- [c3]Benedikt Auerbach
Public-Key Encryption Resistant to Parameter Subversion and Its Realization from Efficiently-Embeddable Groups. Public Key Cryptography (1) 2018: 348-377 - [c2]Benedikt Auerbach
Hashing Solutions Instead of Generating Problems: On the Interactive Certification of RSA Moduli. Public Key Cryptography (2) 2018: 403-430 - [i4]Benedikt Auerbach, Bertram Poettering:
Hashing solutions instead of generating problems: On the interactive certification of RSA moduli. IACR Cryptol. ePrint Arch. 2018: 13 (2018) - [i3]Benedikt Auerbach, Mihir Bellare, Eike Kiltz:
Public-Key Encryption Resistant to Parameter Subversion and its Realization from Efficiently-Embeddable Groups. IACR Cryptol. ePrint Arch. 2018: 23 (2018) - [i2]Benedikt Auerbach, Eike Kiltz, Bertram Poettering, Stefan Schoenen:
Lossy Trapdoor Permutations with Improved Lossiness. IACR Cryptol. ePrint Arch. 2018: 1183 (2018) - 2017
- [c1]Benedikt Auerbach
Memory-Tight Reductions. CRYPTO (1) 2017: 101-132 - [i1]Benedikt Auerbach, David Cash, Manuel Fersch, Eike Kiltz:
Memory-Tight Reductions. IACR Cryptol. ePrint Arch. 2017: 675 (2017)
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 2024-10-04 20:02 CEST 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: