Roland van Rijswijk-Deij
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Roland van Rijswijk-Deij has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
- Anna Sperotto
University of Twente, Enschede, Netherlands
5 shared publications - Mattijs Jonker
University of Twente, Enschede, Netherlands
5 shared publications - Jeroen van der Ham
University of Twente, Enschede, Netherlands
4 shared publications - Raffaele Sommese
University of Twente, Enschede, Netherlands
4 shared publications - Remi Hendriks
Department of Design and Analysis of Computer Systems, University of Twente, Enschede, The Netherlands
3 shared publications - Andrea Continella
University of Twente, Enschede, Netherlands
2 shared publications
Latest Publications
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 122-129
Beyond Smart Homes: Characterizing IoT Vulnerabilities Across Sectors, Vendors, and Products
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 122-129
Open AccessBeyond Smart Homes: Characterizing IoT Vulnerabilities Across Sectors, Vendors, and Products
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 31-38
Privacy Exposure through Reverse DNS for Private Households
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 31-38
Open AccessPrivacy Exposure through Reverse DNS for Private Households
- Open Access
- 2 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 311-312
Poster: Toward Post-Quantum EAP: Fallback and Fragmentation Risks in TLS-Based Authentication
- 2 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 311-312
Open AccessPoster: Toward Post-Quantum EAP: Fallback and Fragmentation Risks in TLS-Based Authentication
- Open Access
- 7 April 2026
- Published by Association for Computing Machinery (ACM) in Digital Threats: Research and Practice
- Vol. 7 (2) , 1-24
Your Disclosure Is Important to Us: An Analysis of Coordinated Vulnerability Disclosure Responses Using a Real Security Issue
Cybersecurity is increasingly in the crosshairs of policymakers, as evidenced by the introduction of far-reaching legal frameworks around the globe. One concrete example of cybersecurity policy is how to deal with vulnerability disclosures. Organisations increasingly introduce vulnerability disclosure policies, and in some cases, public sector bodies are even required by law to have such policies. In this work, we study the effects of these policies in practice. Using the process specified on an organisation’s web site, or absent such a process following community best practices, we disclose an e-mail vulnerability affecting a large number of organisations. This vulnerability allows arbitrary actors to send mail on behalf of affected organisations by abusing shared infrastructure. Our disclosure campaign focuses specifically on public and critical infrastructure organisations that are required by law to handle such disclosures. We find that having a policy makes it easier to contact organisations regarding security vulnerabilities. Nevertheless, even with a policy in place, over half of our reports remain unanswered and unresolved after 90 days. Based on our findings, we provide recommendations to policymakers and organisations how to better shape their vulnerability disclosure processes.
- 7 April 2026
- Published by Association for Computing Machinery (ACM) in Digital Threats: Research and Practice
- Vol. 7 (2) , 1-24
Open AccessYour Disclosure Is Important to Us: An Analysis of Coordinated Vulnerability Disclosure Responses Using a Real Security Issue
Cybersecurity is increasingly in the crosshairs of policymakers, as evidenced by the introduction of far-reaching legal frameworks around the globe. One concrete example of cybersecurity policy is how to deal with vulnerability disclosures. Organisations increasingly introduce vulnerability disclosure policies, and in some cases, public sector bodies are even required by law to have such policies. In this work, we study the effects of these policies in practice. Using the process specified on an organisation’s web site, or absent such a process following community best practices, we disclose an e-mail vulnerability affecting a large number of organisations. This vulnerability allows arbitrary actors to send mail on behalf of affected organisations by abusing shared infrastructure. Our disclosure campaign focuses specifically on public and critical infrastructure organisations that are required by law to handle such disclosures. We find that having a policy makes it easier to contact organisations regarding security vulnerabilities. Nevertheless, even with a policy in place, over half of our reports remain unanswered and unresolved after 90 days. Based on our findings, we provide recommendations to policymakers and organisations how to better shape their vulnerability disclosure processes.
- Open Access
- 18 February 2026
- Published by Springer Nature in Journal of Network and Systems Management
- Vol. 34 (2) , 54
RASH: Resource Allocation for Smart Homes Considering Privacy Sensitivity of IoT Applications
Smart home applications have increasingly adopted compute-intensive, machine-learning based techniques to improve their efficiency and prediction capabilities, e.g., for the comfort of the residents. While edge computing has been the preferred computing paradigm in smart homes due to the latency, data privacy, and resilience benefits, the limited computational and bandwidth resources of local edge devices, e.g., a home gateway, might hinder the timely completion of Internet-of-Things (IoT) tasks, necessitating computation offloading of some tasks to remote compute nodes. While ensuring timely completion of an application is essential in offloading decisions, offloading without consideration of data privacy poses privacy risks. To mitigate such consequences, this paper presents RASH, a resource allocation and offloading scheme that has three merits. First , different from prior studies, RASH assigns a privacy-sensitivity score to the tasks based on their data type and the location of the IoT devices to prioritize local execution of highly sensitive tasks when local resources are insufficient and offloading is inevitable. Second , to handle peak load scenarios, RASH incorporates a heuristic task postponement algorithm that effectively defers tasks to maintain the problem’s feasibility and maximize resource utilization. Third , RASH runs periodically, dynamically adjusting resource allocation based on real-time computational demands and newly arriving training and executing tasks with varying time budgets and computational needs. Our evaluation results show that RASH effectively prioritizes the local execution of privacy-sensitive tasks with more than 90% local resource utilization.
- 18 February 2026
- Published by Springer Nature in Journal of Network and Systems Management
- Vol. 34 (2) , 54
Open AccessRASH: Resource Allocation for Smart Homes Considering Privacy Sensitivity of IoT Applications
Smart home applications have increasingly adopted compute-intensive, machine-learning based techniques to improve their efficiency and prediction capabilities, e.g., for the comfort of the residents. While edge computing has been the preferred computing paradigm in smart homes due to the latency, data privacy, and resilience benefits, the limited computational and bandwidth resources of local edge devices, e.g., a home gateway, might hinder the timely completion of Internet-of-Things (IoT) tasks, necessitating computation offloading of some tasks to remote compute nodes. While ensuring timely completion of an application is essential in offloading decisions, offloading without consideration of data privacy poses privacy risks. To mitigate such consequences, this paper presents RASH, a resource allocation and offloading scheme that has three merits. First , different from prior studies, RASH assigns a privacy-sensitivity score to the tasks based on their data type and the location of the IoT devices to prioritize local execution of highly sensitive tasks when local resources are insufficient and offloading is inevitable. Second , to handle peak load scenarios, RASH incorporates a heuristic task postponement algorithm that effectively defers tasks to maintain the problem’s feasibility and maximize resource utilization. Third , RASH runs periodically, dynamically adjusting resource allocation based on real-time computational demands and newly arriving training and executing tasks with varying time budgets and computational needs. Our evaluation results show that RASH effectively prioritizes the local execution of privacy-sensitive tasks with more than 90% local resource utilization.
- 25 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 814-823
Load-Balancing Versus Anycast: A First Look at Operational Challenges
Load Balancing (LB) is a routing strategy that increases performance by distributing traffic over multiple outgoing paths. In this work, we introduce a novel methodology to detect the influence of LB on anycast routing, which can be used by operators to detect networks that experience anycast site flipping, where traffic from a single client reaches multiple anycast sites. We use our methodology to measure the effects of LB-behavior on anycast routing at a global scale, covering both IPv4 and IPv6. Our results show that LB-induced anycast site flipping is widespread. The results also show our method can detect LB implementations on the global Internet, including detection and classification of Points-of-Presence (PoP) and egress selection techniques deployed by hypergiants, cloud providers, and network operators. We observe LB-induced site flipping directs distinct flows to different anycast sites with significant latency inflation. In cases with two paths between an anycast instance and a load-balanced destination, we observe an average RTT difference of 30 ms with 8% of load-balanced destinations seeing RTT differences of over 100 ms. Being able to detect these cases can help anycast operators significantly improve their service for affected clients.
- 25 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 814-823
Load-Balancing Versus Anycast: A First Look at Operational Challenges
Load Balancing (LB) is a routing strategy that increases performance by distributing traffic over multiple outgoing paths. In this work, we introduce a novel methodology to detect the influence of LB on anycast routing, which can be used by operators to detect networks that experience anycast site flipping, where traffic from a single client reaches multiple anycast sites. We use our methodology to measure the effects of LB-behavior on anycast routing at a global scale, covering both IPv4 and IPv6. Our results show that LB-induced anycast site flipping is widespread. The results also show our method can detect LB implementations on the global Internet, including detection and classification of Points-of-Presence (PoP) and egress selection techniques deployed by hypergiants, cloud providers, and network operators. We observe LB-induced site flipping directs distinct flows to different anycast sites with significant latency inflation. In cases with two paths between an anycast instance and a load-balanced destination, we observe an average RTT difference of 30 ms with 8% of load-balanced destinations seeing RTT differences of over 100 ms. Being able to detect these cases can help anycast operators significantly improve their service for affected clients.
- Open Access
- 28 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 445-461
LACeS: An Open, Fast, Responsible and Efficient Longitudinal Anycast Census System
- 28 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 445-461
Open AccessLACeS: An Open, Fast, Responsible and Efficient Longitudinal Anycast Census System
- Open Access
- 22 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 143-149
PQC for DNSSEC: a format size analysis on Falcon signatures
- 22 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 143-149
Open AccessPQC for DNSSEC: a format size analysis on Falcon signatures
- Open Access
- 22 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 99-105
Locating and Enumerating Anycast: a Comparison of Two Approaches
- 22 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 99-105
Open AccessLocating and Enumerating Anycast: a Comparison of Two Approaches
- 7 March 2025
- Published by Springer Nature
- p. 389-401
An Empirical Evaluation of Longitudinal Anycast Catchment Stability
- 7 March 2025
- Published by Springer Nature
- p. 389-401
An Empirical Evaluation of Longitudinal Anycast Catchment Stability