Prof. Dr.

# Ralf Küsters

Head of Institute

Institute of Information Security

## Contact

+49 711 685-88283

+49 711 685-51096

Email

Universitaetsstrasse 38

70569
Stuttgart

Germany

Room: 2.451

### 2019

- R. Krimmer
*et al.*, Eds.,*Electronic Voting - 4th International Joint Conference, E-Vote-ID 2019, Bregenz, Austria, October 1-4, 2019, Proceedings*, vol. 11759. Springer, 2019. - J. Camenisch, S. Krenn, R. Küsters, and D. Rausch, “iUC: Flexible Universal Composability Made Simple,”
*Advances in Cryptology - ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security*, 2019. - J. Camenisch, S. Krenn, R. Küsters, and D. Rausch, “iUC: Flexible Universal Composability Made Simple,” Cryptology ePrint Archive, Technical Report 2019/1037, 2019.
- R. Küsters, J. Liedtke, J. Müller, D. Rausch, and A. Vogt, “Ordinos: A Verifiable Tally-Hiding Remote E-Voting System,” 2019.
- R. Küsters, M. Tuengerthal, and D. Rausch, “Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation,”
*Journal of Cryptology*, 2019. - R. Küsters, M. Tuengerthal, and D. Rausch, “The IITM Model: a Simple and Expressive Model for Universal Composability,”
*Journal of Cryptology*, 2019. - D. Fett, P. Hosseyni, and R. Küsters, “An Extensive Formal Security Analysis of the OpenID Financial-grade API,” in
*2019 IEEE Symposium on Security and Privacy (S&P 2019)*, 2019, vol. 1, pp. 1054–1072. - D. Fett, P. Hosseyni, and R. Küsters, “An Extensive Formal Security Analysis of the OpenID Financial-grade API,” arXiv, Technical Report arXiv:1901.11520, 2019.

### 2018

- R. Küsters, M. Tuengerthal, and D. Rausch, “The IITM Model: a Simple and Expressive Model for Universal Composability,” Cryptology ePrint Archive, Technical Report 2013/025, 2018.
- L. Bauer and R. 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*, vol. 10804. Springer, 2018.

### 2017

- R. Küsters and J. 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*, 2017, vol. 10615, pp. 21–41. - D. Fett, R. Küsters, and G. Schmitz, “The Web SSO Standard OpenID Connect: In-Depth Formal Security Analysis and Security Guidelines,” in
*IEEE 30th Computer Security Foundations Symposium (CSF 2017)*, 2017, pp. 189--202. - D. Fett, R. Küsters, and G. Schmitz, “The Web SSO Standard OpenID Connect: In-Depth Formal Security Analysis and Security Guidelines,” arXiv, Technical Report arXiv:1704.08539, 2017.
- R. Küsters and D. Rausch, “A Framework for Universally Composable Diffie-Hellman Key Exchange,” in
*IEEE 38th Symposium on Security and Privacy (S&P 2017)*, 2017, pp. 881--900. - R. Küsters and D. Rausch, “A Framework for Universally Composable Diffie-Hellman Key Exchange,” Cryptology ePrint Archive, Technical Report 2017/256, 2017.

### 2016

- J. Camenisch, R. R. Enderlein, S. Krenn, R. Küsters, and D. Rausch, “Universal Composition with Responsive Environments,” in
*Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security*, 2016, pp. 807--840. - D. Fett, R. Küsters, and G. 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)*, 2016, pp. 1204--1215. - R. Küsters, J. Müller, E. Scapin, and T. Truderung, “sElect: A Lightweight Verifiable Remote Voting System,” Cryptology ePrint Archive, Report 2016/438, 2016.
- R. Küsters, J. Müller, E. Scapin, and T. Truderung, “sElect: A Lightweight Verifiable Remote Voting System,” in
*IEEE 29th Computer Security Foundations Symposium (CSF 2016)*, 2016, pp. 341--354. - V. Cortier, D. Galindo, R. Küsters, J. Müller, and T. Truderung, “SoK: Verifiability Notions for E-Voting Protocols,” in
*IEEE 37th Symposium on Security and Privacy (S&P 2016)*, 2016, pp. 779--798. - V. Cortier, D. Galindo, R. Küsters, J. Müller, and T. Truderung, “Verifiability Notions for E-Voting Protocols,” Cryptology ePrint Archive, Report 2016/287, 2016.
- J. Camenisch, R. R. Enderlein, S. Krenn, R. Küsters, and D. Rausch, “Universal Composition with Responsive Environments,” Cryptology ePrint Archive, Report 2016/034, 2016.
- D. Fett, R. Küsters, and G. Schmitz, “A Comprehensive Formal Security Analysis of OAuth 2.0,” arXiv, Technical Report arXiv:1601.01229, 2016.
- R. Küsters and T. Truderung, “Security Analysis of Re-Encryption RPC Mix Nets,” in
*IEEE 1st European Symposium on Security and Privacy (EuroS&P 2016)*, 2016, pp. 227--242.

