This image shows Ralf Küsters

Ralf Küsters

Prof. Dr.

Head of Institute
Institute of Information Security

Contact

+49 711 685 88283
+49 711 685 51096

Universitaetsstrasse 38
70569 Stuttgart
Germany
Room: 2.451

  1. 2024

    1. Pedram Hosseyni, Ralf Küsters, and Tim Würtele, “Formal Security Analysis of the OpenID FAPI 2.0: Accompanying a Standardization Process,” Cryptology ePrint Archive, Technical Report 2024/078, 2024.
    2. Mike Graf, Ralf Küsters, Daniel Rausch, Simon Egger, Marvin Bechtold, and Marcel Flinspach, “Accountable Bulletin Boards: Definition and Provably Secure Implementation,” in 37th IEEE Computer Security Foundations Symposium (CSF 2024), IEEE, 2024. To appear.
    3. Sebastian Hasler, Pascal Reisert, Marc Rivinius, and Ralf Küsters, “Multipars: Reduced-Communication MPC over Z2k,” Proceedings on Privacy Enhancing Technologies, 2024. To appear.
    4. Pedram Hosseyni, Ralf Küsters, and Tim Würtele, “Formal Security Analysis of the OpenID FAPI 2.0: Accompanying a Standardization Process,” in 37th IEEE Computer Security Foundations Symposium (CSF 2024), IEEE, 2024. To appear.
  2. 2023

    1. Melanie Volkamer, Andreas Mayer, Stephan Neumann, Bernhard Beckert, Jurlind Budurushi, Armin Grunwald, Robert Krimmer, Oksana Kulyk, Ralf Küsters, and Jörn Müller-Quade, “Online-Wahlen und digitale Abstimmungen -- eine Einordnung aktueller Entwicklungen,” in DGRI Jahrbuch 2021/2022. Verlag Dr. Otto Schmidt, 2023, pp. 141--160.
    2. Sebastian Hasler, Pascal Reisert, Marc Rivinius, and Ralf Küsters, “Multipars: Reduced-Communication MPC over Z2k,” Cryptology ePrint Archive, Technical Report 2023/1932, 2023.
    3. Mike Graf, Ralf Küsters, Daniel Rausch, Simon Egger, Marvin Bechtold, and Marcel Flinspach, “Accountable Bulletin Boards: Definition and Provably Secure Implementation,” Cryptology ePrint Archive, Technical Report 2023/1869, 2023.
    4. Julian Liedtke, Jan Adomat, Alexander Aßenmacher, Patrick Baisch, Linus Fischer, Jonas Geiselhart, Alex Heller, Julian Kieslinger, Mike Lauer, Paul Mayer, Xuan Viet Pham, André Sperrle, Carmen Wabartha, Pia Wippermann, and Ralf Küsters, “Ordinos: Remote Verifiable Tally-Hiding E-Voting - A Fully-Fledged Web-Based Implementation,” in Eight International Joint Conference on Electronic Voting (E-Vote-ID 2023), University of Tartu Press, 2023. To appear.
    5. Carmen Wabartha, Julian Liedtke, Nicolas Huber, Daniel Rausch, and Ralf Küsters, “Fully Tally-Hiding Verifiable E-Voting for Real-World Elections with Seat-Allocations,” in 28th European Symposium on Research in Computer Security (ESORICS 2023), Springer, 2023, pp. 209--228.
    6. Carmen Wabartha, Julian Liedtke, Nicolas Huber, Daniel Rausch, and Ralf Küsters, “Fully Tally-Hiding Verifiable E-Voting for Real-World Elections with Seat-Allocations,” Cryptology ePrint Archive, Technical Report 2023/1289, 2023.
    7. Florian Helmschmidt, Pedram Hosseyni, Ralf Küsters, Klaas Pruiksma, Clara Waldmann, and Tim Würtele, “The Grant Negotiation and Authorization Protocol: Attacking, Fixing, and Verifying an Emerging Standard,” in 28th European Symposium on Research in Computer Security (ESORICS 2023), Springer, 2023, pp. 222--242.
    8. Florian Helmschmidt, Pedram Hosseyni, Ralf Küsters, Klaas Pruiksma, Clara Waldmann, and Tim Würtele, “The Grant Negotiation and Authorization Protocol: Attacking, Fixing, and Verifying an Emerging Standard,” Cryptology ePrint Archive, Technical Report 2023/1325, 2023.
    9. Karthikeyan Bhargavan, Abhishek Bichhawat, Pedram Hosseyni, Ralf Küsters, Klaas Pruiksma, Guido Schmitz, Clara Waldmann, and Tim Würtele, “Layered Symbolic Security Analysis in DY*,” in 28th European Symposium on Research in Computer Security (ESORICS 2023), Springer, 2023, pp. 3--21.
    10. Karthikeyan Bhargavan, Abhishek Bichhawat, Pedram Hosseyni, Ralf Küsters, Klaas Pruiksma, Guido Schmitz, Clara Waldmann, and Tim Würtele, “Layered Symbolic Security Analysis in DY*,” Cryptology ePrint Archive, Technical Report 2023/1329, 2023.
    11. Marc Rivinius, Pascal Reisert, Sebastian Hasler, and Ralf Küsters, “Convolutions in Overdrive: Maliciously Secure Convolutions for MPC,” Proceedings on Privacy Enhancing Technologies, vol. 2023, no. 3, pp. 321--353, 2023. Runner-Up for the PETS 2023 Best Student Paper Award.
    12. Marc Rivinius, Pascal Reisert, Sebastian Hasler, and Ralf Küsters, “Convolutions in Overdrive: Maliciously Secure Convolutions for MPC,” Cryptology ePrint Archive, Technical Report 2023/359, 2023.
    13. Mike Graf, Ralf Küsters, and Daniel Rausch, “AUC: Accountable Universal Composability,” in IEEE Symposium on Security and Privacy (S&P 2023), IEEE, 2023, pp. 1148--1167.
    14. Sebastian Hasler, Toomas Krips, Ralf Küsters, Pascal Reisert, and Marc Rivinius, “Overdrive LowGear 2.0: Reduced-Bandwidth MPC without Sacrifice,” Cryptology ePrint Archive, Technical Report 2023/462, 2023.
    15. Pascal Reisert, Marc Rivinius, Toomas Krips, and Ralf Küsters, “Overdrive LowGear 2.0: Reduced-Bandwidth MPC without Sacrifice,” in ACM ASIA Conference on Computer and Communications Security (ASIA CCS 2023), ACM, 2023, pp. 372–386.
  3. 2022

    1. Mike Graf, Ralf Küsters, and Daniel Rausch, “AUC: Accountable Universal Composability,” Cryptology ePrint Archive, Technical Report 2022/1606, 2022.
    2. Mayar Elfares, Zhiming Hu, Pascal Reisert, Andreas Bulling, and Ralf Küsters, “Federated Learning for Appearance-based Gaze Estimation in the Wild,” NeurIPS 2022 Workshop GMML, Workshop Paper, 2022.
    3. Mayar Elfares, Zhiming Hu, Pascal Reisert, Andreas Bulling, and Ralf Küsters, “Federated Learning for Appearance-based Gaze Estimation in the Wild,” arXiv, Technical Report 2211.07330, 2022.
    4. Nicolas Huber, Ralf Küsters, Toomas Krips, Julian Liedtke, Johannes Müller, Daniel Rausch, Pascal Reisert, and Andreas Vogt, “Kryvos: Publicly Tally-Hiding Verifiable E-Voting,” in CCS ’22: ACM Conference on Computer and Communications Security, November 7--11, 2022, Los Angeles, USA, ACM, 2022, pp. 1443--1457.
    5. Nicolas Huber, Ralf Küsters, Toomas Krips, Julian Liedtke, Johannes Müller, Daniel Rausch, Pascal Reisert, and Andreas Vogt, “Kryvos: Publicly Tally-Hiding Verifiable E-Voting,” Cryptology ePrint Archive, Technical Report 2022/1132, 2022.
    6. Bernhard Beckert, Jurlind Budurushi, Armin Grunwald, Robert Krimmer, Oksana Kulyk, Ralf Küsters, Andreas Mayer, Jörn Müller-Quade, Stephan Neumann, and Melanie Volkamer, “Recent Developments in the Context of Online Elections and Digital Polls in Germany,” in Sicherheit 2022 : Sicherheit, Schutz und Zuverlässigkeit, C. Wressnegger, D. Reinhardt, T. Barber, B. C. Witt, D. Arp, and Z. Á. Mann (Eds.), Gesellschaft für Informatik e.V. (GI), 2022, pp. 213--217.
    7. Daniel Rausch, Ralf Küsters, and Céline Chevalier, “Embedding the UC Model into the IITM Model,” in Advances in Cryptology - EUROCRYPT 2022, O. Dunkelman and S. Dziembowski (Eds.), Springer, 2022, pp. 242--272.
    8. Daniel Rausch, Ralf Küsters, and Céline Chevalier, “Embedding the UC Model into the IITM Model,” Cryptology ePrint Archive, Technical Report 2022/224, 2022.
    9. Toomas Krips, Ralf Küsters, Pascal Reisert, and Marc Rivinius, “Arithmetic Tuples for MPC,” Cryptology ePrint Archive, Technical Report 2022/667, 2022.
    10. Marc Rivinius, Pascal Reisert, Daniel Rausch, and Ralf Küsters, “Publicly Accountable Robust Multi-Party Computation,” in 43rd IEEE Symposium on Security and Privacy (S&P 2022), IEEE Computer Society, 2022, pp. 2430--2449.
    11. Marc Rivinius, Pascal Reisert, Daniel Rausch, and Ralf Küsters, “Publicly Accountable Robust Multi-Party Computation,” Cryptology ePrint Archive, Technical Report 2022/436, 2022.
    12. Hussam Amrouch, Jens Anders, Steffen Becker, Maik Betka, Gerd Bleher, Peter Domanski, Nourhan Elhamawy, Thomas Ertl, Athanasios Gatzastras, Paul R. Genssler, Sebastian Hasler, Martin Heinrich, Andre van Hoorn, Hanieh Jafarzadeh, Ingmar Kallfass, Florian Klemme, Steffen Koch, Ralf Küsters, Andrés Lalama, Raphael Latty, Yiwen Liao, Natalia Lylina, Zahra Paria Najafi-Haghi, Dirk Pflüger, Ilia Polian, Jochen Rivoir, Matthias Sauer, Denis Schwachhofer, Steffen Templin, Christian Volmer, Stefan Wagner, Daniel Weiskopf, Hans-Joachim Wunderlich, Bin Yang, and Martin Zimmermann, “Intelligent Methods for Test and Reliability,” in 2022 Design, Automation & Test in Europe Conference & Exhibition (DATE), IEEE, 2022, pp. 969--974.
    13. Quoc Huy Do, Pedram Hosseyni, Ralf Küsters, Guido Schmitz, Nils Wenzler, and Tim Würtele, “A Formal Security Analysis of the W3C Web Payment APIs: Attacks and Verification,” in 43rd IEEE Symposium on Security and Privacy (S&P 2022), IEEE, 2022, pp. 134–153.
  4. 2021

    1. Avishek Adhikari, Ralf Küsters, and Bart Preneel (Eds.), Progress in Cryptology - INDOCRYPT 2021 - 22nd International Conference on Cryptology in India, Jaipur, India, December 12-15, 2021, Proceedings, Lecture Notes in Computer Science vol. 13143. Springer, 2021.
    2. Karthikeyan Bhargavan, Abhishek Bichhawat, Quoc Huy Do, Pedram Hosseyni, Ralf Küsters, Guido Schmitz, and Tim Würtele, “An In-Depth Symbolic Security Analysis of the ACME Standard,” Cryptology ePrint Archive, Technical Report 2021/1457, 2021.
    3. Bernhard Beckert, Jurlind Budurushi, Armin Grunwald, Robert Krimmer, Oksana Kulyk, Ralf Küsters, Andreas Mayer, Jörn Müller-Quade, Stephan Neumann, and Melanie Volkamer, “Aktuelle Entwicklungen im Kontext von Online-Wahlen und digitalen Abstimmungen,” KITOpen-Katalog, Technical Report 1000137300, 2021.
    4. Mike Graf, Daniel Rausch, Viktoria Ronge, Christoph Egger, Ralf Küsters, and Dominique Schröder, “A Security Framework for Distributed Ledgers,” in ACM Conference on Computer and Communications Security (CCS 2021), ACM, 2021, pp. 1043--1064.
    5. Karthikeyan Bhargavan, Abhishek Bichhawat, Quoc Huy Do, Pedram Hosseyni, Ralf Küsters, Guido Schmitz, and Tim Würtele, “A Tutorial-Style Introduction to DY*,” in Protocols, Strands, and Logic: Essays Dedicated to Joshua Guttman on the Occasion of His 66.66 Birthday., D. Dougherty, J. Meseguer, S. A. Mödersheim, and P. Rowe (Eds.). Springer, 2021, pp. 77--97.
    6. Fabian Hertel, Nicolas Huber, Jonas Kittelberger, Ralf Küsters, Julian Liedtke, and Daniel Rausch, “Extending the Tally-Hiding Ordinos System: Implementations for Borda, Hare-Niemeyer, Condorcet, and Instant-Runoff Voting,” in Sixth International Joint Conference on Electronic Voting (E-Vote-ID 2021), University of Tartu Press, 2021, pp. 269–284.
    7. Fabian Hertel, Nicolas Huber, Jonas Kittelberger, Ralf Küsters, Julian Liedtke, and Daniel Rausch, “Extending the Tally-Hiding Ordinos System: Implementations for Borda, Hare-Niemeyer, Condorcet, and Instant-Runoff Voting,” Cryptology ePrint Archive, Technical Report 2021/1420, 2021.
    8. Quoc Huy Do, Pedram Hosseyni, Ralf Küsters, Guido Schmitz, Nils Wenzler, and Tim Würtele, “A Formal Security Analysis of the W3C Web Payment APIs: Attacks and Verification,” Cryptology ePrint Archive, Technical Report 2021/1012, 2021.
    9. Karthikeyan Bhargavan, Abhishek Bichhawat, Quoc Huy Do, Pedram Hosseyni, Ralf Küsters, Guido Schmitz, and Tim Würtele, “An In-Depth Symbolic Security Analysis of the ACME Standard,” in ACM Conference on Computer and Communications Security (CCS 2021), ACM, 2021, pp. 2601–2617.
    10. Karthikeyan Bhargavan, Abhishek Bichhawat, Quoc Huy Do, Pedram Hosseyni, Ralf Küsters, Guido Schmitz, and Tim Würtele, “DY*: A Modular Symbolic Verification Framework for Executable Cryptographic Protocol Code,” in IEEE European Symposium on Security and Privacy (EuroS&P 2021), IEEE, 2021, pp. 523–542.
    11. Mike Graf, Daniel Rausch, Viktoria Ronge, Christoph Egger, Ralf Küsters, and Dominique Schröder, “A Security Framework for Distributed Ledgers,” Cryptology ePrint Archive, Technical Report 2021/145, 2021.
  5. 2020

    1. Ralf Küsters, Max Tuengerthal, and Daniel Rausch, “Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation,” Journal of Cryptology, vol. 33, no. 4, pp. 1585--1658, 2020.
    2. Ralf Küsters, Max Tuengerthal, and Daniel Rausch, “The IITM Model: a Simple and Expressive Model for Universal Composability,” Journal of Cryptology, vol. 33, no. 4, pp. 1461--1584, 2020.
    3. Robert Krimmer, Melanie Volkamer, Bernhard Beckert, Ralf Küsters, Oksana Kulyk, David Duenas-Cid, and Mikhel Solvak (Eds.), Electronic Voting - 5th International Joint Conference, E-Vote-ID 2020, Bregenz, Austria, October 6-9, 2020, Proceedings, Lecture Notes in Computer Science vol. 12455. Springer, 2020.
    4. Mike Graf, Ralf Küsters, and Daniel Rausch, “Accountability in a Permissioned Blockchain: Formal Analysis of Hyperledger Fabric,” in IEEE European Symposium on Security and Privacy (EuroS&P 2020), IEEE, 2020, pp. 236--255.
    5. Mike Graf, Ralf Küsters, and Daniel Rausch, “Accountability in a Permissioned Blockchain: Formal Analysis of Hyperledger Fabric,” Cryptology ePrint Archive, Technical Report 2020/386, 2020.
    6. Ralf Küsters, Julian Liedtke, Johannes Müller, Daniel Rausch, and Andreas Vogt, “Ordinos: A Verifiable Tally-Hiding Remote E-Voting System,” in IEEE European Symposium on Security and Privacy, EuroS&P 2020, Genoa, Italy, September 7-11, 2020, IEEE, 2020, pp. 216--235.
    7. Ralf Küsters, Julian Liedtke, Johannes Müller, Daniel Rausch, and Andreas Vogt, “Ordinos: A Verifiable Tally-Hiding E-Voting System,” Cryptology ePrint Archive, Technical Report 2020/405, 2020.
  6. 2019

    1. Jan Camenisch, Ralf Küsters, Anna Lysyanskaya, and Alessandra Scafuro, “Practical Yet Composably Secure Cryptographic Protocols (Dagstuhl Seminar 19042),” Dagstuhl Reports, vol. 9, no. 1, pp. 88--103, 2019.
    2. Bernhard Beckert, Achim Brelle, Rüdiger Grimm, Nicolas Huber, Michael Kirsten, Ralf Küsters, Jörn Müller-Quade, Maximilian Noppel, Kai Reinhard, Jonas Schwab, Rebecca Schwerdt, Tomasz Truderung, Melanie Volkamer, and Cornelia Winter, “GI Elections with POLYAS: a Road to End-to-End Verifiable Elections,” in Fourth International Joint Conference on Electronic Voting (E-Vote-ID 2019), TalTech Press, 2019, pp. 293--294.
    3. Robert Krimmer, Melanie Volkamer, Véronique Cortier, Bernhard Beckert, Ralf Küsters, Uwe Serdült, and David Duenas-Cid (Eds.), Electronic Voting - 4th International Joint Conference, E-Vote-ID 2019, Bregenz, Austria, October 1-4, 2019, Proceedings, Lecture Notes in Computer Science vol. 11759. Springer, 2019.
    4. Jan Camenisch, Stephan Krenn, Ralf Küsters, and Daniel Rausch, “iUC: Flexible Universal Composability Made Simple,” in Advances in Cryptology - ASIACRYPT 2019, S. D. Galbraith and S. Moriai (Eds.), Springer, 2019, pp. 191--221.
    5. Jan Camenisch, Stephan Krenn, Ralf Küsters, and Daniel Rausch, “iUC: Flexible Universal Composability Made Simple,” Cryptology ePrint Archive, Technical Report 2019/1073, 2019.
    6. Daniel Fett, Pedram Hosseyni, and Ralf Küsters, “An Extensive Formal Security Analysis of the OpenID Financial-grade API,” in 2019 IEEE Symposium on Security and Privacy (S&P 2019), IEEE Computer Society, 2019, pp. 1054–1072.
    7. Daniel Fett, Pedram Hosseyni, and Ralf Küsters, “An Extensive Formal Security Analysis of the OpenID Financial-grade API,” arXiv, arXiv:1901.11520, 2019. Available at http://arxiv.org/abs/1901.11520.
  7. 2018

    1. Ralf Küsters, Max Tuengerthal, and Daniel Rausch, “The IITM Model: a Simple and Expressive Model for Universal Composability,” Cryptology ePrint Archive, Technical Report 2013/025, 2018.
    2. Lujo Bauer and Ralf Küsters (Eds.), Principles of Security and Trust - 7th International Conference, POST 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, Lecture Notes in Computer Science vol. 10804. Springer, 2018.
  8. 2017

    1. Ralf Küsters and Johannes Müller, “Cryptographic Security Analysis of E-voting Systems: Achievements, Misconceptions, and Limitations,” in Electronic Voting - Second International Joint Conference, E-Vote-ID 2017, Bregenz, Austria, October 24-27, 2017, Proceedings, R. Krimmer, M. Volkamer, N. Braun, N. Kersting, O. Pereira, and C. Schürmann (Eds.), Springer, 2017, pp. 21–41. Invited paper.
    2. Daniel Fett, Ralf Küsters, and Guido Schmitz, “The Web SSO Standard OpenID Connect: In-Depth Formal Security Analysis and Security Guidelines,” in IEEE 30th Computer Security Foundations Symposium (CSF 2017), IEEE Computer Society, 2017, pp. 189--202.
    3. Daniel Fett, Ralf Küsters, and Guido Schmitz, “The Web SSO Standard OpenID Connect: In-Depth Formal Security Analysis and Security Guidelines,” arXiv, arXiv:1704.08539, 2017. Available at http://arxiv.org/abs/1704.08539.
    4. Ralf Küsters and Daniel Rausch, “A Framework for Universally Composable Diffie-Hellman Key Exchange,” in 38th IEEE Symposium on Security and Privacy (S&P 2017), IEEE, 2017, pp. 881--900.
    5. Ralf Küsters and Daniel Rausch, “A Framework for Universally Composable Diffie-Hellman Key Exchange,” Cryptology ePrint Archive, Technical Report 2017/256, 2017.
  9. 2016

    1. Jan Camenisch, Robert R. Enderlein, Stephan Krenn, Ralf Küsters, and Daniel Rausch, “Universal Composition with Responsive Environments,” in Advances in Cryptology - ASIACRYPT 2016, J. H. Cheon and T. Takagi (Eds.), Springer, 2016, pp. 807--840.
    2. Daniel Fett, Ralf Küsters, and Guido Schmitz, “A Comprehensive Formal Security Analysis of OAuth 2.0,” in Proceedings of the 23rd ACM SIGSAC Conference on Computer and Communications Security (CCS 2016), ACM, 2016, pp. 1204--1215.
    3. Ralf Küsters, Johannes Müller, Enrico Scapin, and Tomasz Truderung, “sElect: A Lightweight Verifiable Remote Voting System,” Cryptology ePrint Archive, Report 2016/438, 2016. Available at http://eprint.iacr.org/2016/438.
    4. Ralf Küsters, Johannes Müller, Enrico Scapin, and Tomasz Truderung, “sElect: A Lightweight Verifiable Remote Voting System,” in IEEE 29th Computer Security Foundations Symposium (CSF 2016), IEEE Computer Society, 2016, pp. 341--354.
    5. Véronique Cortier, David Galindo, Ralf Küsters, Johannes Müller, and Tomasz Truderung, “SoK: Verifiability Notions for E-Voting Protocols,” in IEEE 37th Symposium on Security and Privacy (S&P 2016), IEEE Computer Society, 2016, pp. 779--798.
    6. Véronique Cortier, David Galindo, Ralf Küsters, Johannes Müller, and Tomasz Truderung, “Verifiability Notions for E-Voting Protocols,” Cryptology ePrint Archive, Report 2016/287, 2016. Available at http://eprint.iacr.org/2016/287.
    7. Jan Camenisch, Robert R. Enderlein, Stephan Krenn, Ralf Küsters, and Daniel Rausch, “Universal Composition with Responsive Environments,” Cryptology ePrint Archive, Technical Report 2016/034, 2016.
    8. Daniel Fett, Ralf Küsters, and Guido Schmitz, “A Comprehensive Formal Security Analysis of OAuth 2.0,” arXiv, arXiv:1601.01229, 2016. Available at http://arxiv.org/abs/1601.01229.
    9. Ralf Küsters and Tomasz Truderung, “Security Analysis of Re-Encryption RPC Mix Nets,” in IEEE 1st European Symposium on Security and Privacy (EuroS&P 2016), IEEE Computer Society, 2016, pp. 227--242.
  10. 2015

    1. Daniel Fett, Ralf Küsters, and Guido Schmitz, “SPRESSO: A Secure, Privacy-Respecting Single Sign-On System for the Web,” arXiv, arXiv:1508.01719, 2015. Available at http://arxiv.org/abs/1508.01719.
    2. Daniel Fett, Ralf Küsters, and Guido Schmitz, “SPRESSO: A Secure, Privacy-Respecting Single Sign-On System for the Web,” in Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security (CCS 2015), ACM, 2015, pp. 1358--1369.
    3. Daniel Fett, Ralf Küsters, and Guido Schmitz, “Analyzing the BrowserID SSO System with Primary Identity Providers Using an Expressive Model of the Web,” in Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I, Springer, 2015, pp. 43--65.
    4. Ralf Küsters, Tomasz Truderung, Bernhard Beckert, Daniel Bruns, Michael Kirsten, and Martin Mohr, “A Hybrid Approach for Proving Noninterference of Java Programs,” Cryptology ePrint Archive, Report 2015/438, 2015. Available at http://eprint.iacr.org/2015/438.
    5. Ralf Küsters, Tomasz Truderung, Bernhard Beckert, Daniel Bruns, Michael Kirsten, and Martin Mohr, “A Hybrid Approach for Proving Noninterference of Java Programs,” in IEEE 28th Computer Security Foundations Symposium, CSF 2015, C. Fournet, M. W., and L. Viganò (Eds.), IEEE, 2015, pp. 305--319.
    6. Ralf Küsters and Tomasz Truderung, “Security Analysis of Re-Encryption RPC Mix Nets,” Cryptology ePrint Archive, Report 2015/295, 2015. Available at http://eprint.iacr.org/2015/295.
    7. Daniel Fett, Ralf Küsters, and Guido Schmitz, “Analyzing the BrowserID SSO System with Primary Identity Providers Using an Expressive Model of the Web,” arXiv, arXiv:1411.7210v2, 2015. Available at http://arxiv.org/abs/1411.7210v2.
  11. 2014

    1. Ralf Küsters, “E-Voting Systems,” in Software Systems Safety, O. Grumberg, H. Seidl, and M. Irlbeck (Eds.). IOS Press, 2014, pp. 135--164.
    2. Ralf Küsters and Tomasz Truderung, “Security in E-Voting,” it - Information Technology, vol. 56, no. 6, pp. 300--306, 2014.
    3. Ralf Küsters, Tomasz Truderung, and Andreas Vogt, “Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking,” Cryptology ePrint Archive, Report 2014/341, 2014. Available at http://eprint.iacr.org/2014/341/.
    4. Ralf Küsters, Enrico Scapin, Tomasz Truderung, and Jürgen Graf, “Extending and Applying a Framework for the Cryptographic Verification of Java Programs,” Cryptology ePrint Archive, Report 2014/038, 2014. Available at http://eprint.iacr.org/2014/038/.
    5. Daniel Fett, Ralf Küsters, and Guido Schmitz, “An Expressive Model for the Web Infrastructure: Definition and Application to the BrowserID SSO System,” arXiv, arXiv:1403.1866, 2014. Available at http://arxiv.org/abs/1403.1866.
    6. Daniel Fett, Ralf Küsters, and Guido Schmitz, “An Expressive Model for the Web Infrastructure: Definition and Application to the BrowserID SSO System,” in 35th IEEE Symposium on Security and Privacy (S&P 2014), IEEE Computer Society, 2014, pp. 673–688.
    7. Ralf Küsters, Tomasz Truderung, and Andreas Vogt, “Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking,” in 35th IEEE Symposium on Security and Privacy (S&P 2014), IEEE Computer Society, 2014, pp. 343–358. Download the full and revised version: http://eprint.iacr.org/2014/341/.
    8. Ralf Küsters, Enrico Scapin, Tomasz Truderung, and Jürgen Graf, “Extending and Applying a Framework for the Cryptographic Verification of Java Programs,” in Principles of Security and Trust - Third International Conference, POST 2014, M. Abadi and S. Kremer (Eds.), Springer, 2014, pp. 220--239. A full version is available at http://eprint.iacr.org/2014/038.
  12. 2013

    1. Ralf Küsters and Max Tuengerthal, “The IITM Model: a Simple and Expressive Model for Universal Composability,” Cryptology ePrint Archive, 2013/025, 2013.
  13. 2012

    1. Ralf Küsters, Tomasz Truderung, and Jürgen Graf, “A Framework for the Cryptographic Verification of Java-like Programs,” in IEEE Computer Security Foundations Symposium, CSF 2012, IEEE Computer Society, 2012, pp. 198–212.
    2. Ralf Küsters, Tomasz Truderung, and Juergen Graf, “A Framework for the Cryptographic Verification of Java-like Programs,” IACR Cryptology ePrint Archive, vol. 2012, p. 153, 2012.
    3. Ralf Küsters, Tomasz Truderung, and Andreas Vogt, “Clash Attacks on the Verifiability of E-Voting Systems,” Cryptology ePrint Archive, 2012/116, 2012.
    4. Ralf Küsters, Tomasz Truderung, and Andreas Vogt, “Clash Attacks on the Verifiability of E-Voting Systems,” in 33rd IEEE Symposium on Security and Privacy (S&P 2012), IEEE Computer Society, 2012, pp. 395–409.
    5. Ralf Küsters, Tomasz Truderung, and Andreas Vogt, “A Game-Based Definition of Coercion-Resistance and its Applications,” Journal of Computer Security (special issue of selected CSF 2010 papers), vol. 20, no. 6/2012, pp. 709--764, 2012.
  14. 2011

    1. Hubert Comon-Lundh, Ralf Küsters, and Catherine A. Meadows, “Security and Rewriting (Dagstuhl Seminar 11332),” Dagstuhl Reports, vol. 1, no. 8, pp. 53--66, 2011.
    2. Ralf Küsters and Thomas Wilke, Moderne Kryptographie - Eine Einführung. Vieweg + Teubner, 2011.
    3. Ralf Küsters and Max Tuengerthal, “Composition Theorems Without Pre-Established Session Identifiers,” in Proceedings of the 18th ACM Conference on Computer and Communications Security (CCS 2011), Y. Chen, G. Danezis, and V. Shmatikov (Eds.), ACM Press, 2011, pp. 41–50.
    4. Ralf Küsters and Max Tuengerthal, “Composition Theorems Without Pre-Established Session Identifiers,” Cryptology ePrint Archive, 2011/406, 2011.
    5. Ralf Küsters, Thomas Schmidt, and Tomasz Truderung, “Implementing a Constraint Solving Algorithm for Checking Game-Theoretic Security Requirements,” University of Trier, 2011. Available at http://infsec.uni-trier.de/publications.html.
    6. Ralf Küsters, Tomasz Truderung, and Andreas Vogt, “Verifiability, Privacy, and Coercion-Resistance: New Insights from a Case Study,” University of Trier, 2011. Online available at http://infsec.uni-trier.de/publications/paper/KuestersTruderungVogt-TR-2011.pdf. Also appeared as Technical Report 2011/517, Cryptology ePrint Archive, 2011. http://eprint.iacr.org/2011/517/.
    7. Ralf Küsters, Tomasz Truderung, and Andreas Vogt, “Verifiability, Privacy, and Coercion-Resistance: New Insights from a Case Study,” in 32nd IEEE Symposium on Security and Privacy (S&P 2011), IEEE Computer Society, 2011, pp. 538--553.
    8. Ralf Küsters and Max Tuengerthal, “Ideal Key Derivation and Encryption in Simulation-Based Security,” in Topics in Cryptology - CT-RSA 2011, The Cryptographers’ Track at the RSA Conference 2011, Proceedings, A. Kiayias (Ed.), Springer, 2011, pp. 161–179.
    9. Ralf Küsters and Tomasz Truderung, “Reducing Protocol Analysis with XOR to the XOR-free Case in the Horn Theory Based Approach,” Journal of Automated Reasoning, vol. 46, no. 3, pp. 325--352, 2011.
  15. 2010

    1. Ralf Küsters, Tomasz Truderung, and Andreas Vogt, “Proving Coercion-Resistance of Scantegrity II,” in Proceedings of the 12th International Conference on Information and Communications Security (ICICS 2010), M. Soriano, S. Qing, and J. López (Eds.), Springer, 2010, pp. 281–295.
    2. Ralf Küsters, Tomasz Truderung, and Andreas Vogt, “Proving Coercion-Resistance of Scantegrity II,” Cryptology ePrint Archive, 2010/502, 2010.
    3. Ralf Küsters, Tomasz Truderung, and Andreas Vogt, “Accountability: Definition and Relationship to Verifiability,” in Proceedings of the 17th ACM Conference on Computer and Communications Security (CCS 2010), ACM Press, 2010, pp. 526--535.
    4. Ralf Küsters, Henning Schnoor, and Tomasz Truderung, “A Formal Definition of Online Abuse-freeness,” in Proceedings of the 6th International ICST Conference on Security and Privacy in Communication Networks (SecureComm 2010), Springer, 2010, pp. 484–497.
    5. Ralf Küsters, Henning Schnoor, and Tomasz Truderung, “A Formal Definition of Online Abuse-freeness,” University of Trier, 2010.
    6. Ralf Küsters and Max Tuengerthal, “Ideal Key Derivation and Encryption in Simulation-based Security,” Cryptology ePrint Archive, 2010/295, 2010.
    7. Ralf Küsters, Tomasz Truderung, and Andreas Vogt, “Accountability: Definition and Relationship to Verifiability,” Cryptology ePrint Archive, Technical Report, 2010.
    8. Ralf Küsters, Tomasz Truderung, and Andreas Vogt, “A Game-Based Definition of Coercion-Resistance and its Applications,” in Proceedings of the 23nd IEEE Computer Security Foundations Symposium (CSF 2010), IEEE Computer Society, 2010, pp. 122–136.
    9. Detlef Kähler, Ralf Küsters, and Thomas Wilke, “Deciding Strategy Properties of Contract-Signing Protocols,” ACM Transactions on Computational Logic (TOCL), vol. 11, no. 3, 2010.
  16. 2009

    1. Ralf Küsters and Max Tuengerthal, “Computational Soundness for Key Exchange Protocols with Symmetric Encryption,” in Proceedings of the 16th ACM Conference on Computer and Communications Security (CCS 2009), E. Al-Shaer, S. Jha, and A. D. Keromytis (Eds.), ACM Press, 2009, pp. 91--100.
    2. Ralf Küsters and Max Tuengerthal, “Computational Soundness for Key Exchange Protocols with Symmetric Encryption,” Cryptology ePrint Archive, 2009/392, 2009.
    3. Ralf Küsters, Tomasz Truderung, and Andreas Vogt, “Improving and Simplifying a Variant of Prêt à Voter,” in Second International Conference on E-voting and Identity (VOTE-ID 2009), P. Y. A. Ryan and B. Schoenmakers (Eds.), Springer, 2009, pp. 37–53.
    4. Ralf Küsters and Tomasz Truderung, “Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation,” in Proceedings of the 22nd IEEE Computer Security Foundations Symposium (CSF 2009), IEEE Computer Society, 2009, pp. 157--171.
    5. Ralf Küsters and Max Tuengerthal, “Universally Composable Symmetric Encryption,” in Proceedings of the 22nd IEEE Computer Security Foundations Symposium (CSF 2009), IEEE Computer Society, 2009, pp. 293--307.
    6. Ralf Küsters and Max Tuengerthal, “Universally Composable Symmetric Encryption,” Cryptology ePrint Archive, 2009/055, 2009.
    7. Ralf Küsters and Tomasz Truderung, “An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols,” in 30th IEEE Symposium on Security and Privacy (S&P 2009), IEEE Computer Society, 2009, pp. 251--266.
    8. Ralf Küsters and Tomasz Truderung, “An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols,” arXiv, arXiv:0903.0802, 2009. Available at http://arxiv.org/abs/0903.0802.
    9. Ralf Küsters, Tomasz Truderung, and Andreas Vogt, “A Game-Based Definition of Coercion-Resistance and its Applications,” Cryptology ePrint Archive, 2009/582, 2009.
  17. 2008

    1. M. Backes, M. Dürmuth, D. Hofheinz, and R. Küsters, “Conditional Reactive Simulatability,” International Journal of Information Security (IJIS), vol. 7, no. 2, pp. 155--169, 2008.
    2. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani, “Complexity Results for Security Protocols with Diffie-Hellman Exponentiation and Commuting Public Key Encryption,” ACM Transactions on Computational Logic (TOCL), vol. 9, no. 4, 2008.
    3. Pierpaolo Degano, Ralf Küsters, Luca Viganó, and Steve Zdancewic (Eds.), “Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis,” Information and Computation, vol. 206, no. 2–4, pp. 129--490, 2008.
    4. R. Küsters, A. Datta, J. C. Mitchell, and A. Ramanathan, “On the Relationships Between Notions of Simulation-Based Security,” Journal of Cryptology, vol. 21, no. 4, pp. 492–546, 2008. Electronic publication http://dx.doi.org/10.1007/s00145-008-9019-9.
    5. Ralf Küsters and Tomasz Truderung, “Reducing Protocol Analysis with XOR to the XOR-free Case in the Horn Theory Based Approach,” University of Trier, arXiv:0808.0634v1, 2008. Available at http://arxiv.org/abs/0808.0634v1.
    6. Ralf Küsters and Tomasz Truderung, “Reducing Protocol Analysis with XOR to the XOR-free Case in the Horn Theory Based Approach,” in Proceedings of the 2008 ACM Conference on Computer and Communications Security (CCS 2008), P. Ning, P. F. Syverson, and S. Jha (Eds.), ACM Press, 2008, pp. 129–138.
    7. Ralf Küsters and Max Tuengerthal, “Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation,” in Proceedings of the 21st IEEE Computer Security Foundations Symposium (CSF 2008), IEEE Computer Society, 2008, pp. 270–284.
    8. Ralf Küsters and Max Tuengerthal, “Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation,” Cryptology ePrint Archive, 2008/006, 2008.
  18. 2007

    1. M. Backes, M. Dürmuth, and R. Küsters, “On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography,” IACR Cryptology ePrint Archive, vol. 2007, p. 233, 2007.
    2. M. Backes, M. Dürmuth, and R. Küsters, “On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography,” in Proceedings of the 27th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2007), Springer, 2007, pp. 108–120.
    3. V. Cortier, R. Küsters, and B. Warinschi, “A Cryptographic Model for Branching Time Security Properties - The Case of Contract Signing Protocols,” in Proceedings of the 12th European Symposium On Research In Computer Security (ESORICS 2007), J. Biskup and J. Lopez (Eds.), Springer, 2007, pp. 422–437.
    4. V. Cortier, R. Küsters, and B. Warinschi, “A Cryptographic Model for Branching Time Security Properties -- the Case of Contract Signing Protocols,” IACR Cryptology ePrint Archive, vol. 2007, p. 251, 2007.
    5. Detlef Kähler, Ralf Küsters, and Tomasz Truderung, “Infinite State AMC-Model Checking for Cryptographic Protocols,” Institut für Informatik, CAU Kiel, Germany, 0702, 2007.
    6. Detlef Kähler, Ralf Küsters, and Tomasz Truderung, “Infinite State AMC-Model Checking for Cryptographic Protocols,” in Proceedings of the Twenty-Second Annual IEEE Symposium on Logic in Computer Science (LICS 2007), IEEE, Computer Society Press, 2007, pp. 181–190.
    7. K. O. Kürtz, R. Küsters, and Th. Wilke, “Selecting Theories and Nonce Generation for Recursive Protocols,” in Proceedings of the 5th ACM Workshop on Formal Methods in Security Engineering: From Specifications to Code (FMSE 2007), ACM Press, 2007, pp. 61–70.
    8. Ralf Küsters, “Logics in Security -- A Tutorial --,” in Proceedings of the First ILCLI International Workshop on Logic and Philosophy of Knowledge, Communication, Action (LogKCA 2007), X. Arrazola and J. M. Larrazabal (Eds.), University of the Basque Country Press, 2007, pp. 161--190.
    9. Ralf Küsters and Tomasz Truderung, “On the Automatic Analysis of Recursive Security Protocols with XOR,” in Proceedings of the 24th Symposium on Theoretical Aspects of Computer Science (STACS 2007), W. Thomas and P. Weil (Eds.), Springer, 2007, pp. 646--657.
    10. Ralf Küsters and Tomasz Truderung, “On the Automatic Analysis of Recursive Security Protocols with XOR,” ETH Zurich, 2007. An abridged version appears in STACS 2007.
    11. Ralf Küsters and Thomas Wilke, “Transducer-based analysis of cryptographic protocols,” Information and Computation, vol. 205, no. 12, pp. 1741--1776, 2007.
  19. 2006

    1. F. Baader and R. Küsters, “Non-Standard Inferences in Description Logics: The Story So Far,” in Mathematical Problems from Applied Logic I. Logics for the XXIst Century, D. M. Gabbay, S. S. Goncharov, and M. Zakharyaschev (Eds.). Springer-Verlag, 2006, pp. 1--75.
    2. M. Backes, M. Dürmuth, D. Hofheinz, and R. Küsters, “Conditional Reactive Simulatability,” Cryptology ePrint Archive, 2006/132, 2006.
    3. M. Backes, M. Dürmuth, D. Hofheinz, and R. Küsters, “Conditional Reactive Simulatability,” in Proceedings of the 11th European Symposium on Research in Computer Security (ESORICS 2006), Springer, 2006, pp. 424--443.
    4. V. Cortier, S. Kremer, R. Küsters, and B. Warinschi, “Computationally Sound Symbolic Secrecy in the Presence of Hash Functions,” IACR Cryptology ePrint Archive, vol. 2006, p. 218, 2006.
    5. V. Cortier, S. Kremer, R. Küsters, and B. Warinschi, “Computationally Sound Symbolic Secrecy in the Presence of Hash Functions,” in Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2006), Springer, 2006, pp. 176--187.
    6. A. Datta, R. Küsters, J. Mitchell, and A. Ramanathan, “On the Relationships Between Notions of Simulation-Based Security,” Cryptology ePrint Archive, 2006/153, 2006.
    7. Detlef Kähler, Ralf Küsters, and Thomas Wilke, “A Dolev-Yao-based Definition of Abuse-free Protocols,” in Proceedings of the 33rd International Colloqium on Automata, Languages, and Programming (ICALP 2006), M. Bugliesi, B. Preneel, V. Sassone, and I. Wegener (Eds.), Springer, 2006, pp. 95--106.
    8. Detlef Kähler, Ralf Küsters, and Thomas Wilke, “A Dolev-Yao-based Definition of Abuse-free Protocols,” Institut für Informatik, CAU Kiel, Germany, 0607, 2006.
    9. Ralf Küsters, “Simulation-Based Security with Inexhaustible Interactive Turing Machines,” in Proceedings of the 19th IEEE Computer Security Foundations Workshop (CSFW-19 2006), IEEE Computer Society, 2006, pp. 309--320.
    10. Ralf Küsters, “Simulation-Based Security with Inexhaustible Interactive Turing Machines,” Cryptology ePrint Archive, 2006/151, 2006.
    11. Max Tuengerthal, Ralf Küsters, and Mathieu Turuani, “Implementing a Unification Algorithm for Protocol Analysis with XOR,” in 20th International Workshop on Unification (UNIF 2006), 2006.
  20. 2005

    1. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani, “Deciding the Security of Protocols with Commuting Public Key Encryption,” Electronic Notes in Theoretical Computer Science, vol. 125, no. 1, pp. 55--66, 2005.
    2. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani, “An NP decision procedure for protocol insecurity with XOR,” Theoretical Computer Science, vol. 338, no. 1--3, pp. 247--274, 2005.
    3. A. Datta, R. Küsters, J.C. Mitchell, and A. Ramanathan, “On the Relationships Between Notions of Simulation-Based Security,” in Proceedings of the 2nd Theory of Cryptography Conference (TCC 2005), J. Kilian (Ed.), Springer-Verlag, 2005, pp. 476--494.
    4. Detelf Kähler and Ralf Küsters, “Constraint Solving for Contract-Signing Protocols,” in Proceedings of the 16th International Conference on Concurrency Theory (CONCUR 2005), M. Abadi and L. de Alfaro (Eds.), Springer, 2005, pp. 233--247.
    5. Detelf Kähler and Ralf Küsters, “A Constraint-Based Algorithm for Contract-Signing Protocols,” in Proceedings of the Workshop on Foundations of Computer Security (FCS 2005), 2005.
    6. Detlef Kähler and Ralf Küsters, “A Constraint-Based Algorithm for Constract-Signing Protocols,” Institut für Informatik, CAU Kiel, Germany, 0503, 2005.
    7. Detlef Kähler, Ralf Küsters, and Thomas Wilke, “Deciding Properties of Contract-Signing Protocols,” in Proceedings of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS 2005), V. Diekert and B. Durand (Eds.), Springer-Verlag, 2005, pp. 158--169.
    8. Ralf Küsters, “On the Decidability of Cryptographic Protocols with Open-ended Data Structures,” International Journal of Information Security, vol. 4, no. 1--2, pp. 49--70, 2005. Online publication appeared 2004. DOI: 10.1007/s10207-004-0050-z.
    9. Ralf Küsters and John Mitchell (Eds.), Proceedings of the 2005 ACM Workshop on Formal Methods in Security Engineering (co-located with CCS 2005). ACM Press, Fairfax, Virginia, USA, 2005.
    10. Ralf Küsters and Ralf Molitor, “Structural Subsumption and Least Common Subsumers in a Description Logic with Existential and Number Restrictions,” Studia Logica, vol. 81, pp. 227--259, 2005.
  21. 2004

    1. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani, “Deciding the Security of Protocols with Commuting Public Key Encryption,” in IJCAR 2004 Workshop W6 ARSPA Automated Reasoning for Security Protocol Analysis (ARSPA 2004), 2004.
    2. Anupam Datta, Ralf Küsters, John C. Mitchell, and Ajith Ramanathan, “Sequential Probabilisitic Process Calculus and Simulation-Based Security,” Institut für Informatik, CAU Kiel, 2004.
    3. A. Datta, R. Küsters, J. Mitchell, A. Ramanathan, and V. Shmatikov, “Unifying Equivalence-Based Definitions of Protocol Security,” in 2004 IFIP WG 1.7, ACM SIGPLAN and GI FoMSESS Workshop on Issues in the Theory of Security (WITS 2004), 2004.
    4. Detelf Kähler, Ralf Küsters, and Thomas Wilke, “Deciding Properties of Contract-Signing Protocols,” Institut für Informatik und Praktische Mathematik, CAU Kiel, Germany, 0409, 2004.
    5. Ralf Küsters and Thomas Wilke, “Automata-based Analysis of Recursive Cryptographic Protocols,” in 21st Symposium on Theoretical Aspects of Computer Science (STACS 2004), V. Diekert and M. Habib (Eds.), Springer-Verlag, 2004, pp. 382--393.
  22. 2003

    1. F. Baader, R. Küsters, and F. Wolter, “Extensions to Description Logics,” in The Description Logics Handbook: Theory, Implementation and Applications, F. Baader, D. Calvanese, D. L. McGuinness, D. Nardi, and P. F. Patel-Schneider (Eds.). Cambridge University Press, 2003, pp. 219--261.
    2. S. Brandt, A.-Y. Turhan, and R. Küsters, “Extensions of Non-standard Inferences to Description Logics with transitive Roles,” in Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2003), M. Vardi and A. Voronkov (Eds.), Springer, 2003, pp. 122--136.
    3. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani, “Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents,” in FSTTCS 2003: Foundations of Software Technology and Theoretical Computer Science, P. K. Pandya and J. Radhakrishnan (Eds.), Springer, 2003, pp. 124–135.
    4. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani, “An NP Decision Procedure for Protocol Insecurity with XOR,” INRIA, RR-4697, 2003.
    5. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani, “An NP Decision Procedure for Protocol Insecurity with XOR,” in Proceedings of the Eighteenth Annual IEEE Symposium on Logic in Computer Science (LICS 2003), IEEE Computer Society Press, 2003, pp. 261--270. Received the LICS 2023 Test-of-Time Award.
    6. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani, “Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents,” Institut für Informatik und Praktische Mathematik, CAU Kiel, Germany, 0305, 2003. Available from http://www.informatik.uni-kiel.de/ifi/forschung/technische-berichte/.
    7. Y. Chevalier, R. Küsters, M. Rusinowitch, M. Turuani, and L. Vigneron, “Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions,” in Annual Conference of the European Association for Computer Science Logic (CSL 2003), M. Baaz and J. M. Makowsky (Eds.), Springer-Verlag, 2003, pp. 128--141.
    8. Ralf Küsters, “Tree Transducer-based Analysis of Cryptographic Protocols,” Institut für Informatik und Praktische Mathematik, CAU Kiel, Germany, 0301, 2003. Available from http://www.informatik.uni-kiel.de/ifi/forschung/technische-berichte/.
    9. Ralf Küsters and Thomas Wilke, “Automata-based Analysis of Recursive Cryptographic Protocols,” Institut für Informatik und Praktische Mathematik, CAU Kiel, Germany, 0311, 2003. Available from http://www.informatik.uni-kiel.de/ifi/forschung/technische-berichte/.
  23. 2002

    1. Ralf Küsters, “Memoryless Determinacy of Parity Games,” in Automata, Logics, and Infinite Games: A Guide to Current Research, E. Grädel, W. Thomas, and T. Wilke (Eds.), Springer, 2002, pp. 95--106.
    2. F. Baader and R. Küsters, “Unification in a Description Logic with Inconsistency and Transitive Closure of Roles,” in Proceedings of the International Workshop on Description Logics 2002 (DL 2002), 2002. Available from http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/.
    3. S. Brandt, R. Küsters, and A.-Y. Turhan, “Approximating $ALCN$-Concept Descriptions,” in Proceedings of the International Workshop on Description Logics 2002 (DL 2002), 2002. Available from http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/.
    4. S. Brandt, R. Küsters, and A.-Y. Turhan, “Approximation and Difference in Description Logics,” in Proceedings of the Eight International Conference on Knowledge Representation and Reasoning (KR2002), D. Fensel, F. Guinchiglia, D. McGuiness, and M. A. Williams (Eds.), Morgan Kaufmann Publishers, 2002, pp. 203--214.
    5. Ralf Küsters, “On the Decidability of Cryptographic Protocols with Open-ended Data Structures,” in Foundations of Computer Security (FCS 2002) affiliated with LICS 2002, 2002, pp. 3--12. This is an extended and revised version of the CONCUR 2002 paper.
    6. Ralf Küsters, “On the Decidability of Cryptographic Protocols with Open-ended Data Structures,” in 13th International Conference on Concurrency Theory (CONCUR 2002), L. Brim, P. Jancar, M. Kretinsky, and A. Kucera (Eds.), Springer-Verlag, 2002, pp. 515--530.
    7. Ralf Küsters, “On the Decidability of Cryptographic Protocols with Open-ended Data Structures,” Institut für Informatik und Praktische Mathematik, CAU Kiel, Germany, 0204, 2002. Available from http://www.informatik.uni-kiel.de/ifi/forschung/technische-berichte/.
    8. Ralf Küsters and Ralf Molitor, “Approximating Most Specific Concepts in Description Logics with Existential Restrictions,” AI Communications, vol. 15, no. 1, pp. 47--59, 2002.
    9. Ralf Küsters and Thomas Wilke, “Deciding the First Level of the $\mu$-calculus Alternation Hierarchy,” in FSTTCS 2002: Foundations of Software Technology and Theoretical Computer Science --- 22nd Conference, M. Agrawal and A. Seth (Eds.), Springer-Verlag, 2002, pp. 241--252.
    10. Ralf Küsters and Thomas Wilke, “Deciding the First Level of the $\mu$-calculus Alternation Hierarchy,” Institut für Informatik und Praktische Mathematik, CAU Kiel, Germany, 0209, 2002. Available from http://www.informatik.uni-kiel.de/ifi/forschung/technische-berichte/.
  24. 2001

    1. F. Baader, S. Brandt, and R. Küsters, “Matching under Side Conditions in Description Logics,” in Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001), B. Nebel (Ed.), Morgan Kaufman, 2001, pp. 213--218.
    2. F. Baader, S. Brandt, and R. Küsters, “Matching under Side Conditions in Description Logics,” LuFG Theoretical Computer Science, RWTH Aachen, Germany, LTCS-Report 01–02, 2001.
    3. F. Baader and R. Küsters, “Unification in a Description Logic with Transitive Closure of Roles,” in Proceedings of the International Workshop on Description Logics 2001 (DL 2001), D. L. McGuinness, P. F. Patel-Schneider, C. Goble, and R. Möller (Eds.), 2001. Proceedings online available from http://SunSITE.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/.
    4. F. Baader and R. Küsters, “Unification in a Description Logic with Transitive Closure of Roles,” in Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2001), R. Nieuwenhuis and A. Voronkov (Eds.), Springer-Verlag, 2001.
    5. F. Baader and R. Küsters, “Unification in a Description Logic with Transitive Closure of Roles,” LuFG Theoretical Computer Science, RWTH Aachen, Germany, LTCS-Report 01–05, 2001. See http://www.informatik.rwth-aachen.de/Forschung/aib.php.
    6. F. Baader and R. Küsters, “Solving Linear Equations over Regular Languages,” in Proceedings of the 15th International Workshop on Unification (UNIF 2001), 2001, pp. 27--31. Available via http://goedel.cs.uiowa.edu/unif2001/.
    7. Ralf Küsters, Non-Standard Inferences in Description Logics, Lecture Notes in Artificial Intelligence vol. 2100. Springer-Verlag, 2001. Ph.D. thesis.
    8. Ralf Küsters and Alex Borgida, “What’s in an Attribute? Consequences for the Least Common Subsumer,” Journal of Artificial Intelligence Research, vol. 14, pp. 167--203, 2001.
    9. Ralf Küsters and Ralf Molitor, “Computing Least Common Subsumers in ALEN,” in Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001), B. Nebel (Ed.), Morgan Kaufman, 2001, pp. 219--224.
    10. Ralf Küsters and Ralf Molitor, “Approximating Most Specific Concepts in Description Logics with Existential Restrictions,” in Proceedings of the Joint German/Austrian Conference on Artificial Intelligence, 24th German / 9th Austrian Conference on Artificial Intelligence (KI 2001), F. Baader (Ed.), Springer-Verlag, 2001, pp. 33--47.
  25. 2000

    1. F. Baader and R. Küsters, “Matching in Description Logics with Existential Restrictions,” in Proceedings of the Seventh International Conference on Knowledge Representation and Reasoning (KR2000), A. G. Cohn, F. Giunchiglia, and B. Selman (Eds.), Morgan Kaufmann Publishers, 2000, pp. 261--272.
    2. F. Baader, R. Küsters, and R. Molitor, “Rewriting Concepts Using Terminologies,” in Proceedings of the Seventh International Conference on Knowledge Representation and Reasoning (KR2000), A. G. Cohn, F. Giunchiglia, and B. Selman (Eds.), Morgan Kaufmann Publishers, 2000, pp. 297--308.
    3. F. Baader, R. Küsters, and R. Molitor, “Rewriting Concepts Using Terminologies -- Revisited,” LuFG Theoretical Computer Science, RWTH Aachen, Germany, LTCS-Report 00–04, 2000. See http://www.informatik.rwth-aachen.de/Forschung/aib.php.
    4. A. Borgida and R. Küsters, “What’s not in a name: Some Properties of a Purely Structural Approach to Integrating Large DL Knowledge Bases,” in Proceedings of the 2000 International Workshop on Description Logics (DL2000), F. Baader and U. Sattler (Eds.), RWTH Aachen, 2000. Proceedings online available from http://SunSITE.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/Vol-33/.
    5. R. Küsters and R. Molitor, “Computing Most Specific Concepts in Description Logics with Existential Restrictions,” LuFG Theoretical Computer Science, RWTH Aachen, Germany, LTCS-Report 00–05, 2000.
    6. R. Küsters and R. Molitor, “Computing Least Common Subsumers in ALEN,” LuFG Theoretical Computer Science, RWTH Aachen, Germany, LTCS-Report 00–07, 2000.
  26. 1999

    1. F. Baader, R. Küsters, and R. Molitor, “Computing Least Common Subsumers in Description Logics with Existential Restrictions,” in Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI’99), T. Dean (Ed.), Morgan Kaufmann, 1999, pp. 96–101.
    2. F. Baader, R. Küsters, A. Borgida, and D. McGuinness, “Matching in Description Logics,” Journal of Logic and Computation, vol. 9, no. 3, pp. 411--447, 1999.
    3. F. Baader and R. Küsters, “Matching in Description Logics with Existential Restrictions,” in Proceedings of the International Workshop on Description Logics 1999 (DL’99), P. Lambrix, A. Borgida, M. Lenzerini, R. Möller, and P. Patel-Schneider (Eds.), Linköping University, 1999. Proceedings online available from http://SunSITE.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/Vol-22/.
    4. F. Baader and R. Küsters, “Matching in Description Logics with Existential Restrictions,” LuFg Theoretical Computer Science, RWTH Aachen, Germany, LTCS-Report LTCS-99-07, 1999. See http://www.informatik.rwth-aachen.de/Forschung/aib.php.
    5. F. Baader and R. Küsters, “Matching Concept Descriptions with Existential Restrictions Revisited,” LuFG Theoretical Computer Science, RWTH Aachen, Germany, LTCS-Report LTCS-99-13, 1999. See http://www.informatik.rwth-aachen.de/Forschung/aib.php.
    6. F. Baader, R. Küsters, and R. Molitor, “Rewriting Concepts Using Terminologies -- Revisited,” LuFG Theoretical Computer Science, RWTH Aachen, Germany, LTCS-Report 99–12, 1999. Please refer to the revised version LTCS-Report 00-04.
    7. A. Borgida and R. Küsters, “What’s not in a name? Initial Explorations of a Structural Approach to Integrating Large Concept Knowledge-Bases,” Rutgers University, USA, DCS-TR-391, 1999.
    8. Ralf Küsters, “What’s in a name? --- First Steps Towards a Structural Approach to Integrating Large Content-based Knowledge-Bases,” in Foundations for Information Integration, S. Abiteboul, D. Florescu, A. Levy, and G. Moerkotte (Eds.), 1999. ISSN 0940-1121. Joint work with Alex Borgida (http://www.cs.rutgers.edu/ borgida/).
    9. R. Küsters and A. Borgida, “What’s in an Attribute? Consequences for the Least Common Subsumer,” Rutgers University, USA, DCS-TR-404, 1999.
  27. 1998

    1. F. Baader, R. Küsters, and R. Molitor, “Structural Subsumption Considered from an Automata Theoretic Point of View,” in Proceedings of the 1998 International Workshop on Description Logics DL’98, 1998.
    2. F. Baader and R. Küsters, “Least common subsumer computation w.r.t. cyclic ALN-terminologies,” in Proceedings of the 1998 International Workshop on Description Logics (DL’98), 1998.
    3. F. Baader and R. Küsters, “Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions,” in Proceedings of the 22nd Annual German Conference on Artificial Intelligence, KI-98, O. Herzog and A. Günter (Eds.), Springer-Verlag, 1998, pp. 129--140.
    4. F. Baader and R. Küsters, “Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions,” LuFg Theoretical Computer Science, RWTH Aachen, Germany, LTCS-Report LTCS-98-06, 1998.
    5. F. Baader, R. Küsters, and R. Molitor, “Structural Subsumption Considered from an Automata Theoretic Point of View,” LuFG Theoretical Computer Science, RWTH Aachen, Germany, LTCS-Report LTCS-98-04, 1998. See http://www.informatik.rwth-aachen.de/Forschung/aib.php.
    6. F. Baader, R. Küsters, and R. Molitor, “Computing Least Common Subsumers in Description Logics with Existential Restrictions,” LuFG Theoretical Computer Science, RWTH Aachen, Germany, LTCS-Report LTCS-98-09, 1998. See http://www.informatik.rwth-aachen.de/Forschung/aib.php.
    7. R. Küsters, “Characterizing the Semantics of Terminological Cycles in ALN using Finite Automata,” in Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR’98), Morgan Kaufmann, 1998, pp. 499–510.
  28. 1997

    1. R. Küsters, “Characterizing the semantics of terminological cycles with the help of finite automata,” in Proceedings of the International Workshop on Description Logics, DL’97, LRI, Universitè PARIS-SUD, Cente d’Orsay, 1997, pp. 10--14.
    2. R. Küsters, “Characterizing the semantics of terminological cycles in ALN using finite automata,” LuFg Theoretical Computer Science, RWTH Aachen, Germany, LTCS-Report LTCS-97-04, 1997.
