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
Demo Data from VLDB 2026 / reviewers in the wild / expert

Johannes Mittmann

dblp:75/9215 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
2since 2021 · last 2022
0000-0002-9307-1494ORCID · reported

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

Security and privacy · 2 · 2 since 2021Theory of computation · 2

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.

Theoretical computer science
2 papers
Computational complexity · 100%
Network and information security
1 paper
Network security · 77% Cryptographic primitives and cryptanalysis · 23%

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

TopicWeightPapersLastEvidence papers
Network security › secure communication › secure communication protocol
TLS		 0.512021
Raccoon Attack: Finding and Exploiting Most-Significant-Bit-Oracles in TLS-DH(E) · USENIX Security Symposium 2021
Computational complexity
algebraic complexity		 0.322013
Algebraic independence and blackbox identity testing · Inf. Comput. 2013
Algebraic Independence and Blackbox Identity Testing · ICALP (2) 2011
Computational complexity › algebraic complexity
algebraic independence		 0.322013
Algebraic independence and blackbox identity testing · Inf. Comput. 2013
Algebraic Independence and Blackbox Identity Testing · ICALP (2) 2011
Computational complexity › algebraic complexity
identity testing		 0.322013
Algebraic independence and blackbox identity testing · Inf. Comput. 2013
Algebraic Independence and Blackbox Identity Testing · ICALP (2) 2011
Computational complexity › algebraic complexity › polynomial identity testing
black-box identity testing		 0.112011
Algebraic Independence and Blackbox Identity Testing · ICALP (2) 2011

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

oracle attack · 0.5blackbox identity testing · 0.2algebraic independence · 0.2
YearPublicationVenuePosition
2022 How to Backdoor (Classic) McEliece and How to Guard Against Backdoors
Tobias Hemmert, Alexander May 0001, Johannes Mittmann, Carl Richard Theodor Schneider
 PQCrypto3
2021 Raccoon Attack: Finding and Exploiting Most-Significant-Bit-Oracles in TLS-DH(E)
Robert Merget, Marcus Brinkmann, Nimrod Aviram, Juraj Somorovsky, Johannes Mittmann, Jörg Schwenk
 USENIX Security Symposium5
2013 Algebraic independence and blackbox identity testing
Malte Beecken, Johannes Mittmann, Nitin Saxena 0001
 Inf. Comput.2
2011 Algebraic Independence and Blackbox Identity Testing
Malte Beecken, Johannes Mittmann, Nitin Saxena 0001
 ICALP (2)2