### 2015

- D. Fett, R. Küsters, and G. Schmitz, “SPRESSO: A Secure, Privacy-Respecting Single Sign-On System for the Web,” arXiv, Technical Report arXiv:1508.01719, 2015.
- D. Fett, R. Küsters, and G. 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)*, 2015, pp. 1358--1369. - D. Fett, R. Küsters, and G. 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*, 2015, pp. 43--65. - R. Küsters, T. Truderung, B. Beckert, D. Bruns, M. Kirsten, and M. Mohr, “A Hybrid Approach for Proving Noninterference of Java Programs,” Cryptology ePrint Archive, Report 2015/438, 2015.
- R. Küsters, T. Truderung, B. Beckert, D. Bruns, M. Kirsten, and M. Mohr, “A Hybrid Approach for Proving Noninterference of Java Programs,” in
*IEEE 28th Computer Security Foundations Symposium, CSF 2015*, 2015, pp. 305--319. - R. Küsters and T. Truderung, “Security Analysis of Re-Encryption RPC Mix Nets,” Cryptology ePrint Archive, Report 2015/295, 2015.
- D. Fett, R. Küsters, and G. Schmitz, “Analyzing the BrowserID SSO System with Primary Identity Providers Using an Expressive Model of the Web,” arXiv, Technical Report arXiv:1411.7210v2, 2015.

### 2014

- R. Küsters, “E-Voting Systems,” in
*Software Systems Safety*, O. Grumberg, H. Seidl, and M. Irlbeck, Eds. IOS Press, 2014, pp. 135--164. - R. Küsters and T. Truderung, “Security in E-Voting,”
*it - Information Technology*, vol. 56, no. 6, pp. 300--306, 2014. - R. Küsters, T. Truderung, and A. Vogt, “Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking,” Cryptology ePrint Archive, Report 2014/341, 2014.
- R. Küsters, E. Scapin, T. Truderung, and J. Graf, “Extending and Applying a Framework for the Cryptographic Verification of Java Programs,” Cryptology ePrint Archive, Report 2014/038, 2014.
- D. Fett, R. Küsters, and G. Schmitz, “An Expressive Model for the Web Infrastructure: Definition and Application to the BrowserID SSO System,” arXiv, Technical Report arXiv:1403.1866, 2014.
- D. Fett, R. Küsters, and G. 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)*, 2014, pp. 673–688. - R. Küsters, T. Truderung, and A. Vogt, “Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking,” in
*35th IEEE Symposium on Security and Privacy (S&P 2014)*, 2014, pp. 343–358. - R. Küsters, E. Scapin, T. Truderung, and J. Graf, “Extending and Applying a Framework for the Cryptographic Verification of Java Programs,” in
*Principles of Security and Trust - Third International Conference, POST 2014*, 2014, vol. 8414, pp. 220--239.

### 2013

- R. Küsters and M. Tuengerthal, “The IITM Model: a Simple and Expressive Model for Universal Composability,” Cryptology ePrint Archive, Technical Report 2013/025, 2013.

### 2012

- R. Küsters, T. Truderung, and J. Graf, “A Framework for the Cryptographic Verification of Java-like Programs,” in
*IEEE Computer Security Foundations Symposium, CSF 2012*, 2012, pp. 198–212. - R. Küsters, T. Truderung, and J. Graf, “A Framework for the Cryptographic Verification of Java-like Programs.” 2012.
- R. Küsters, T. Truderung, and A. Vogt, “Clash Attacks on the Verifiability of E-Voting Systems,” Cryptology ePrint Archive, Technical Report 2012/116, 2012.
- R. Küsters, T. Truderung, and A. Vogt, “Clash Attacks on the Verifiability of E-Voting Systems,” in
*33rd IEEE Symposium on Security and Privacy (S&P 2012)*, 2012, pp. 395–409. - R. Küsters, T. Truderung, and A. 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.

