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

Christoph Bader

dblp:146/4578 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2016
—ORCID · conflict

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

Security and privacy · 5 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorTheory of computation · 1 · 1 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
1 paper
Cryptographic primitives and cryptanalysis · 100%
Computer graphics and multimedia
1 paper
Computational fabrication · 77% Geometric modeling and processing · 23%

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

TopicWeightPapersLastEvidence papers
Computational fabrication
additive manufacturing
0.212016
Recursive symmetries for geometrically complex and materially heterogeneous additive manufacturing · Comput. Aided Des. 2016
Cryptographic primitives and cryptanalysis
security reductions
0.212016
On the Impossibility of Tight Cryptographic Reductions · EUROCRYPT (2) 2016
Cryptographic primitives and cryptanalysis › security reductions
tight reduction
0.212016
On the Impossibility of Tight Cryptographic Reductions · EUROCRYPT (2) 2016
YearPublicationVenuePosition
2016 On the Impossibility of Tight Cryptographic Reductions
Christoph Bader, Tibor Jager, Yong Li 0021, Sven Schäge
EUROCRYPT (2)1
2016 How Secure is TextSecure?
abstract
Instant Messaging has gained popularity by users for both private and business communication as low-cost short message replacement on mobile devices. However, before releases about mass surveillance performed by intelligence services such as NSA and GCHQ and Facebook's acquisition of WhatsApp, most mobile messaging apps did not protect confidentiality or integrity of the messages. A messaging app that claims to provide secure instant messaging and has attracted a lot of attention is TextSecure. Besides numerous direct installations, its protocol is part of Android's most popular aftermarket firmware Cyanogen-Mod. TextSecure's successor Signal continues to use the underlying protocol for text messaging. In this paper, we present the first complete description of TextSecure's complex cryptographic protocol, provide a security analysis of its three main components (key exchange, key derivation and authenticated encryption), and discuss the main security claims of TextSecure. Furthermore, we formally prove that - if key registration is assumed to be secure - TextSecure's push messaging can indeed achieve most of the claimed security goals.
Tilman Frosch, Christian Mainka, Christoph Bader, Florian Bergsma, Jörg Schwenk, Thorsten Holz
EuroS&P3
2016 Recursive symmetries for geometrically complex and materially heterogeneous additive manufacturing
Christoph Bader, Neri Oxman
Comput. Aided Des.1
2015 Tightly-Secure Authenticated Key Exchange
Christoph Bader, Dennis Hofheinz, Tibor Jager, Eike Kiltz, Yong Li 0021
TCC (1)1
2014 New Modular Compilers for Authenticated Key Exchange
Yong Li 0021, Sven Schäge, Zheng Yang 0005, Christoph Bader, Jörg Schwenk
ACNS4
2014 Efficient Signatures with Tight Real World Security in the Random-Oracle Model
Christoph Bader
CANS1