DRDaniël Reijsbergen

Daniël Reijsbergen

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Daniël Reijsbergen has a total of 23 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • BlowLive: Blow-Based Multi-Factor Biometrics with Liveness Detection and Revocability

    by Eyasu Getahun Chekole, Howard Halim, Daniël Reijsbergen, Jianying Zhou

  • Open Access

    Dynamics of Ethereum’s EIP-1559 Transaction Fee Mechanism

    by Stefanos Leonardos, Daniël Reijsbergen, Barnabé Monnot, Georgios Piliouras

    Transaction fee mechanisms are pivotal elements of blockchain economies, as they resolve the inherent scarcity in the number of transactions that can be added to each block. First-price auction mechanisms implemented by early blockchain protocols, however, contributed to pronounced intra-block disparities, unpredictable waiting times, high congestion, and other inefficiencies. To mitigate these effects, alternative fee market mechanism has been proposed, e.g., Ethereum’s EIP-1559. In this article, we investigate the ramifications of EIP-1559 on system performance and user experience. Although we prove that EIP-1559 exhibits chaotic behavior even under optimal conditions, we demonstrate that the influence of this chaotic behavior on the primary design objective of the fee mechanism—blocks whose long-term average size equals the target—is limited. Our theoretical bound shows that block sizes in the EIP-1559 mechanism are lower bounded by target utilization—half-full blocks—and the upper bound is capped at 6% beyond the target. These findings are confirmed by an empirical evaluation that shows that the average discrepancy has been 2.9% under Proof-of-Work and decreases to around 1% or less following Ethereum’s transition to Proof-of-Stake. However, the chaotic oscillations in block sizes and the slow adjustments during periods of demand bursts (e.g., NFT drops) result in undesirable inter-block variations in mining rewards and compromise the overall user experience. To address these issues, we propose an alternative base fee adjustment rule, characterized by a learning rate that adapts according to an additive increase, multiplicative decrease (AIMD) update scheme. Our data-driven simulations show that the latter robustly outperforms the EIP-1559 protocol across various demand scenarios.


  • BlowPrint: Blow-Based Multi-factor Biometrics for Smartphone User Authentication

    by Howard Halim, Eyasu Getahun Chekole, Daniël Reijsbergen, Jianying Zhou


  • Open Access

    BlowPrint: Blow-Based Multi-Factor Biometrics for Smartphone User Authentication

    by Howard Halim, Eyasu Getahun Chekole, Daniël Reijsbergen, Jianying Zhou

    Biometric authentication is a widely used security mechanism that leverages unique physiological or behavioral characteristics to authenticate users. In multi-factor biometrics (MFB), multiple biometric modalities, e.g., physiological and behavioral, are integrated to mitigate the limitations inherent in single-factor biometrics. The main challenge in MFB lies in identifying novel behavioral techniques capable of meeting critical criteria, including high accuracy, high usability, non-invasiveness, resilience against spoofing attacks, and low use of computational resources. Despite ongoing advancements, current behavioral biometric techniques often fall short of fulfilling one or more of these requirements. In this work, we propose BlowPrint, a novel behavioral biometric technique that allows us to authenticate users based on their phone blowing behaviors. In brief, we assume that the way users blow on a phone screen can produce distinctive acoustic patterns, which can serve as a unique biometric identifier for effective user authentication. It can also be seamlessly integrated with physiological techniques, such as facial recognition, to enhance its robustness and security. To assess BlowPrint's effectiveness, we conduct an empirical study involving 50 participants from whom we collect blow-acoustic and facial feature data. Subsequently, we compute the similarity scores of the two modalities using various similarity algorithms and combine them through score-level fusion. Finally, we compute the accuracy using a machine learning-based classifier. As a result, the proposed method demonstrates an accuracy of 99.35% for blow acoustics, 99.96% for facial recognition, and 99.82% for the combined approach. The experimental results demonstrate BlowPrint's high effectiveness in terms of authentication accuracy, spoofing attack resilience, usability, non-invasiveness, and other aspects.

  • Open Access

    ZK-SERIES: Privacy-Preserving Authentication using Temporal Biometric Data

    by Daniel Reijsbergen, Eyasu Getahun Chekole, Howard Halim, Jianying Zhou

    Biometric authentication relies on physiological or behavioral traits that are inherent to a user, making them difficult to lose, forge or forget. Biometric data with a temporal component enable the following authentication protocol: recent readings of the underlying biometrics are encoded as time series and compared to a set of base readings. If the distance between the new readings and the base readings falls within an acceptable threshold, then the user is successfully authenticated. Various methods exist for comparing time series data, such as Dynamic Time Warping (DTW) and the Time Warp Edit Distance (TWED), each offering advantages and drawbacks depending on the context. Moreover, many of these techniques do not inherently preserve privacy, which is a critical consideration in biometric authentication due to the complexity of resetting biometric credentials. In this work, we propose ZK-SERIES to provide privacy and efficiency to a broad spectrum of time series-based authentication protocols. ZK-SERIES uses the same building blocks, i.e., zero-knowledge multiplication proofs and efficiently batched range proofs, to ensure consistency across all protocols. Furthermore, it is optimized for compatibility with low-capacity devices such as smartphones. To assess the effectiveness of our proposed technique, we primarily focus on two case studies for biometric authentication: shake-based and blow-based authentication. To demonstrate ZK-SERIES's practical applicability even in older and less powerful smartphones, we conduct experiments on a 5-year-old low-spec smartphone using real data for two case studies alongside scalability assessments using artificial data. Our experimental results indicate that the privacy-preserving authentication protocol can be completed within 1.3 seconds on older devices.

  • Collateral Portfolio Optimization in Crypto-Backed Stablecoins

    by Bretislav Hajek, Daniël Reijsbergen, Anwitaman Datta, Jussi Keppo


  • Open Access

    CroCoDai : A Stablecoin for Cross-Chain Commerce

    by Daniël Reijsbergen, Bretislav Hajek, Tien Tuan Anh Dinh, Jussi Keppo, Henry F. Korth, Anwitaman Datta

    Decentralized Finance (DeFi), in which digital assets are exchanged without trusted intermediaries, has grown rapidly in value in recent years. Stablecoins , which are pegged to a non-volatile asset such as the US dollar, are a prominent feature of DeFi as they mitigate the risk associated with price fluctuations. However, existing stablecoin systems are tied to individual blockchain platforms, and trusted parties or complex protocols are needed to exchange stablecoin tokens between blockchains. Our goal is to design a practical stablecoin system for cross-chain commerce, and to do so we must overcome two main challenges. The first is to support a large and growing number of blockchains efficiently. The second is for the stablecoin to be resilient to blockchain platform failures and to price fluctuations that affect its collateral. We present CroCoDai to address these challenges. We demonstrate CroCoDai 's efficiency by comparing the performance of a prototype implementation to related baselines, and its resilience through an empirical analysis of historical token price data.


  • Open Access

    BlockChain I/O: Enabling Cross-Chain Commerce

    by Anwitaman Datta, Daniël Reijsbergen, Jingchi Zhang, Suman Majumder

    Blockchain technology enables secure tokens transfers in digital marketplaces, and recent advances in this field provide other desirable properties such as efficiency, privacy, and price stability. However, these properties do not always generalize to a setting across multiple independent blockchains. Despite the growing number of existing blockchain platforms, there is a lack of an overarching framework whose components provide all of the necessary properties for practical cross-chain commerce. We present BlockChain I/O to provide such a framework. BlockChain I/O introduces entities called cross-chain services to relay information between different blockchains. The proposed design ensures that cross-chain services cannot violate transaction safety, and they are furthermore disincentivized from other types of misbehavior through an audit system. BlockChain I/O uses native stablecoins to mitigate price fluctuations, and a decentralized ID system to allow users to prove aspects of their identity without violating privacy. After presenting the core architecture of BlockChain I/O, we demonstrate how to use it to implement a cross-chain marketplace and discuss how its desirable properties continue to hold in the end-to-end system. Finally, we use experimental evaluations to demonstrate BlockChain I/O’s practical performance.


  • Optimality Despite Chaos in Fee Markets

    by Stefanos Leonardos, Daniël Reijsbergen, Barnabé Monnot, Georgios Piliouras


  • Demo: PIEChain - A Practical Blockchain Interoperability Framework

    by Daniël Reijsbergen, Aung Maw, Jingchi Zhang, Tien Tuan Anh Dinh, Anwitaman Datta

    A plethora of different blockchain platforms have emerged in recent years, but many of them operate in silos. As such, there is a need for reliable cross-chain communication to enable blockchain interoperability. Blockchain interoperability is challenging because transactions can typically not be reverted – as such, if one transaction is committed then the protocol must ensure that all related transactions are committed as well. Existing interoperability approaches, e.g., Cosmos and Polkadot, are limited in the sense that they only support interoperability between their own subchains, or require intrusive changes to existing blockchains. To overcome this limitation, we propose PIEChain, a general, Kafka-based cross-chain communication framework. We utilize PIEChain for a practical case study: a cross-chain auction in which users who hold tokens on multiple chains bid for a ticket sold on another chain. PIEChain is the first publicly available, practical implementation of a general framework for cross-chain communication.