### 2011

- R. Küsters and T. Wilke,
*Moderne Kryptographie - Eine Einführung*. Vieweg + Teubner, 2011. - R. Küsters and M. Tuengerthal, “Composition Theorems Without Pre-Established Session Identifiers,” in
*Proceedings of the 18th ACM Conference on Computer and Communications Security (CCS 2011)*, 2011, pp. 41–50. - R. Küsters and M. Tuengerthal, “Composition Theorems Without Pre-Established Session Identifiers,” Cryptology ePrint Archive, Technical Report 2011/406, 2011.
- R. Küsters, T. Schmidt, and T. Truderung, “Implementing a Constraint Solving Algorithm for Checking Game-Theoretic Security Requirements,” University of Trier, 2011.
- R. Küsters, T. Truderung, and A. Vogt, “Verifiability, Privacy, and Coercion-Resistance: New Insights from a Case Study,” University of Trier, 2011.
- R. Küsters, T. Truderung, and A. Vogt, “Verifiability, Privacy, and Coercion-Resistance: New Insights from a Case Study,” in
*32nd IEEE Symposium on Security and Privacy (S&P 2011)*, 2011, pp. 538--553. - R. Küsters and M. 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*, 2011, vol. 6558, pp. 161–179. - R. Küsters and T. 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.

### 2010

- R. Küsters, T. Truderung, and A. Vogt, “Proving Coercion-Resistance of Scantegrity II,” in
*Proceedings of the 12th International Conference on Information and Communications Security (ICICS 2010)*, 2010, vol. 6476, pp. 281–295. - R. Küsters, T. Truderung, and A. Vogt, “Proving Coercion-Resistance of Scantegrity II,” Cryptology ePrint Archive, Technical Report 2010/502, 2010.
- R. Küsters, T. Truderung, and A. Vogt, “Accountability: Definition and Relationship to Verifiability,” in
*Proceedings of the 17th ACM Conference on Computer and Communications Security (CCS 2010)*, 2010, pp. 526--535. - R. Küsters, H. Schnoor, and T. 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)*, 2010, vol. 50, pp. 484–497. - R. Küsters, H. Schnoor, and T. Truderung, “A Formal Definition of Online Abuse-freeness,” University of Trier, 2010.
- R. Küsters and M. Tuengerthal, “Ideal Key Derivation and Encryption in Simulation-based Security,” Cryptology ePrint Archive, Technical Report 2010/295, 2010.
- R. Küsters, T. Truderung, and A. Vogt, “Accountability: Definition and Relationship to Verifiability.” 2010.
- R. Küsters, T. Truderung, and A. Vogt, “A Game-Based Definition of Coercion-Resistance and its Applications,” in
*Proceedings of the 23nd IEEE Computer Security Foundations Symposium (CSF 2010)*, 2010, pp. 122–136. - D. Kähler, R. Küsters, and T. Wilke, “Deciding Strategy Properties of Contract-Signing Protocols,”
*ACM Transactions on Computational Logic (TOCL)*, vol. 11, no. 3, 2010.

### 2009

- R. Küsters and M. Tuengerthal, “Computational Soundness for Key Exchange Protocols with Symmetric Encryption,” in
*Proceedings of the 16th ACM Conference on Computer and Communications Security (CCS 2009)*, 2009, pp. 91--100. - R. Küsters and M. Tuengerthal, “Computational Soundness for Key Exchange Protocols with Symmetric Encryption,” Cryptology ePrint Archive, Technical Report 2009/392, 2009.
- R. Küsters, T. Truderung, and A. Vogt, “Improving and Simplifying a Variant of Prêt à Voter,” in
*Second International Conference on E-voting and Identity (VOTE-ID 2009)*, 2009, vol. 5767, pp. 37–53. - R. Küsters and T. Truderung, “Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation,” in
*Proceedings of the 22nd IEEE Computer Security Foundations Symposium (CSF 2009)*, 2009, pp. 157--171. - R. Küsters and M. Tuengerthal, “Universally Composable Symmetric Encryption,” in
*Proceedings of the 22nd IEEE Computer Security Foundations Symposium (CSF 2009)*, 2009, pp. 293--307. - R. Küsters and M. Tuengerthal, “Universally Composable Symmetric Encryption,” Cryptology ePrint Archive, Technical Report 2009/055, 2009.
- R. Küsters and T. Truderung, “An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols,” in
*30th IEEE Symposium on Security and Privacy (S&P 2009)*, 2009, pp. 251--266. - R. Küsters and T. Truderung, “An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols,” arXiv, Technical Report arXiv:0903.0802, 2009.
- R. Küsters, T. Truderung, and A. Vogt, “A Game-Based Definition of Coercion-Resistance and its Applications,” Cryptology ePrint Archive, Technical Report 2009/582, 2009.

