• Prof. Dr.

KEVIN BORGOLTE

  • Software Security

Ruhr University Bochum
Faculty of Computer Science
Software Security
Universitätsstr. 150
44801 Bochum

Room:  MC 4.124

Tel:      +49 (0)234 32-27779

E-Mail: kevin.borgolte@rub.de

Office hours: By Arrangement

Table of Contents

Curriculum Vitae

Since May 2021, I am a professor for Software Security in the Computer Science department at Ruhr University Bochum (RUB). Prior to joining RUB, I was a professor at TU Delft and a postdoctoral researcher at Princeton University. I received my PhD from the University of California, Santa Barbara in September 2018.

My research focuses on software and Internet security, including vulnerability discovery and mitigation, as well as how software is being deployed and used, and how it affects security on the Internet. That is, I work on improving the security and privacy of networked software systems. I also work on identifying and preventing large-scale Internet abuse, discovering and defending against new attacks (such as on network applications or enabled by network and protocol interactions), and developing techniques to conduct security-relevant measurements (like enabling Internet-wide measurements for IPv6; or, investigating how new security features affect the Internet). Sometimes, I dabble in related topics, like understanding security misconfigurations, or governance and policy.

Publications

2023

[1]
P. Detzner, M. Ten Hompel, und S. Bondorf, „Beitrag zur Selbstorganisation in der Intralogistik“, Universitätsbibliothek Dortmund, Dortmund, 2023. doi: 10.17877/de290r-23292.
[2]
P. Laskowski, P. Detzner, und S. Bondorf, „Tree-structured overlays with minimal height: construction, maintenance and operation“, in Proceedings of the 17th ACM International Conference on Distributed and Event-based Systems, Neuchâtel, Juni 2023, S. 168–176. doi: 10.1145/3583678.3596894.
[1]
P. Detzner, J. Godeke, und S. Bondorf, „Peer discovery in tree-structured P2P overlay networks by means of connected dominating sets“, in 2022 IEEE 47th Conference on Local Computer Networks (LCN), Edmonton; online, Aug. 2022, S. 447–454. doi: 10.1109/lcn53696.2022.9843678.
 
[1]
F. Geyer, A. Scheffler, und S. Bondorf, „Tightening network calculus delay bounds by predicting flow prolongations in the FIFO analysis“, in 2021 IEEE 27th Real-time and embedded technology and applications symposium (RTAS), Juli 2021, S. 157–170. doi: 10.1109/rtas52030.2021.00021.
[2]
P. Detzner, J. Godeke, und S. Bondorf, „Low-cost search in tree-structured P2P overlays: the null-balance benefit“, in 2021 IEEE 46th Conference on Local Computer Networks (LCN), Sep. 2021, S. 620. doi: 10.1109/lcn52139.2021.9525004.
[3]
A. Scheffler und S. Bondorf, „Network calculus for bounding delays in feedforward networks of FIFO queueing systems“, in Quantitative Evaluation of Systems [ISBN: 9783030851712], Paris, Aug. 2021, Publiziert. doi: 10.1007/978-3-030-85172-9_8.
[1]
F. Geyer und S. Bondorf, „Graph-based deep learning for fast and tight network calculus analyses“, IEEE transactions on network science and engineering, Bd. 2020, S. 1–13, Sep. 2020, doi: 10.1109/tnse.2020.3025806.
[2]
S. Bondorf, B. Chen, J. Scarlett, H. Yu, und Y. Zhao, „Sublinear-time non-adaptive group testing with O(klogn) tests via bit-mixing coding“, Jan. 2020. [Online]. Verfügbar unter: https://arxiv.org/pdf/1904.10102.pdf
[3]
B. Cattelan, S. Bondorf, und A. E. Schaeffer-Filho, „An empirical study of tightest network calculus analyses for networks with multicast flows“, in The 44th IEEE conference on computers, software, and applications (COMPSAC 2020), Madrid, 2020, Publiziert. [Online]. Verfügbar unter: https://disco.cs.uni-kl.de/bibtexbrowser/?key=CBS20-1&bib=/var/www/html/discofiles/publicationsfiles/publications.disco.bib
[4]
S. Bondorf und F. Geyer, „Virtual cross-flow detouring in the deterministic network calculus analysis“, in IFIP Networking 2020, Paris, 2020, S. 554–558. [Online]. Verfügbar unter: https://ieeexplore.ieee.org/document/9142694
[5]
F. Geyer und S. Bondorf, „On the robustness of deep learning-predicted contention models for network calculus“, in 25th IEEE Symposium on computers and communications (ISCC 2020), Rennes, 2020, Publiziert. [Online]. Verfügbar unter: https://arxiv.org/pdf/1911.10522.pdf
[6]
B. Cattelan und S. Bondorf, „On delay bounds and measurements: a COTS testbed for network performance experimentation“, in ADMENT 2020, 2020, Publiziert. [Online]. Verfügbar unter: https://disco.cs.uni-kl.de/bibtexbrowser/?key=GB20-1&bib=/var/www/html/discofiles/publicationsfiles/publications.disco.bib
[7]
S. Bondorf, F. Geyer, und S. Bondorf, „Virtual Cross-Flow Detouring in the Deterministic Network Calculus Analysis“, in IFIP Networking 2020 Conference and Workshops, Networking 2020, 2020, Publiziert. [Online]. Verfügbar unter: http://www.scopus.com/inward/record.url?eid=2-s2.0-85090053165&partnerID=MN8TOARS
 
