Paul Baecher

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 EDBT 2026 / reviewers in the wild / expert

dblp:15/1510 · DBLP profile ↗

← Back

7ranked-venue papers

7as first author

0since 2021 · last 2013

—ORCID · none

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

Security and privacy · 7 · 7 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

4 papers

Cryptographic primitives and cryptanalysis · 70% Cryptographic protocols and secure computation · 30%

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

Topic	Weight	Papers	Last	Evidence papers
Cryptographic primitives and cryptanalysis › provable security black-box reductions	0.2	1	2013	Notions of Black-Box Reductions, Revisited · ASIACRYPT (1) 2013
Cryptographic primitives and cryptanalysis › hash functions › hash function constructions blockcipher-based hash function	0.2	1	2013	Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions · EUROCRYPT 2013
Cryptographic primitives and cryptanalysis hash functions	0.2	1	2013	Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions · EUROCRYPT 2013
Cryptographic primitives and cryptanalysis random oracle model	0.1	1	2011	Random Oracle Reducibility · CRYPTO 2011
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic models ideal cipher model	0.0	1	2013	Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions · EUROCRYPT 2013

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

provable security · 0.2indifferentiability framework · 0.2ideal cipher model · 0.2reduction · 0.1random oracle methodology · 0.1

Year	Publication	Venue	Position
2013	Notions of Black-Box Reductions, Revisited Paul Baecher, Christopher Brzuska, Marc Fischlin	ASIACRYPT (1)	1
2013	Reset Indifferentiability and Its Consequences Paul Baecher, Christopher Brzuska, Arno Mittelbach	ASIACRYPT (1)	1
2013	Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions Paul Baecher, Pooya Farshim, Marc Fischlin, Martijn Stam	EUROCRYPT	1
2011	Random Oracle Reducibility Paul Baecher, Marc Fischlin	CRYPTO	1
2011	Expedient Non-malleability Notions for Hash Functions Paul Baecher, Marc Fischlin, Dominique Schröder	CT-RSA	1
2011	Breaking reCAPTCHA: A Holistic Approach via Shape Recognition Paul Baecher, Niklas Büscher, Marc Fischlin, Benjamin Milde	SEC	1
2006	The Nepenthes Platform: An Efficient Approach to Collect Malware Paul Baecher, Markus Koetter, Thorsten Holz, Maximillian Dornseif, Felix C. Freiling	RAID	1