Ulrich Haböck

dblp:164/7920 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
1since 2021 · last 2026
0000-0003-0467-9260ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2 · 2 first-authorComputer networks · 1Theory of computation · 1 · 1 since 2021
YearPublicationVenuePosition
2026 On Proximity Gaps of Reed-Solomon Codes
Eli Ben-Sasson, Dan Carmon, Ulrich Haböck, Swastik Kopparty, Shubhangi Saraf
STOC3
2019 Breaking and Fixing Anonymous Credentials for the Cloud
Ulrich Haböck, Stephan Krenn
CANS1
2018 Searchitect - A Developer Framework for Hybrid Searchable Encryption (Position Paper)
Ulrich Haböck, Manuel Koschuch, Ines Kramer, Silvie Schmidt, Mathias Tausig
IoTBDS1
2015 Fogging the cloud - Implementing and evaluating searchable encryption schemes in practice
abstract
With the rise of cloud computing new ways to secure outsourced data have to be devised. Traditional approaches like simply encrypting all data before it is transferred only partially alleviate this problem. Searchable Encryption (SE) schemes enable the cloud provider to search for user supplied strings in the encrypted documents, while neither learning anything about the content of the documents nor about the search terms. Currently there are many different SE schemes defined in the literature, with their number steadily growing. But experimental results of real world performance, or direct comparisons between different schemes, are severely lacking. In this work we propose a simple Java client-server framework to efficiently implement different SE algorithms and compare their efficiency in practice. In addition, we demonstrate the possibilities of such a framework by implementing two different existing SE schemes from slightly different domains and compare their behavior in a real-world setting.
Manuel Koschuch, Michael Hombauer, Sigrid Schefer-Wenzl, Ulrich Haböck, Stefan Hrdlicka
IM4