[1]
S. Bondorf und F. Geyer, „Deterministic network calculus analysis of multicast flows“, in Systems modeling, A. Puliafito und K. S. Trivedi, Hrsg. Cham: Springer, 2019, S. 63–78. doi: 10.1007/978-3-319-92378-9_5.
[2]
S. Bondorf, B. Chen, J. Scarlett, H. Yu, und Y. Zhao, „Cross-sender bit-mixing coding“, in IPSN 2019, Montreal, 2019, S. 205–216. [Online]. Verfügbar unter: https://ieeexplore.ieee.org/abstract/document/8732507
[3]
F. Geyer und S. Bondorf, „DeepTMA: predicting effective contention models for network calculus using graph neural networks“, in IEEE INFOCOM 2019 – IEEE Conference on Computer Communications (INFOCOM WKSHPS 2019), Paris, 2019, S. 1009–1017. doi: 10.1109/infocom.2019.8737496.
[4]
S. Bondorf, B. Chen, J. Scarlett, H. Yu, Y. Zhao, und S. Bondorf, „Cross-sender bit-mixing coding“, in Proceedings of the 18th International Conference on Information Processing in Sensor Networks, Apr. 2019, Publiziert. doi: 10.1145/3302506.3310401.
 
[1]
A. Scheffler, M. Fögen, und S. Bondorf, „The deterministic network calculus analysis: reliability insights and performance improvements“, in 2018 IEEE 23rd International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), Barcelona, 2018, S. 235–240. doi: 10.1109/camad.2018.8514938.
[2]
A. Scheffler, S. Bondorf, und J. B. Schmitt, „Demo abstract: Worst-case performance analysis with the disco deterministic network calculator“, 2018. [Online]. Verfügbar unter: https://pdfs.semanticscholar.org/ecb4/e8f8b7a68bcbe2d93e093b52df99b1b9073b.pdf
[3]
S. Bondorf, P. Nikolaus, und J. B. Schmitt, „Catching corner cases in network calculus – flow segregation can improve accuracy“, in Measurement, modelling, and evaluation of computing systems, Erlangen, 2018, Bd. 10740, S. 218–233. doi: 10.1007/978-3-319-74947-1_15.
[1]
P. Schon und S. Bondorf, „Towards unified tool support for real-time calculus & deterministic network calculus“, Juni 2017. [Online]. Verfügbar unter: https://www.ecrts.org/archives/fileadmin/files_ecrts17/Proceedings_ECRTS-WiP2017.pdf#page=16
[2]
S. Bondorf, P. Nikolaus, und J. B. Schmitt, „Quality and cost of deterministic network calculus: design and evaluation of an accurate and fast analysis“, Proceedings of the ACM on measurement and analysis of computing systems / Association for Computing Machinery, Bd. 1, Nr. 1, Art. Nr. 16, Juni 2017, doi: 10.1145/3084453.
[3]
S. Bondorf, „Better bounds by worse assumptions: improving network calculus accuracy by adding pessimism to the network model“, in 2017 IEEE International Conference on Communications (ICC), Paris, 2017, Publiziert. doi: 10.1109/icc.2017.7996996.
[4]
B. Cattelan und S. Bondorf, „Iterative design space exploration for networks requiring performance guarantees“, in 36th DASC, St. Petersburg, Fla., 2017, Publiziert. doi: 10.1109/dasc.2017.8102106.
[5]
K. Lampka, S. Bondorf, J. B. Schmitt, N. Guan, und W. Yi, „Generalized finitary real-time calculus“, in IEEE INFOCOM 2017 – IEEE Conference on Computer Communications, Atlanta, Ga., 2017, Publiziert. doi: 10.1109/infocom.2017.8056981.
[6]
J. B. Schmitt, S. Bondorf, und W. Y. Poe, „The sensor network calculus as key to the design of wireless sensor networks with predictable performance“, Journal of sensor and actuator networks, Bd. 6, Nr. 3, Art. Nr. 21, 2017, doi: 10.3390/jsan6030021.
[7]
S. Bondorf, „Quality and cost of deterministic network calculus: design and evaluation of an accurate and fast analysis“, SIGMETRICS’17 abstracts. ACM Pr., New York, NY, S. 65, 2017. doi: 10.1145/3078505.3078594.
[8]
M. Schütze, S. Bondorf, und M. Kreider, „Verification of the FAIR control system using deterministic network calculus“, in ICALEPCS2017, Barcelona, 2017, S. 238–244. doi: 10.18429/jacow-icalepcs2017-tucpl06.
[1]
S. Bondorf und J. Schmitt, „Worst-case performance analysis of feed-forward networks – an efficient and accurate network calculus“, Technische Universität Kaiserslautern, Kaiserslautern, 2016. [Online]. Verfügbar unter: https://kluedo.ub.uni-kl.de/frontdoor/deliver/index/docId/4432/file/Thesis_SteffenBondorf_kluedo.pdf
[2]
S. Bondorf und F. Geyer, „Generalizing network calculus analysis to derive performance guarantees for multicast flows“, in 10th EAI International Conference on Performance Evaluation Methodologies and Tools (ValueTools 2016), Taormina, 2016, S. 2–9. doi: 10.4108/eai.25-10-2016.2266598.
[3]
K. Lampka, S. Bondorf, und J. B. Schmitt, „Achieving efficiency without sacrificing model accuracy: network calculus on compact domains“, in 2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, London, 2016, S. 313–318. doi: 10.1109/mascots.2016.9.
[4]
S. Bondorf und J. B. Schmitt, „Improving cross-traffic bounds in feed-forward networks: there is a job for everyone“, in Measurement, modelling and evaluation of dependable computer and communication systems, Münster, 2016, Bd. 9629, S. 9–24. doi: 10.1007/978-3-319-31559-1_3.
[5]
S. Bondorf und J. B. Schmitt, „Should network calculus relocate?: an assessment of current algebraic and optimization-based analyses“, in Quantitative Evaluation of Systems, Quebec City, 2016, Bd. 9826, S. 207–223. doi: 10.1007/978-3-319-43425-4_15.
[1]
S. Bondorf und J. B. Schmitt, „Calculating accurate end-to-end delay bounds – you better know your cross-traffic“, in Proceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools, Berlin, 2015, Publiziert. doi: 10.4108/eai.14-12-2015.2262565.
[2]
S. Bondorf und J. B. Schmitt, „Boosting sensor network calculus by thoroughly bounding cross-traffic“, in 2015 IEEE Conference on Computer Communications (INFOCOM 2015), Hong Kong, 2015, S. 235–243. doi: 10.1109/infocom.2015.7218387.
[3]
S. Bondorf und J. B. Schmitt, „The DiscoDNC v2 – a comprehensive tool for deterministic network calculus“, in 8th International ICST Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2014), Bratislava, 2015, S. 44–49. doi: 10.4108/icst.valuetools.2014.258167.
[1]
S. Bondorf, „Using network calculus to model energy harvesting wireless sensor networks“. 2012. [Online]. Verfügbar unter: https://disco.cs.uni-kl.de/discofiles/publicationsfiles/B12.pdf
[1]
J. B. Schmitt, N. Gollan, S. Bondorf, und I. Martinovic, „Pay bursts only once holds for (some) non-FIFO systems“, in Proceedings / IEEE INFOCOM, 2011 : 10 – 15 April 2011, Shanghai, P.R. China, Shanghai, 2011, S. 1970–1978. doi: 10.1109/infcom.2011.5935002.
[1]
S. Bondorf und J. B. Schmitt, „Statistical response time bounds in randomly deployed wireless sensor networks“, in 2010 IEEE 35th Conference on Local Computer Networks (LCN 2010), Denver, Colo., 2010, S. 340–343. doi: 10.1109/lcn.2010.5735738.