### 2008

- 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. - 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. - P. Degano, R. Küsters, L. Viganó, and S. Z. (editors), “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. - 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. - R. Küsters and T. Truderung, “Reducing Protocol Analysis with XOR to the XOR-free Case in the Horn Theory Based Approach,” University of Trier, Technical Report arXiv:0808.0634v1, 2008.
- R. Küsters and T. 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)*, 2008, pp. 129–138. - R. Küsters and M. 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)*, 2008, pp. 270–284. - R. Küsters and M. Tuengerthal, “Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation,” Cryptology ePrint Archive, Technical Report 2008/006, 2008.

### 2007

- M. Backes, M. Dürmuth, and R. Küsters, “On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography.” 2007.
- 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)*, 2007, vol. 4855, pp. 108–120. - 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)*, 2007, vol. 4734, pp. 422–437. - V. Cortier, R. Küsters, and B. Warinschi, “A Cryptographic Model for Branching Time Security Properties -- the Case of Contract Signing Protocols.” 2007.
- D. Kähler, R. Küsters, and T. Truderung, “Infinite State AMC-Model Checking for Cryptographic Protocols,” Institut für Informatik, CAU Kiel, Germany, Technical Report 0702, 2007.
- D. Kähler, R. Küsters, and T. 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)*, 2007, pp. 181–190. - 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)*, 2007, pp. 61–70. - R. 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)*, 2007, pp. 161--190. - R. Küsters and T. 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)*, 2007, vol. 4393, pp. 646--657. - R. Küsters and T. Truderung, “On the Automatic Analysis of Recursive Security Protocols with XOR,” ETH Zurich, 2007.
- R. Küsters and T. Wilke, “Transducer-based analysis of cryptographic protocols,”
*Information and Computation*, vol. 205, no. 12, pp. 1741--1776, 2007.

### 2006

- 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*, vol. 4, D. M. Gabbay, S. S. Goncharov, and M. Zakharyaschev, Eds. Springer-Verlag, 2006, pp. 1--75. - M. Backes, M. Dürmuth, D. Hofheinz, and R. Küsters, “Conditional Reactive Simulatability,” Cryptology ePrint Archive, Technical Report 2006/132, 2006.
- 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)*, 2006, vol. 4189, pp. 424--443. - V. Cortier, S. Kremer, R. Küsters, and B. Warinschi, “Computationally Sound Symbolic Secrecy in the Presence of Hash Functions.” 2006.
- 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)*, 2006, vol. 4337, pp. 176--187. - A. Datta, R. Küsters, J. Mitchell, and A. Ramanathan, “On the Relationships Between Notions of Simulation-Based Security,” Cryptology ePrint Archive, Technical Report 2006/153, 2006.
- D. Kähler, R. Küsters, and T. Wilke, “A Dolev-Yao-based Definition of Abuse-free Protocols,” in
*Proceedings of the 33rd International Colloqium on Automata, Languages, and Programming (ICALP 2006)*, 2006, vol. 4052, pp. 95--106. - D. Kähler, R. Küsters, and T. Wilke, “A Dolev-Yao-based Definition of Abuse-free Protocols,” Institut für Informatik, CAU Kiel, Germany, Technical Report 0607, 2006.
- R. Küsters, “Simulation-Based Security with Inexhaustible Interactive Turing Machines,” in
*Proceedings of the 19th IEEE Computer Security Foundations Workshop (CSFW-19 2006)*, 2006, pp. 309--320. - R. Küsters, “Simulation-Based Security with Inexhaustible Interactive Turing Machines,” Cryptology ePrint Archive, Technical Report 2006/151, 2006.
- M. Tuengerthal, R. Küsters, and M. Turuani, “Implementing a Unification Algorithm for Protocol Analysis with XOR,” in
*20th International Workshop on Unification (UNIF 2006)*, 2006.

