Christoph Coijanovic

Christoph Coijanovic

Auto-generated profile, based on publicly available information

Christoph Coijanovic

Karlsruhe Institute of Technology

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 November 2025
Verified
Conference Paper
Open access
CCChristoph Coijanovic
Christoph Coijanovic
LHLaura Hetz
Laura Hetz
KPKenneth G. Paterson
Kenneth G. Paterson
TSThorsten Strufe
Thorsten Strufe

11 January 2024
Verified
Book Chapter
Closed access
PDF file
CCChristoph Coijanovic
Christoph Coijanovic
CWChristiane Weis
Christiane Weis
TSThorsten Strufe
Thorsten Strufe

15 July 2024
Verified
Book Chapter
Closed access
PDF file
CCChristoph Coijanovic
Christoph Coijanovic
ASAkim Stark
Akim Stark
DSDaniel Schadt
Daniel Schadt
TSThorsten Strufe
Thorsten Strufe

1 October 2025 in Proceedings on Privacy Enhancing Technologies
Verified
Journal Article
Open access
PDF file
DSDaniel Schadt
Daniel Schadt
CCChristoph Coijanovic
Christoph Coijanovic
TSThorsten Strufe
Thorsten Strufe
Mix networks allow communication with strong anonymity guarantees. In theory, mix networks can scale indefinitely, as additional nodes can be added to the network to support new users. However, one factor that limits scalability in current designs is the need for all clients to know both the identity and the key of every available mix node. In circuit-based onion routing, a mechanism that does not require this knowledge to be globally available exists, but it relies on the interactivity of the circuit construction to keep its security guarantees. We therefore set out to investigate whether we can transfer such a mechanism to the context of message-based mix networks. In this paper, we propose Aimless Onions, the first mix format that enables clients to create onions in a mix network without knowing which nodes are available. Rather than downloading topology information, clients only need to acquire constant-size public parameters. Thus, Aimless Onions overcomes an important scalability limitation in mix networks, while retaining the same security guarantees as the state of the art. Using Aimless Onions, clients sending 25 messages per hour save 74% of bandwidth compared to using Spinx packets and topology information download, even at today's network sizes.

9 October 2026
Verified
Book Chapter
Closed access
PDF file
DSDaniel Schadt
Daniel Schadt
CCChristoph Coijanovic
Christoph Coijanovic
SSShabi Shabani
Shabi Shabani
TSThorsten Strufe
Thorsten Strufe

26 November 2023
Verified
Conference Paper
Open access
CCChristoph Coijanovic
Christoph Coijanovic
DSDaniel Schadt
Daniel Schadt
CWChristiane Weis
Christiane Weis
TSThorsten Strufe
Thorsten Strufe
In areas such as manufacturing or logistics, it is beneficial for everyone to share access capacity with others. Increased efficiency increases profits, lowers prices for consumers, and reduces environmental impact. However, in order to share a resource such as manufacturing capacity, suitable partners must be found. Ideally, a centralized exchange is used to find partners, but this comes with privacy risks. Since participants in the exchange are competitors, they can use information about someone else's capacity to their disadvantage, e.g., by undercutting the prices of an already poorly performing competitor to drive it out of business. In this paper, we show that such an exchange can be set up without compromising the privacy of its participants. We formalize privacy goals in the context of resource sharing via an indistinguishability game. We also propose Bazaar, a protocol that allows participants to find suitable matches while satisfying our formal privacy goals.