2017- University of Stuttgart.
Full professor of Computer Science and head of the
Institute of Information Security.
2007-2017 University of Trier.
Full professor of Computer Science and head of the
Chair for Information Security and Cryptography.
2006-2007 ETH Zurich.
Head of the research group Foundations of Computer and Network Security and lecturer
at the Institute of Theoretical Computer Science, Department of Computer Science.
2005 Christian-Albrechts-Universität zu Kiel.
Habilitation in Computer Science at the Technische Fakultät.
Habilitation Thesis: Automatic Analysis of Cryptographic Protocols.
Habilitation Talk: GZIP und die Grenzen grammatik-basierter Kompression.
2003-2004 Stanford University.
Postdoc and visiting research scholar
in the Security Lab/Theory Group of the Department of Computer Science.
2000-2006 Christian-Albrechts-Universität zu Kiel.
Post-doctoral research assistant in the Department of Computer Science and Applied Mathematics.
1997-2000 RWTH Aachen.
Ph.D. (Dr.rer.nat.) in Computer Science, 2000 (with distinction)
Thesis: Non-Standard Inferences in Description Logics (published as volume 2100 of the Springer LNAI).
Scholarships: “Graduiertenförderung des Landes Nordrhein-Westfalen”
and “Studienstiftung des deutschen Volkes” (German National Merit Foundation).
Advisor: Prof. Dr. Franz Baader.
1998-1999 Rutgers University (New Jersey, USA).
Visiting research scholar and teaching assistant at the Department of Computer Science.
1992-1997 RWTH Aachen.
Study of Computer Science. Diploma in Computer Science, 1997 (with distinction).
 

Are you a student and want to write a thesis / carry out a project at the SEC?

To the top of the page