Publications

26 Einträge « ‹ 2 von 3 › »

Elena Kirshanova, Alexander May

Breaking Goppa-based McEliece with hints Proceedings Article

In: Security and Cryptography for Networks (SCN 22), and Journal of Information and Computation, Volume 293, 2023.

Links | Schlagwörter: Crypto Others

Jesús-Javier Chi-Dominguez, Andre Esser, Sabrina Kunzweiler, Alexander May

Low Memory Attacks on Small Key CSIDH Proceedings Article

In: Applied Cryptography and Network Security (ACNS 23), S. 276–304, Springer, 2023.

Links | Schlagwörter: Crypto Others

Elena Kirshanova, Alexander May, Julian Nowakowski

New NTRU Records with Improved Lattice Bases Proceedings Article

In: Post-Quantum Cryptography (PQCrypto 23), S. 167–195, Springer, 2023.

Links | Schlagwörter: Crypto Others

Alexander May, Carl Richard Theodor Schneider

Dlog is Practically as Hard (or Easy) as DH - Solving Dlogs via DH Oracles on EC Standards Proceedings Article

In: Transactions on Cryptographic Hardware and Embedded Systems (TCHES), S. 146–166, 2023.

Links | Schlagwörter: Crypto Area, Rank A*/A

Andre Esser, Alexander May, Javier A. Verbel, Weiqiang Wen

