Demo Data from EDBT 2026 / reviewers in the wild / expert
Robin Künzler
dblp:21/415
· DBLP profile ↗
6ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4 · 1 first-authorSecurity and privacy · 3 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 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
2 papers |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › block cipher
feistel network |
0.4 | 2 | 2016 | How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction · J. Cryptol. 2016 The equivalence of the random oracle model and the ideal cipher model, revisited · STOC 2011 |
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic models
indifferentiability |
0.4 | 2 | 2016 | How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction · J. Cryptol. 2016 The equivalence of the random oracle model and the ideal cipher model, revisited · STOC 2011 |
Cryptographic primitives and cryptanalysis
block cipher |
0.2 | 1 | 2016 | How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction · J. Cryptol. 2016 |
Cryptographic primitives and cryptanalysis › block cipher
ideal cipher |
0.2 | 1 | 2016 | How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction · J. Cryptol. 2016 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Combating Reentrancy Bugs on Sharded Blockchains
Ognjen Maric, Robin Künzler, Lara Schmid, Roman Kashitsyn |
ICBC | 2 |
| 2016 | How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction
Jean-Sébastien Coron, Thomas Holenstein, Robin Künzler, Jacques Patarin, Yannick Seurin, Stefano Tessaro |
J. Cryptol. | 3 |
| 2014 | A Protocol for Generating Random Elements with Their Probabilities
Thomas Holenstein, Robin Künzler |
COCOON | 2 |
| 2014 | A New View on Worst-Case to Average-Case Reductions for NP Problems
Thomas Holenstein, Robin Künzler |
COCOON | 2 |
| 2011 | The equivalence of the random oracle model and the ideal cipher model, revisitedabstractWe consider the cryptographic problem of constructing an invertible random permutation from a public random function (i.e., which can be accessed by the adversary). This goal is formalized by the notion of indifferentiability of Maurer et al. (TCC 2004). This is the natural extension to the public setting of the well-studied problem of building random permutations from random functions, which was first solved by Luby and Rackoff (Siam J. Comput., '88) using the so-called Feistel construction. The most important implication of such a construction is the equivalence of the random oracle model (Bellare and Rogaway, CCS '93) and the ideal cipher model, which is typically used in the analysis of several constructions in symmetric cryptography. Thomas Holenstein, Robin Künzler, Stefano Tessaro |
STOC | 2 |
| 2009 | Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
Robin Künzler, Jörn Müller-Quade, Dominik Raub |
TCC | 1 |