EDBT 2026 Demo / reviewers in the wild / expert
Jan-Ole Malchow
dblp:172/6499
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2018
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
1 paper |
Cryptographic protocols and secure computation · 62% Authentication and access control · 38% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › secure computation protocols › setup assumptions
trusted third party |
0.2 | 1 | 2016 | POSTER: Re-Thinking Risks and Rewards for Trusted Third Parties · CCS 2016 |
Authentication and access control › trust management
reputation |
0.1 | 1 | 2016 | POSTER: Re-Thinking Risks and Rewards for Trusted Third Parties · CCS 2016 |
Authentication and access control › trust management
trust models |
0.1 | 1 | 2016 | POSTER: Re-Thinking Risks and Rewards for Trusted Third Parties · CCS 2016 |
Methods — techniques the papers use, named apart from their topics
security requirements analysis · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | I Need this Back, Later!: An Exploration of Practical Secret SharingabstractSharing encryption keys secretly can be useful to protect the availability and confidentiality of redundant encrypted backups. Key shares may be distributed and managed conveniently online, or offline with security benefits. We carried out a field study in order to learn how practical secret sharing is in the offline case using two form factors as carriers of share information: paper printouts and key tags. Our findings suggest that offline sharing is practical but slow. The form factor did not have a significant effect on retrieval success. Perhaps other parameters may be optimized instead such as convenience and costs of share production. We used k = 3, n = 5 as the secret sharing parameters in our study. This appears to suffice in many cases but we also found that increasing n and k is recommendable in practice because the safety and security margin was thin in our study. Oliver Wiese, Christoph Weinhold, Jan-Ole Malchow, Volker Roth 0002 |
ACSAC | 3 |
| 2016 | POSTER: Re-Thinking Risks and Rewards for Trusted Third PartiesabstractCommercial trusted third parties (TTPs) may increase their bottom line by watering down their validation procedures because they assume no liability for lapses of judgement. Consumers bear the risk of misplaced trust. Reputation loss is a weak deterrent for TTPs because consumers do not choose them - web shops and browser vendors do. At the same time, consumers are the source of income of these parties. Hence, risks and rewards are not well-aligned. Towards a better alignment, we explore the brokering of connection insurances and transaction insurances, where consumers get to choose their insurer. We lay out the principal idea how such a brokerage might work at a technical level with minimal interference with existing protocols and mechanisms, we analyze the security requirements and we propose techniques to meet these requirements. Jan-Ole Malchow, Benjamin Güldenring, Volker Roth 0002 |
CCS | 1 |