### 2005

- 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. - 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. - 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)*, 2005, vol. 3378, pp. 476--494. - D. Kähler and R. Küsters, “Constraint Solving for Contract-Signing Protocols,” in
*Proceedings of the 16th International Conference on Concurrency Theory (CONCUR 2005)*, 2005, vol. 3653, pp. 233--247. - D. Kähler and R. Küsters, “A Constraint-Based Algorithm for Contract-Signing Protocols,” in
*Proceedings of the Workshop on Foundations of Computer Security (FCS 2005)*, 2005. - D. Kähler and R. Küsters, “A Constraint-Based Algorithm for Constract-Signing Protocols,” Institut für Informatik, CAU Kiel, Germany, Technical Report 0503, 2005.
- D. Kähler, R. Küsters, and T. Wilke, “Deciding Properties of Contract-Signing Protocols,” in
*Proceedings of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS 2005)*, 2005, no. 3404, pp. 158--169. - R. 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. - R. Küsters and J. Mitchell, Eds.,
*Proceedings of the 2005 ACM Workshop on Formal Methods in Security Engineering (co-located with CCS 2005)*. Fairfax, Virginia, USA: ACM Press, 2005. - R. Küsters and R. Molitor, “Structural Subsumption and Least Common Subsumers in a Description Logic with Existential and Number Restrictions,”
*Studia Logica*, vol. 81, pp. 227--259, 2005.

### 2004

- 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. - A. Datta, R. Küsters, J. C. Mitchell, and A. Ramanathan, “Sequential Probabilisitic Process Calculus and Simulation-Based Security,” Institut für Informatik, CAU Kiel, 2004.
- 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. - D. Kähler, R. Küsters, and T. Wilke, “Deciding Properties of Contract-Signing Protocols,” Institut für Informatik und Praktische Mathematik, CAU Kiel, Germany, Technical Report 0409, 2004.
- R. Küsters and T. Wilke, “Automata-based Analysis of Recursive Cryptographic Protocols,” in
*21st Symposium on Theoretical Aspects of Computer Science (STACS 2004)*, 2004, vol. 2996, pp. 382--393.

### 2003

- 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. - 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)*, 2003, vol. 2850, pp. 122--136. - 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*, 2003, vol. 2914, pp. 124–135. - Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani, “An NP Decision Procedure for Protocol Insecurity with XOR,” INRIA, Technical Report RR-4697, 2003.
- 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)*, 2003, pp. 261--270. - 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, Technical Report 0305, 2003.
- 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)*, 2003, vol. 2803, pp. 128--141. - R. Küsters, “Tree Transducer-based Analysis of Cryptographic Protocols,” Institut für Informatik und Praktische Mathematik, CAU Kiel, Germany, Technical Report 0301, 2003.
- R. Küsters and T. Wilke, “Automata-based Analysis of Recursive Cryptographic Protocols,” Institut für Informatik und Praktische Mathematik, CAU Kiel, Germany, Technical Report 0311, 2003.

### 2002

- R. Küsters, “Memoryless Determinacy of Parity Games,” in
*Automata, Logics, and Infinite Games: A Guide to Current Research*, 2002, vol. 2500, pp. 95--106. - 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. - 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. - 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)*, 2002, pp. 203--214. - R. 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. - R. Küsters, “On the Decidability of Cryptographic Protocols with Open-ended Data Structures,” in
*13th International Conference on Concurrency Theory (CONCUR 2002)*, 2002, vol. 2421, pp. 515--530. - R. Küsters, “On the Decidability of Cryptographic Protocols with Open-ended Data Structures,” Institut für Informatik und Praktische Mathematik, CAU Kiel, Germany, Technical Report 0204, 2002.
- R. Küsters and R. Molitor, “Approximating Most Specific Concepts in Description Logics with Existential Restrictions,”
*AI Communications*, vol. 15, no. 1, pp. 47--59, 2002. - R. Küsters and T. Wilke, “Deciding the First Level of the $\mu$-calculus Alternation Hierarchy,” in
*FSTTCS 2002: Foundations of Software Technology and Theoretical Computer Science --- 22nd Conference*, 2002, vol. 2556, pp. 241--252. - R. Küsters and T. Wilke, “Deciding the First Level of the $\mu$-calculus Alternation Hierarchy,” Institut für Informatik und Praktische Mathematik, CAU Kiel, Germany, Technical Report 0209, 2002.

