Edgars Celms
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Edgars Celms has a total of 189 co-authors. Here are the top co-authors by number of shared publications:
- Juris Viksna
University of Latvia
52 shared publications - Alvis Brazma
European Molecular Biology Laboratory
42 shared publications - Antonin Brisuda
University Hospital Motol, V Úvalu 84, 150 06 Prague, Czech Republic
40 shared publications - Behnoush Abedi-Ardekani
Genomic Epidemiology Branch, International Agency for Research on Cancer (IARC/WHO), Lyon, France
40 shared publications - Dana Mates
National Institute of Public Health Environmental Health Department Bucharest
40 shared publications - Ivana Holcatova
Institute of Hygiene & Epidemiology, 1st Faculty of Medicine, Charles University, Prague, Czech Republic
40 shared publications
Latest Publications
- 4 August 2026
- Published by Springer Nature
- p. 135-153
Topological Patterns of 3-Cliques in Chromatin Interaction Networks
- 4 August 2026
- Published by Springer Nature
- p. 135-153
Topological Patterns of 3-Cliques in Chromatin Interaction Networks
- Open Access
Topology-Oblivious Random-Walk Key Relaying in Quantum Key Distribution Networks
Quantum key distribution (QKD) networks require relaying when distant key management entities share no direct quantum link. Most relay strategies, however, rely on centralized control or globally maintained routing state. This paper asks whether useful security and efficiency can still be obtained with topology-oblivious stochastic forwarding. It studies the security-overhead trade-off in a model in which fragmented key material is relayed via random-walk variants and reconstructed under privacy amplification. The analysis asks whether strictly local forwarding can retain useful information-theoretic security (ITS). Evaluation on the GÉANT topology, representing a European academic backbone network, shows clear differences between random-walk variants. The proposed highest-score-neighbor local path-diversification heuristic reduces the probability that relayed key material passes through a compromised node. The evaluation also shows that scouting-based loop erasure significantly shortens sampled routes and improves throughput in the model. Against one- to three-node cartels, random flow protects slightly more source–target pairs than a static disjoint-multipath method on the evaluated topologies. These findings position topology-oblivious stochastic forwarding as a simpler decentralized design for QKD relaying without centralized orchestration or gossip protocols.
Open AccessTopology-Oblivious Random-Walk Key Relaying in Quantum Key Distribution Networks
Quantum key distribution (QKD) networks require relaying when distant key management entities share no direct quantum link. Most relay strategies, however, rely on centralized control or globally maintained routing state. This paper asks whether useful security and efficiency can still be obtained with topology-oblivious stochastic forwarding. It studies the security-overhead trade-off in a model in which fragmented key material is relayed via random-walk variants and reconstructed under privacy amplification. The analysis asks whether strictly local forwarding can retain useful information-theoretic security (ITS). Evaluation on the GÉANT topology, representing a European academic backbone network, shows clear differences between random-walk variants. The proposed highest-score-neighbor local path-diversification heuristic reduces the probability that relayed key material passes through a compromised node. The evaluation also shows that scouting-based loop erasure significantly shortens sampled routes and improves throughput in the model. Against one- to three-node cartels, random flow protects slightly more source–target pairs than a static disjoint-multipath method on the evaluated topologies. These findings position topology-oblivious stochastic forwarding as a simpler decentralized design for QKD relaying without centralized orchestration or gossip protocols.
- Open Access
- 27 April 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Privacy and Security
- Vol. 29 (2) , 1-18
Integrating Remote Quantum Random Number Generator as a Shared Resource into GNU/Linux via D-Bus
The random number generation capabilities of the GNU/Linux operating system are subject to certain limitations. As of Linux version 5.6, /dev/random operates in a non-blocking manner and, as such, no longer satisfies the criteria for a True Random Number Generator (TRNG). While dedicated quantum random number generator (QRNG) hardware is the preferred source of unpredictable entropy, it is often expensive and difficult to deploy in virtualized/cloud environments and Internet of Things (IoT) devices. Furthermore, hardware RNG integration typically requires cryptographic applications to adhere to vendor-specific APIs. This article proposes a user-space integration approach for a shared , potentially remote QRNG device. We develop a QRNG service on top of D-Bus, a ubiquitous inter-process communication framework. It serves as an interface for applications to retrieve true random numbers. Communication with the remote QRNG device occurs over mutually authenticated TLS 1.3 channels, protected by post-quantum cryptography (PQC) algorithms. We show, as a proof-of-concept, how the proposed D-Bus service can be integrated into the OpenSSL 3 cryptographic library, demonstrating the use of TRNG in a wide range of Linux applications. Our approach is resistant to entropy starvation attacks, supports sharing a QRNG across host and virtualized environments, requires no kernel-level or system-wide modifications, supports mixing multiple sources of entropy, and configuration of post-processing. It provides applications with a TRNG interface suitable for information-theoretically secure (ITS) use cases.
- 27 April 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Privacy and Security
- Vol. 29 (2) , 1-18
Open AccessIntegrating Remote Quantum Random Number Generator as a Shared Resource into GNU/Linux via D-Bus
The random number generation capabilities of the GNU/Linux operating system are subject to certain limitations. As of Linux version 5.6, /dev/random operates in a non-blocking manner and, as such, no longer satisfies the criteria for a True Random Number Generator (TRNG). While dedicated quantum random number generator (QRNG) hardware is the preferred source of unpredictable entropy, it is often expensive and difficult to deploy in virtualized/cloud environments and Internet of Things (IoT) devices. Furthermore, hardware RNG integration typically requires cryptographic applications to adhere to vendor-specific APIs. This article proposes a user-space integration approach for a shared , potentially remote QRNG device. We develop a QRNG service on top of D-Bus, a ubiquitous inter-process communication framework. It serves as an interface for applications to retrieve true random numbers. Communication with the remote QRNG device occurs over mutually authenticated TLS 1.3 channels, protected by post-quantum cryptography (PQC) algorithms. We show, as a proof-of-concept, how the proposed D-Bus service can be integrated into the OpenSSL 3 cryptographic library, demonstrating the use of TRNG in a wide range of Linux applications. Our approach is resistant to entropy starvation attacks, supports sharing a QRNG across host and virtualized environments, requires no kernel-level or system-wide modifications, supports mixing multiple sources of entropy, and configuration of post-processing. It provides applications with a TRNG interface suitable for information-theoretically secure (ITS) use cases.
- Open Access
- 8 April 2026
- Published by MDPI AG in Preprints.org
Topology-Oblivious Random-Walk Key Relaying in Quantum Key Distribution Networks
Quantum key distribution (QKD) networks require relaying when distant key management entities share no direct quantum link. Most relay strategies, however, rely on centralized control or globally maintained routing state. This paper asks whether useful security and efficiency can still be obtained with topology-oblivious stochastic forwarding. It studies the security-overhead trade-off in a model in which fragmented key material is relayed via random-walk variants and reconstructed under privacy amplification. Under a restricted model with at most one compromised relay, the analysis asks whether strictly local forwarding can retain useful information-theoretic security. Evaluation on the GÉANT topology, representing a European academic backbone network, shows clear differences between random-walk variants. The proposed highest-score-neighbor local path-diversification heuristic reduces the risk that relayed key material passes through a compromised node. The evaluation also shows that a preliminary loop-erasure step significantly shortens sampled routes and improves throughput in the model. These findings position topology-oblivious stochastic forwarding as a decentralized alternative to global-state maintenance or centralized orchestration in QKD networks.
- 8 April 2026
- Published by MDPI AG in Preprints.org
Open AccessTopology-Oblivious Random-Walk Key Relaying in Quantum Key Distribution Networks
Quantum key distribution (QKD) networks require relaying when distant key management entities share no direct quantum link. Most relay strategies, however, rely on centralized control or globally maintained routing state. This paper asks whether useful security and efficiency can still be obtained with topology-oblivious stochastic forwarding. It studies the security-overhead trade-off in a model in which fragmented key material is relayed via random-walk variants and reconstructed under privacy amplification. Under a restricted model with at most one compromised relay, the analysis asks whether strictly local forwarding can retain useful information-theoretic security. Evaluation on the GÉANT topology, representing a European academic backbone network, shows clear differences between random-walk variants. The proposed highest-score-neighbor local path-diversification heuristic reduces the risk that relayed key material passes through a compromised node. The evaluation also shows that a preliminary loop-erasure step significantly shortens sampled routes and improves throughput in the model. These findings position topology-oblivious stochastic forwarding as a decentralized alternative to global-state maintenance or centralized orchestration in QKD networks.
- Open Access
- 25 November 2025
- Published by American Association for Cancer Research (AACR)
Supplementary Table S1 from Application of Genomic Sequencing to Refine Patient Stratification for Adjuvant Therapy in Renal Cell Carcinoma
Clinical information and 12 gene mutation status for cohorts C1-C3
- 25 November 2025
- Published by American Association for Cancer Research (AACR)
Open AccessSupplementary Table S1 from Application of Genomic Sequencing to Refine Patient Stratification for Adjuvant Therapy in Renal Cell Carcinoma
Clinical information and 12 gene mutation status for cohorts C1-C3
- Open Access
- 25 November 2025
- Published by American Association for Cancer Research (AACR)
Supplementary Table S2 from Application of Genomic Sequencing to Refine Patient Stratification for Adjuvant Therapy in Renal Cell Carcinoma
Somatic mutations detected in 12 interrogated genes for cohorts C1-C3
- 25 November 2025
- Published by American Association for Cancer Research (AACR)
Open AccessSupplementary Table S2 from Application of Genomic Sequencing to Refine Patient Stratification for Adjuvant Therapy in Renal Cell Carcinoma
Somatic mutations detected in 12 interrogated genes for cohorts C1-C3
- Open Access
- 25 November 2025
- Published by American Association for Cancer Research (AACR)
Figure S3 from Application of Genomic Sequencing to Refine Patient Stratification for Adjuvant Therapy in Renal Cell Carcinoma
DFS by tumor stage stratified by genomic classifier
- 25 November 2025
- Published by American Association for Cancer Research (AACR)
Open AccessFigure S3 from Application of Genomic Sequencing to Refine Patient Stratification for Adjuvant Therapy in Renal Cell Carcinoma
DFS by tumor stage stratified by genomic classifier
- Open Access
- 25 November 2025
- Published by American Association for Cancer Research (AACR)
Figure S2 from Application of Genomic Sequencing to Refine Patient Stratification for Adjuvant Therapy in Renal Cell Carcinoma
DFS amongst Leibovich risk groups stratified by genomic classifier
- 25 November 2025
- Published by American Association for Cancer Research (AACR)
Open AccessFigure S2 from Application of Genomic Sequencing to Refine Patient Stratification for Adjuvant Therapy in Renal Cell Carcinoma
DFS amongst Leibovich risk groups stratified by genomic classifier