Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Niklas Medinger

dblp:272/7168 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0006-0494-6137ORCID · corroborated

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

Security and privacy · 3 · 2 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
3 papers
Cryptographic protocols and secure computation · 54% Cryptographic primitives and cryptanalysis · 31% Network security · 9%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › secure messaging
post-compromise security
0.912025
Impossibility Results for Post-Compromise Security in Real-World Communication Systems · SP 2025
Cryptographic protocols and secure computation
secure messaging
0.912025
Impossibility Results for Post-Compromise Security in Real-World Communication Systems · SP 2025
Cryptographic primitives and cryptanalysis › post-quantum cryptography
key encapsulation mechanism
0.812024
Keeping Up with the KEMs: Stronger Security Notions for KEMs and Automated Analysis of KEM-based Protocols · CCS 2024
Cryptographic primitives and cryptanalysis
post-quantum cryptography
0.812024
Keeping Up with the KEMs: Stronger Security Notions for KEMs and Automated Analysis of KEM-based Protocols · CCS 2024
Cryptographic protocols and secure computation
security protocol analysis
0.812024
Keeping Up with the KEMs: Stronger Security Notions for KEMs and Automated Analysis of KEM-based Protocols · CCS 2024
Network security
wireless network security
0.412020
A Formal Analysis of IEEE 802.11's WPA2: Countering the Kracks Caused by Cracking the Counters · USENIX Security Symposium 2020
Web and mobile security › web application security
session management
0.312025
Impossibility Results for Post-Compromise Security in Real-World Communication Systems · SP 2025
Cryptographic protocols and secure computation
protocol verification
0.112020
A Formal Analysis of IEEE 802.11's WPA2: Countering the Kracks Caused by Cracking the Counters · USENIX Security Symposium 2020

Methods — techniques the papers use, named apart from their topics

formal proof · 0.9formal analysis · 0.4
YearPublicationVenuePosition
2025 Impossibility Results for Post-Compromise Security in Real-World Communication Systems
abstract
Modern secure communication systems, such as iMessage, WhatsApp, and Signal include intricate mechanisms that aim to achieve very strong security properties. These mechanisms typically involve continuously merging fresh secrets into the keying material that is used to encrypt messages during communications. In the literature, these mechanisms have been proven to achieve forms of Post-Compromise Security (PCS): the ability to provide communication security even if the full state of a party was compromised some time in the past. However, recent work has shown these proofs cannot be transferred to the end-user level, possibly because of usability concerns. This has raised the question of whether end-users can actually obtain PCS or not, and under which conditions. Here we show and formally prove that communication systems that need to be resilient against certain types of state loss (which can occur in practice) fundamentally cannot achieve full PCS for end-users. Whereas previous work showed that the Signal messenger did not achieve this with its current session-management layer, we isolate the exact conditions that cause this failure, and we show why this cannot be simply solved in communication systems by implementing a different session-management layer or an entirely different protocol. Moreover, we clarify the trade-off of the maximum number of sessions between two users (40 in Signal) in terms of failure-resilience versus security. Our results have direct consequences for the design of future secure communication systems and could motivate either the simplification of redundant mechanisms or the improvement of session-management designs to provide better security trade-offs with respect to state loss/failure tolerance.
Cas Cremers, Niklas Medinger, Aurora Naska
SP2
2024 Keeping Up with the KEMs: Stronger Security Notions for KEMs and Automated Analysis of KEM-based Protocols
abstract
Key Encapsulation Mechanisms (KEMs) are a critical building block for hybrid encryption and modern security protocols, notably in the post-quantum setting. Given the asymmetric public key of a recipient, the primitive establishes a shared secret key between sender and recipient. In recent years, a large number of abstract designs and concrete implementations of KEMs have been proposed, e.g., in the context of the NIST process for post-quantum primitives.
Cas Cremers, Alexander Dax, Niklas Medinger
CCS3
2020 A Formal Analysis of IEEE 802.11's WPA2: Countering the Kracks Caused by Cracking the Counters
Cas Cremers, Benjamin Kiesl-Reiter, Niklas Medinger
USENIX Security Symposium3