### 2001

- 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)*, 2001, pp. 213--218. - F. Baader, S. Brandt, and R. Küsters, “Matching under Side Conditions in Description Logics,” LuFG Theoretical Computer Science, RWTH Aachen, Germany, Technical Report 01–02, 2001.
- 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)*, Stanford University, CA, 2001. - 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)*, Vienna, Austria, 2001, vol. 2250. - F. Baader and R. Küsters, “Unification in a Description Logic with Transitive Closure of Roles,” LuFG Theoretical Computer Science, RWTH Aachen, Germany, Technical Report 01–05, 2001.
- 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. - R. Küsters,
*Non-Standard Inferences in Description Logics*, vol. 2100. Springer-Verlag, 2001. - R. Küsters and A. Borgida, “What’s in an Attribute? Consequences for the Least Common Subsumer,”
*Journal of Artificial Intelligence Research*, vol. 14, pp. 167--203, 2001. - R. Küsters and R. Molitor, “Computing Least Common Subsumers in ALEN,” in
*Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001)*, 2001, pp. 219--224. - R. Küsters and R. 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)*, Vienna, Austria, 2001, vol. 2174, pp. 33--47.

### 2000

- 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)*, San Francisco, CA, 2000, pp. 261--272. - 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)*, San Francisco, CA, 2000, pp. 297--308. - F. Baader, R. Küsters, and R. Molitor, “Rewriting Concepts Using Terminologies -- Revisited,” LuFG Theoretical Computer Science, RWTH Aachen, Germany, Technical Report 00–04, 2000.
- 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)*, Aachen, Germany, 2000, no. 33. - R. Küsters and R. Molitor, “Computing Most Specific Concepts in Description Logics with Existential Restrictions,” LuFG Theoretical Computer Science, RWTH Aachen, Germany, Technical Report 00–05, 2000.
- R. Küsters and R. Molitor, “Computing Least Common Subsumers in ALEN,” LuFG Theoretical Computer Science, RWTH Aachen, Germany, Technical Report 00–07, 2000.

### 1999

- 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)*, 1999, pp. 96–101. - 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. - 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)*, Sweden, 1999, no. 22. - F. Baader and R. Küsters, “Matching in Description Logics with Existential Restrictions,” LuFg Theoretical Computer Science, RWTH Aachen, Germany, Technical Report LTCS-99-07, 1999.
- F. Baader and R. Küsters, “Matching Concept Descriptions with Existential Restrictions Revisited,” LuFG Theoretical Computer Science, RWTH Aachen, Germany, Technical Report LTCS-99-13, 1999.
- F. Baader, R. Küsters, and R. Molitor, “Rewriting Concepts Using Terminologies -- Revisited,” LuFG Theoretical Computer Science, RWTH Aachen, Germany, Technical Report 99–12, 1999.
- 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, Technical Report DCS-TR-391, 1999.
- R. 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*, 1999. - R. Küsters and A. Borgida, “What’s in an Attribute? Consequences for the Least Common Subsumer,” Rutgers University, USA, Technical Report DCS-TR-404, 1999.

### 1998

- 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*, Trento, Italy, 1998. - 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)*, Trento, Italy, 1998. - 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*, Bremen, Germany, 1998, vol. 1504, pp. 129--140. - 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, Technical Report LTCS-98-06, 1998.
- 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, Technical Report LTCS-98-04, 1998.
- 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, Technical Report LTCS-98-09, 1998.
- 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)*, 1998, pp. 499–510.

### 1997

- 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*, 1997, pp. 10--14. - R. Küsters, “Characterizing the semantics of terminological cycles in ALN using finite automata,” LuFg Theoretical Computer Science, RWTH Aachen, Germany, Technical 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). |