Partial Key Exposure Attacks on BIKE, Rainbow and NTRU Proceedings Article

In: Advances in Cryptology (CRYPTO 2022) , S. 346–375, Springer, 2022.

Links | Schlagwörter: Crypto Flagship, Rank A*/A

Alexander May, Julian Nowakowski, Santanu Sarkar

Approximate Divisor Multiples - Factoring with Only a Third of the Secret CRT-Exponents Proceedings Article

In: Advances in Cryptology (EUROCRYPT 22) , S. 147–167, Springer, 2022.

Links | Schlagwörter: Crypto Flagship, Rank A*/A

Andre Esser, Alexander May, Floyd Zweydinger

McEliece Needs a Break - Solving McEliece-1284 and Quasi-Cyclic-2918 with Modern ISD Proceedings Article

In: Advances in Cryptology (EUROCRYPT 22), S. 433–457, Springer, 2022.

Links | Schlagwörter: Crypto Flagship, Rank A*/A

Julian Speith, Florian Schweins, Maik Ender, Marc Fyrbiak, Alexander May, Christof Paar

How Not to Protect Your IP - An Industry-Wide Break of IEEE 1735 Implementations Proceedings Article

In: Symposium on Security and Privacy (S&P 22), 2022.

Links | Schlagwörter: Rank A*/A, Security

Alexander May, Floyd Zweydinger

Legendre PRF (Multiple) Key Attacks and the Power of Preprocessing Proceedings Article

In: Computer Security Foundations Symposium (CSF 22), S. 428–438, IEEE, 2022.

Links | Schlagwörter: Rank A*/A, Security

Alexander May, Lars Schlieper

Quantum Period Finding is Compression Robust Proceedings Article

In: Transactions on Symmetric Cryptology (TOSC 22), S. 183–211, 2022.

Links | Schlagwörter: Crypto Area, Quantum

26 Einträge « ‹ 2 von 3 › »

Memberships

  • BITSI – Bochumer Verein zur Förderung der IT-Sicherheit und Informatik
  • CASA – DFG Excellence Cluster
  • QSI – EU Marie Curie Network
  • HGI – Horst Görtz Institute
  • IACR – Cryptology Research

Lectures (Moodle/Notes)

Crypto Challenges

Former PhDs

  1. Önder Askin, 2024
  2. Floyd Zweydinger, 2023
  3. Lars Schlieper, 2022
  4. Alexander Helm, 2020
  5. Andre Esser, 2020
  6. Matthias Minihold, 2019 
  7. Leif Both, 2018
  8. Robert Kübler, 2018
  9. Elena Kirshanova, 2016
  10. Ilya Ozerov, 2016
  11. Gottfried Herold, 2014
  12. Alexander Meurer, 2014
  13. Mathias Herrmann, 2011
  14. Maike Ritzenhofen, 2010

Calvin & Hobbes

Prof. Dr. Kevin Borgolte

Software Security

Professor / Head of Chair

Address:
Ruhr-University Bochum
Faculty of Computer Science
Software Security
Universitätsstr. 150
--D-44801 Bochum

Room: ID 2/627

Office Hours: By arrangement

E-Mail: kevin.borgolte@rub.de

Curriculum Vitae

Since May 2021, I am a professor for Software Security in the Computer Science department at Ruhr University Bochum (RUB). Prior to joining RUB, I was a professor at TU Delft and a postdoctoral researcher at Princeton University. I received my PhD from the University of California, Santa Barbara in September 2018.


Courses



Research

My research focuses on software and Internet security, including vulnerability discovery and mitigation, as well as how software is being deployed and used, and how it affects security on the Internet. That is, I work on improving the security and privacy of networked software systems. I also work on identifying and preventing large-scale Internet abuse, discovering and defending against new attacks (such as on network applications or enabled by network and protocol interactions), and developing techniques to conduct security-relevant measurements (like enabling Internet-wide measurements for IPv6; or, investigating how new security features affect the Internet). Sometimes, I dabble in related topics, like understanding security misconfigurations, or governance and policy.