Demo Data from SIGIR 2026 / reviewers in the wild / expert
Aljosha Judmayer
dblp:178/3737
· DBLP profile ↗
8ranked-venue papers
2as first author
4since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 8 · 2 first-author · 4 since 2021
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
4 papers |
Cryptographic protocols and secure computation · 40% Privacy and data protection · 30% Cryptographic primitives and cryptanalysis · 17% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% |
Topics — the 9 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation
distributed randomness |
0.5 | 1 | 2021 | RandRunner: Distributed Randomness from Trapdoor VDFs with Strong Uniqueness · NDSS 2021 |
Cryptographic primitives and cryptanalysis › timed cryptography
verifiable delay functions |
0.5 | 1 | 2021 | RandRunner: Distributed Randomness from Trapdoor VDFs with Strong Uniqueness · NDSS 2021 |
Cryptographic protocols and secure computation › secret sharing › verifiable secret sharing
publicly verifiable secret sharing |
0.4 | 1 | 2020 | HydRand: Efficient Continuous Distributed Randomness · SP 2020 |
Distributed systems › distributed algorithms
distributed randomness |
0.4 | 1 | 2020 | HydRand: Efficient Continuous Distributed Randomness · SP 2020 |
Distributed systems › distributed algorithms › distributed randomness
distributed randomness beacon |
0.4 | 1 | 2020 | HydRand: Efficient Continuous Distributed Randomness · SP 2020 |
Web and mobile security
messaging application security |
0.3 | 1 | 2026 | Hey there! You are using WhatsApp: Enumerating Three Billion Accounts for Security and Privacy · NDSS 2026 |
Cryptographic protocols and secure computation › distributed randomness
randomness beacon |
0.1 | 1 | 2021 | RandRunner: Distributed Randomness from Trapdoor VDFs with Strong Uniqueness · NDSS 2021 |
Blockchain and cryptocurrency security › consensus protocol
proof-of-stake |
0.1 | 1 | 2020 | HydRand: Efficient Continuous Distributed Randomness · SP 2020 |
Cryptographic primitives and cryptanalysis
post-quantum cryptography |
0.1 | 1 | 2016 | Condensed Cryptographic Currencies Crash Course (C5) · CCS 2016 |
Methods — techniques the papers use, named apart from their topics
protocol design · 0.9complexity analysis · 0.9trapdoor VDF · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Hey there! You are using WhatsApp: Enumerating Three Billion Accounts for Security and Privacy
Gabriel K. Gegenhuber, Philipp É. Frenzel, Maximilian Günther, Johanna Ullrich, Aljosha Judmayer |
NDSS | 5 |
| 2025 | Careless Whisper: Exploiting Silent Delivery Receipts to Monitor Users on Mobile Instant MessengersabstractWith over 3 billion users globally, mobile instant messaging apps have become indispensable for both personal and professional communication. Besides plain messaging, many services implement additional features such as delivery and read receipts informing a user when a message has successfully reached its target. This paper highlights that delivery receipts can pose significant privacy risks to users. We use specifically crafted messages that trigger silent delivery receipts allowing any user to be pinged without their knowledge or consent. By using this technique at high frequency, we demonstrate how an attacker could extract private information such as following a user across different companion devices, inferring their daily schedule, or deducing current activities. Moreover, we can infer the number of currently active user sessions (i.e., main and companion devices) and their operating system, as well as launch resource exhaustion attacks, such as draining a user’s battery or data allowance, all without generating any notification on the target side. Due to the widespread adoption of vulnerable messengers (WhatsApp and Signal) and the fact that any user can be targeted simply by knowing their phone number, we argue for a design change to address this issue. Gabriel K. Gegenhuber, Maximilian Günther, Aljosha Judmayer, Florian Holzbauer, Philipp É. Frenzel, Johanna Ullrich |
RAID | 4 |
| 2022 | Opportunistic Algorithmic Double-Spending: - How I Learned to Stop Worrying and Love the Fork
Nicholas Stifter, Aljosha Judmayer, Philipp Schindler, Edgar R. Weippl |
ESORICS (1) | 2 |
| 2021 | RandRunner: Distributed Randomness from Trapdoor VDFs with Strong Uniqueness
Philipp Schindler, Aljosha Judmayer, Markus Hittmeir, Nicholas Stifter, Edgar R. Weippl |
NDSS | 2 |
| 2020 | HydRand: Efficient Continuous Distributed RandomnessabstractA reliable source of randomness is not only an essential building block in various cryptographic, security, and distributed systems protocols, but also plays an integral part in the design of many new blockchain proposals. Consequently, the topic of publicly-verifiable, bias-resistant and unpredictable randomness has recently enjoyed increased attention. In particular random beacon protocols, aimed at continuous operation, can be a vital component for current Proof-of-Stake based distributed ledger proposals. We improve upon previous random beacon approaches with HydRand, a novel distributed protocol based on publicly-verifiable secret sharing (PVSS) to ensure unpredictability, bias-resistance, and public-verifiability of a continuous sequence of random beacon values. Furthermore, HydRand provides guaranteed output delivery of randomness at regular and predictable intervals in the presence of adversarial behavior and does not rely on a trusted dealer for the initial setup. Compared to existing PVSS based approaches that strive to achieve similar properties, our solution improves scalability by lowering the communication complexity from $\mathcal{O}\left( {{n^3}} \right)$ to $\mathcal{O}\left( {{n^2}} \right)$ . Furthermore, we are the first to present a detailed comparison of recently described schemes and protocols that can be used for implementing random beacons. Philipp Schindler, Aljosha Judmayer, Nicholas Stifter, Edgar R. Weippl |
SP | 2 |
| 2018 | Proof-of-Blackouts? How Proof-of-Work Cryptocurrencies Could Affect Power Grids
Johanna Ullrich, Nicholas Stifter, Aljosha Judmayer, Adrian Dabrowski, Edgar R. Weippl |
RAID | 3 |
| 2017 | Lightweight Address Hopping for Defending the IPv6 IoTabstractThe rapid deployment of IoT systems on the public Internet is not without concerns for the security and privacy of consumers. Security in IoT systems is often poorly engineered and engineering for privacy does notseemtobea concern for vendors at all. Thecombination of poor security hygiene and access to valuable knowledge renders IoT systems a much-sought target for attacks. Aljosha Judmayer, Johanna Ullrich, Georg Merzdovnik, Artemios G. Voyiatzis, Edgar R. Weippl |
ARES | 1 |
| 2016 | Condensed Cryptographic Currencies Crash Course (C5)abstract"Bitcoin is a rare case where practice seems to be ahead of theory." Joseph Bonneau et al. [3] This tutorial aims to further close the gap between IT security research and the area of cryptographic currencies and block chains. We will describe and refer to Bitcoin as an example throughout the tutorial, as it is the most prominent representative of such a system. It also is a good reference to discuss the underlying block chain mechanics which are the foundation of various altcoins and other derived systems. In this tutorial, the topic of cryptographic currencies is solely addressed from a technical IT security point-of-view. Therefore we do not cover any legal, sociological, financial or economical aspects. Aljosha Judmayer, Edgar R. Weippl |
CCS | 1 |