User Tools

Site Tools


Publications

2017

  • Ralf Küsters and Daniel Rausch.
    A Framework for Universally Composable Diffie-Hellman Key Exchange.
    In 2017 IEEE Symposium on Security and Privacy, SP 2017, San Jose, CA, USA, May 22-24, 2017, IEEE Computer Society, 2017. to appear
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters and Daniel Rausch.
    A Framework for Universally Composable Diffie-Hellman Key Exchange.
    Technical Report 2017/256, Cryptology ePrint Archive, 2017. Available at http://eprint.iacr.org/2017/256.
    BibTeX   Abstract   Download: [pdf] 

2016

  • Daniel Fett and Guido Schmitz.
    Pi and More - Eine Veranstaltungsreihe rund um "kleine Computer".
    In Informatik 2016, 46. Jahrestagung der Gesellschaft für Informatik, 26.-30. September 2016, Klagenfurt, Österreich, pp. 1195–1196, LNI P-259, GI, 2016.
    BibTeX   Abstract   Download: [pdf] 
  • Jan Camenisch, Robert R. Enderlein, Stephan Krenn, Ralf Küsters, and Daniel 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, pp. 807–840, Lecture Notes in Computer Science 10032, Springer, 2016.
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 1204–1215, ACM, 2016.
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters, Johannes Müller, Enrico Scapin, and Tomasz Truderung.
    sElect: A Lightweight Verifiable Remote Voting System.
    Technical Report Cryptology ePrint Archive, Report 2016/438, 2016. Available at http://eprint.iacr.org/2016/438.
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 341–354, IEEE Computer Society, 2016.
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 779–798, IEEE Computer Society, 2016.
    BibTeX   Abstract   Download: [pdf] 
  • Véronique Cortier, David Galindo, Ralf Küsters, Johannes Müller, and Tomasz Truderung.
    Verifiability Notions for E-Voting Protocols.
    Technical Report Cryptology ePrint Archive, Report 2016/287, 2016. Available at http://eprint.iacr.org/2016/287.
    BibTeX   Abstract   Download: [pdf] 
  • Jan Camenisch, Robert R. Enderlein, Stephan Krenn, Ralf Küsters, and Daniel Rausch.
    Universal Composition with Responsive Environments.
    Technical Report Cryptology ePrint Archive, Report 2016/034, 2016. Available at http://eprint.iacr.org/2016/034.
    BibTeX   Abstract   Download: [pdf] 
  • Daniel Fett, Ralf Küsters, and Guido Schmitz.
    A Comprehensive Formal Security Analysis of OAuth 2.0.
    Technical Report arXiv:1601.01229, arXiv, 2016. Available at http://arxiv.org/abs/1601.01229.
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 227–242, IEEE Computer Society, 2016.
    BibTeX   Abstract   Download: [pdf] 

2015

  • Enrico Scapin.
    A Proof Technique for Noninterference In Open Systems.
    Technical Report University of Trier, 2015.
    BibTeX   Abstract   Download: [pdf] 
  • Enrico Scapin.
    A Proof Technique for Noninterference In Open Systems.
    Workshop on Foundations of Computer Security (FCS 2015), 2015.
    BibTeX   Abstract   Download: [pdf] 
  • Daniel Fett, Ralf Küsters, and Guido Schmitz.
    SPRESSO: A Secure, Privacy-Respecting Single Sign-On System for the Web.
    Technical Report arXiv:1508.01719, arXiv, 2015. Available at http://arxiv.org/abs/1508.01719.
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 1358–1369, ACM, 2015.
    BibTeX   Abstract   Download: [pdf] 
  • 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, pp. 43–65, Springer, 2015.
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters, Tomasz Truderung, Bernhard Beckert, Daniel Bruns, Michael Kirsten, and Martin Mohr.
    A Hybrid Approach for Proving Noninterference of Java Programs.
    Technical Report Cryptology ePrint Archive, Report 2015/438, 2015. Available at http://eprint.iacr.org/2015/438.
    BibTeX   Abstract   Download: [pdf] 
  • 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, pp. 305–319, IEEE, 2015.
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters and Tomasz Truderung.
    Security Analysis of Re-Encryption RPC Mix Nets.
    Technical Report Cryptology ePrint Archive, Report 2015/295, 2015. Available at http://eprint.iacr.org/2015/295.
    BibTeX   Abstract   Download: [pdf] 
  • Daniel Fett, Ralf Küsters, and Guido Schmitz.
    Analyzing the BrowserID SSO System with Primary Identity Providers Using an Expressive Model of the Web.
    Technical Report arXiv:1411.7210v2, arXiv, 2015. Available at http://arxiv.org/abs/1411.7210v2.
    BibTeX   Abstract   Download: [pdf] 

2014

  • Ralf Küsters.
    E-Voting Systems.
    In Orna Grumberg, Helmut Seidl, and Maximilian Irlbeck, editors, Software Systems Safety, NATO Science for Peace and Security Series, D: Information and Communication Security, pp. 135–164, IOS Press, 2014.
    BibTeX   Abstract    
  • Ralf Küsters and Tomasz Truderung.
    Security in E-Voting.
    it - Information Technology, 56(6):300–306, 2014.
    BibTeX   Abstract    
  • Ralf Küsters, Tomasz Truderung, and Andreas Vogt.
    Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking.
    Technical Report Cryptology ePrint Archive, Report 2014/341, 2014. Available at http://eprint.iacr.org/2014/341/.
    BibTeX   Abstract   Download: [pdf] 
  • Enrico Scapin and Fausto Spoto.
    Field-sensitive unreachability and non-cyclicity analysis.
    Sci. Comput. Program., 95:359–375, 2014. Available at http://dx.doi.org/10.1016/j.scico.2014.03.012
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters, Enrico Scapin, Tomasz Truderung, and Jürgen Graf.
    Extending and Applying a Framework for the Cryptographic Verification of Java Programs.
    Technical Report Cryptology ePrint Archive, Report 2014/038, 2014. Available at http://eprint.iacr.org/2014/038/.
    BibTeX   Abstract   Download: [pdf] 
  • Daniel Fett, Ralf Küsters, and Guido Schmitz.
    An Expressive Model for the Web Infrastructure: Definition and Application to the BrowserID SSO System.
    Technical Report arXiv:1403.1866, arXiv, 2014. Available at http://arxiv.org/abs/1403.1866.
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 673–688, IEEE Computer Society, 2014.
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 343–358, IEEE Computer Society, 2014. Download the full and revised version: http://eprint.iacr.org/2014/341/
    BibTeX   Abstract    
  • 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, pp. 220–239, Lecture Notes in Computer Science 8414, Springer, 2014. A full version is available at http://eprint.iacr.org/2014/038
    BibTeX   Abstract   Download: [pdf] 

2013

  • Ralf Küsters and Max Tuengerthal.
    The IITM Model: a Simple and Expressive Model for Universal Composability.
    Technical Report 2013/025, Cryptology ePrint Archive, 2013. http://eprint.iacr.org/2013/025/
    BibTeX   Abstract   Download: [pdf] 
  • Oana Ciobotaru.
    Rational Cryptography: Novel Constructions, Automated Verification and Unified Definitions.
    PhD Thesis, 2013.
    BibTeX   Abstract    
  • Michael Backes, Oana Ciobotaru, and Matteo Maffei.
    Towards Automated Verification of Rational Cryptographic Protocols.
    In Preparation, 2013.
    BibTeX   Abstract    
  • Enrico Scapin and Fausto Spoto.
    Field-Sensitive Unreachability and Non-Cyclicity Analysis.
    ETAPS/BYTECODE, 2013.
    BibTeX   Abstract   Download: [pdf] 

2012

  • Enrico Scapin.
    Field-Sensitive Unreachability and Non-Cyclicity Analysis.
    Master Degree Thesis, 2012.
    BibTeX   Abstract   Download: [pdf] 
  • 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, pp. 198–212, IEEE Computer Society, 2012.
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters, Tomasz Truderung, and Juergen Graf .
    A Framework for the Cryptographic Verification of Java-like Programs.
    Cryptology ePrint Archive, Report 2012/153, 2012. http://eprint.iacr.org/2012/153
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters, Tomasz Truderung, and Andreas Vogt.
    Clash Attacks on the Verifiability of E-Voting Systems.
    Technical Report 2012/116, Cryptology ePrint Archive, 2012. http://eprint.iacr.org/2012/116/
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 395–409, IEEE Computer Society, 2012.
    BibTeX   Abstract   Download: [pdf] 
  • A. Vogt.
    Universal Interpolation.
    ANALYSIS, 32:87–96, 2012.
    BibTeX   Abstract    
  • A. Vogt.
    On bounded universal Functions.
    Computational Methods and Function Theory, 12(1):213–219, 2012.
    BibTeX   Abstract    
  • A. Vogt.
    Universal properties of approximation operators.
    Journal of Approximation Theory, 164:367–370, 2012.
    BibTeX   Abstract    
  • 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), 20(6/2012):709–764, 2012.
    BibTeX   Abstract   Download: [pdf] 
  • Oana Ciobotaru.
    On the (Non-)Equivalence of UC Security Notions.
    In Provable Security - 6th International Conference, ProvSec 2012, Proceedings, Lecture Notes in Computer Science 7496, Springer, 2012.
    BibTeX   Abstract   Download: [pdf] 

2011

  • Ralf Küsters and Thomas Wilke.
    Moderne Kryptographie - Eine Einführung,
    Vieweg + Teubner, 2011.
    BibTeX    
  • 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), pp. 41–50, ACM Press, 2011.
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters and Max Tuengerthal.
    Composition Theorems Without Pre-Established Session Identifiers.
    Technical Report 2011/406, Cryptology ePrint Archive, 2011. http://eprint.iacr.org/2011/406/
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters, Thomas Schmidt, and Tomasz Truderung.
    Implementing a Constraint Solving Algorithm for Checking Game-Theoretic Security Requirements.
    Technical Report University of Trier, 2011. Available at http://infsec.uni-trier.de/publications.html
    BibTeX   Download: [pdf] 
  • Ralf Küsters, Tomasz Truderung, and Andreas Vogt.
    Verifiability, Privacy, and Coercion-Resistance: New Insights from a Case Study.
    Technical Report 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/
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 538–553, IEEE Computer Society, 2011.
    BibTeX   Abstract   Download: [pdf] 
  • 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, pp. 161–179, Lecture Notes in Computer Science 6558, Springer, 2011.
    BibTeX   Abstract   Download: [pdf] 
  • 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, 46(3):325–352, 2011.
    BibTeX   Abstract   Download: [pdf] 

2010

  • Michael Backes, Oana Ciobotaru, and Anton Krohmer.
    RatFish: A File Sharing Protocol Provably Secure against Rational Users.
    In Computer Security - ESORICS 2010, 15th European Symposium on Research in Computer Security, Proceedings, Lecture Notes in Computer Science 6345, Springer, 2010.
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 281–295, Lecture Notes in Computer Science 6476, Springer, 2010.
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters, Tomasz Truderung, and Andreas Vogt.
    Proving Coercion-Resistance of Scantegrity II.
    Technical Report 2010/502, Cryptology ePrint Archive, 2010. http://eprint.iacr.org/2010/502/
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters, Tomasz Truderung, and Andreas Vogt.
    Accountabiliy: Definition and Relationship to Verifiability.
    In Proceedings of the 17th ACM Conference on Computer and Communications Security (CCS 2010), pp. 526–535, ACM Press, 2010.
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 484–497, Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 50, Springer, 2010.
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters, Henning Schnoor, and Tomasz Truderung.
    A Formal Definition of Online Abuse-freeness.
    Technical Report University of Trier, 2010.
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters and Max Tuengerthal.
    Ideal Key Derivation and Encryption in Simulation-based Security.
    Technical Report 2010/295, Cryptology ePrint Archive, 2010. http://eprint.iacr.org/2010/295/
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters, Tomasz Truderung, and Andreas Vogt.
    Accountabiliy: Definition and Relationship to Verifiability.
    Cryptology ePrint Archive, Report 2010/236, 2010. http://eprint.iacr.org/2010/236
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 122–136, IEEE Computer Society, 2010.
    BibTeX   Abstract   Download: [pdf] 
  • Klaas Ole Kürtz, Henning Schnoor, and Thomas Wilke.
    Computationally Secure Two-Round Authenticated Message Exchange.
    In Proceedings of the 2010 ACM Symposium on Information, Computer and Communications Security (ASIACCS 2010), ACM, 2010. � ACM, 2010. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ASIACCS'10. http://www.acm.org/
    BibTeX   Abstract   Download: [pdf] 
  • Detlef Kähler, Ralf Küsters, and Thomas Wilke.
    Deciding Strategy Properties of Contract-Signing Protocols.
    ACM Transactions on Computational Logic (TOCL), 11(3), 2010.
    BibTeX   Abstract   Download: [pdf] 

2009

  • Klaas Ole Kürtz, Henning Schnoor, and Thomas Wilke.
    A Simulation-Based Treatment of Authenticated Message Exchange.
    In Proceedings of the 14th Asian Computing Science Conference (ASIAN 2009), pp. 109–123, Lecture Notes in Computer Science, Springer, 2009. The original publication is available at http://www.springerlink.com/
    BibTeX   Abstract   Download: [pdf] 
  • Klaas Ole Kürtz, Henning Schnoor, and Thomas Wilke.
    A Simulation-Based Treatment of Authenticated Message Exchange.
    Technical Report 2009/368, Cryptology ePrint Archive, 2009. http://eprint.iacr.org/2009/368/
    BibTeX   Abstract   Download: [pdf] 
  • Klaas Ole Kürtz, Henning Schnoor, and Thomas Wilke.
    Computationally Secure Two-Round Authenticated Message Exchange.
    Technical Report 2009/262, Cryptology ePrint Archive, 2009. http://eprint.iacr.org/2009/262/
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 91–100, ACM Press, 2009.
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters and Max Tuengerthal.
    Computational Soundness for Key Exchange Protocols with Symmetric Encryption.
    Technical Report 2009/392, Cryptology ePrint Archive, 2009. http://eprint.iacr.org/2009/392/
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 37–53, Lecture Notes in Computer Science 5767, Springer, 2009.
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 157–171, IEEE Computer Society, 2009.
    BibTeX   Abstract   Download: [pdf]   Implementation: Download: [zip] (26.2kB) 
  • Ralf Küsters and Max Tuengerthal.
    Universally Composable Symmetric Encryption.
    In Proceedings of the 22nd IEEE Computer Security Foundations Symposium (CSF 2009), pp. 293–307, IEEE Computer Society, 2009.
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters and Max Tuengerthal.
    Universally Composable Symmetric Encryption.
    Technical Report 2009/055, Cryptology ePrint Archive, 2009. http://eprint.iacr.org/2009/055/
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 251–266, IEEE Computer Society, 2009.
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters and Tomasz Truderung.
    An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols.
    Technical Report arXiv:0903.0802, arXiv, 2009. Available at http://arxiv.org/abs/0903.0802
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters, Tomasz Truderung, and Andreas Vogt.
    A Game-Based Definition of Coercion-Resistance and its Applications.
    Technical Report 2009/582, Cryptology ePrint Archive, 2009. http://eprint.iacr.org/2009/582
    BibTeX   Abstract   Download: [pdf] 

2008

  • M. Backes, M. Dürmuth, D. Hofheinz, and R. Küsters.
    Conditional Reactive Simulatability.
    International Journal of Information Security (IJIS), 7(2):155–169, Springer, April 2008.
    BibTeX   Abstract   Download: [pdf] 
  • 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), 9(4), 2008.
    BibTeX   Abstract   Download: [pdf] 
  • P. Degano, R. Küsters, L. Viganó, and S. Zdancewic (editors).
    Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis.
    Information and Computation, 206(2-4):129–490, February-April 2008.
    BibTeX    
  • R. Küsters, A. Datta, J. C. Mitchell, and A. Ramanathan.
    On the Relationships Between Notions of Simulation-Based Security.
    Journal of Cryptology, 21(4):492–546, 2008. Electronic publication http://dx.doi.org/10.1007/s00145-008-9019-9
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters and Tomasz Truderung.
    Reducing Protocol Analysis with XOR to the XOR-free Case in the Horn Theory Based Approach.
    Technical Report arXiv:0808.0634v1, University of Trier, 2008. Available at http://arxiv.org/abs/0808.0634v1
    BibTeX   Abstract   Download: [pdf]   Implementation: Download: [zip] (18.8kB) 
  • 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), pp. 129–138, ACM Press, 2008.
    BibTeX   Abstract   Download: [pdf]   Implementation: Download: [zip] (18.8kB) 
  • 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), pp. 270–284, IEEE Computer Society, 2008.
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters and Max Tuengerthal.
    Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation.
    Technical Report 2008/006, Cryptology ePrint Archive, April 2008. http://eprint.iacr.org/2008/006/
    BibTeX   Abstract   Download: [pdf] 
  • Oana Ciobotaru.
    Efficient long-term secure universally composable commitments.
    Master's Thesis, 2008.
    BibTeX   Abstract   Download: [pdf] 

2007

  • M. Backes, M. Dürmuth, and R. Küsters.
    On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography.
    Cryptology ePrint Archive, Report 2007/233, 2007. http://eprint.iacr.org/2007/233/
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 108–120, Lecture Notes in Computer Science 4855, Springer, 2007.
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 422–437, Lecture Notes in Computer Science 4734, Springer, 2007.
    BibTeX   Abstract   Download: [pdf] 
  • V. Cortier, R. Küsters, and B. Warinschi.
    A Cryptographic Model for Branching Time Security Properties -- the Case of Contract Signing Protocols.
    Cryptology ePrint Archive, Report 2007/251, 2007. http://eprint.iacr.org/2007/251/
    BibTeX   Abstract   Download: [pdf] 
  • Detlef Kähler, Ralf Küsters, and Tomasz Truderung.
    Infinite State AMC-Model Checking for Cryptographic Protocols.
    Technical Report 0702, Institut für Informatik, CAU Kiel, Germany, 2007.
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 181–190, IEEE, Computer Society Press, 2007.
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 61–70, ACM Press, 2007.
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 161–190, University of the Basque Country Press, 2007.
    BibTeX   Abstract    
  • 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), pp. 646–657, Lecture Notes in Computer Science 4393, Springer, 2007.
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters and Tomasz Truderung.
    On the Automatic Analysis of Recursive Security Protocols with XOR.
    Technical Report ETH Zurich, 2007. An abridged version appears in STACS 2007
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters and Thomas Wilke.
    Transducer-based analysis of cryptographic protocols.
    Information and Computation, 205(12):1741–1776, 2007.
    BibTeX   Abstract   Download: [pdf] 

2006

  • F. Baader and R. Küsters.
    Non-Standard Inferences in Description Logics: The Story So Far.
    In D. M. Gabbay, S. S. Goncharov, and M. Zakharyaschev, editors, Mathematical Problems from Applied Logic I. Logics for the XXIst Century, International Mathematical Series, pp. 1–75, Springer-Verlag, 2006.
    BibTeX   Abstract   Download: [pdf] [ps.gz] 
  • M. Backes, M. Dürmuth, D. Hofheinz, and R. Küsters.
    Conditional Reactive Simulatability.
    Technical Report 2006/132, Cryptology ePrint Archive, 2006. http://eprint.iacr.org/2006/132/
    BibTeX   Abstract   Download: [ps.gz] 
  • 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), pp. 424–443, Lecture Note in Computer Science 4189, Springer, 2006.
    BibTeX   Abstract   Download: [pdf] [ps.gz] 
  • V. Cortier, S. Kremer, R. Küsters, and B. Warinschi.
    Computationally Sound Symbolic Secrecy in the Presence of Hash Functions.
    Cryptology ePrint Archive, Report 2006/218, 2006. http://eprint.iacr.org/2006/218/
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 176–187, Lecture Notes in Computer Science 4337, Springer, 2006.
    BibTeX   Abstract   Download: [ps.gz] 
  • A. Datta, R. Küsters, J. Mitchell, and A. Ramanathan.
    On the Relationships Between Notions of Simulation-Based Security.
    Technical Report 2006/153, Cryptology ePrint Archive, 2006. http://eprint.iacr.org/2006/153/
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 95–106, Lecture Notes in Computer Science 4052, Springer, 2006.
    BibTeX   Abstract   Download: [pdf] [ps.gz] 
  • Detlef Kähler, Ralf Küsters, and Thomas Wilke.
    A Dolev-Yao-based Definition of Abuse-free Protocols.
    Technical Report 0607, Institut für Informatik, CAU Kiel, Germany, 2006.
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters.
    Simulation-Based Security with Inexhaustible Interactive Turing Machines.
    In Proceedings of the 19th IEEE Computer Security Foundations Workshop (CSFW-19 2006), pp. 309–320, IEEE Computer Society, 2006.
    BibTeX   Abstract   Download: [pdf] [ps.gz] 
  • Ralf Küsters.
    Simulation-Based Security with Inexhaustible Interactive Turing Machines.
    Technical Report 2006/151, Cryptology ePrint Archive, 2006. http://eprint.iacr.org/2006/151/
    BibTeX   Abstract   Download: [pdf] 
  • 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.
    BibTeX   Download: [pdf] 
  • Max Tuengerthal.
    Implementing a Unification Algorithm for Protocol Analysis with XOR.
    Technical Report 0609, Institut für Informatik, CAU Kiel, Germany, 2006.
    BibTeX   Abstract   Download: [pdf] [ps.gz] 

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, 125(1):55–66, 2005.
    BibTeX   Abstract   Download: [pdf] 
  • Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani.
    An NP decision procedure for protocol insecurity with XOR.
    Theoretical Computer Science, 338(1--3):247–274, 2005.
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 476–494, Lecture Notes in Computer Science 3378, Springer-Verlag, 2005.
    BibTeX   Abstract   Download: [pdf] [ps.gz] 
  • 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), pp. 233–247, Lecture Notes in Computer Science 3653, Springer, 2005.
    BibTeX   Abstract   Download: [pdf] [ps.gz] 
  • 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.
    BibTeX   Abstract   Download: [pdf] [ps.gz] 
  • Detlef Kähler and Ralf Küsters.
    A Constraint-Based Algorithm for Constract-Signing Protocols.
    Technical Report 0503, Institut für Informatik, CAU Kiel, Germany, 2005.
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 158–169, Lecture Notes in Computer Science, Springer-Verlag, 2005.
    BibTeX   Abstract   Download: [pdf] [ps.gz] 
  • Ralf Küsters.
    On the Decidability of Cryptographic Protocols with Open-ended Data Structures.
    International Journal of Information Security, 4(1--2):49–70, 2005. Online publication appeared 2004. DOI: 10.1007/s10207-004-0050-z.
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters and John Mitchell (ed.).
    Proceedings of the 2005 ACM Workshop on Formal Methods in Security Engineering (co-located with CCS 2005).
    ACM Press, Fairfax, Virginia, USA, November 11 2005.
    BibTeX    
  • Ralf Küsters and Ralf Molitor.
    Structural Subsumption and Least Common Subsumers in a Description Logic with Existential and Number Restrictions.
    Studia Logica, 81:227–259, 2005.
    BibTeX   Abstract   Download: [ps.gz] 
  • Tomasz Truderung.
    Regular Protocols and Attacks with Regular Knowledge.
    In Automated Deduction - CADE-20, 20th International Conference on Automated Deduction, pp. 377–391, Lecture Notes in Computer Science 3632, Springer, 2005.
    BibTeX   Download: [pdf] 
  • Tomasz Truderung.
    Selecting Theories and Recursive Protocols.
    In CONCUR 2005 - Concurrency Theory, 16th International Conference, pp. 217–232, Lecture Notes in Computer Science 3653, Springer, 2005.
    BibTeX   Download: [pdf] 

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.
    BibTeX   Abstract   Download: [pdf] [ps.gz] 
  • Anupam Datta, Ralf Küsters, John C. Mitchell, and Ajith Ramanathan.
    Sequential Probabilisitic Process Calculus and Simulation-Based Security.
    Technical Report Institut für Informatik, CAU Kiel, 2004.
    BibTeX   Abstract   Download: [ps.gz] 
  • 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.
    BibTeX   Abstract   Download: [ps.gz] 
  • Detelf Kähler, Ralf Küsters, and Thomas Wilke.
    Deciding Properties of Contract-Signing Protocols.
    Technical Report 0409, Institut für Informatik und Praktische Mathematik, CAU Kiel, Germany, 2004.
    BibTeX   Abstract   Download: [pdf] 
  • Ralf Küsters and Thomas Wilke.
    Automata-based Analysis of Recursive Cryptographic Protocols.
    In 21st Symposium on Theoretical Aspects of Computer Science (STACS 2004), pp. 382–393, Lecture Notes in Computer Science 2996, Springer-Verlag, 2004.
    BibTeX   Abstract   Download: [ps.gz] 
  • Pawel Rychlikowski and Tomasz Truderung.
    Set Constraints on Regular Terms.
    In Computer Science Logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings, pp. 458–472, Lecture Notes in Computer Science, Springer, 2004.
    BibTeX   Download: [pdf] 

2003

  • F. Baader, R. Küsters, and F. Wolter.
    Extensions to Description Logics.
    In F. Baader, D. Calvanese, D.L. McGuinness, D. Nardi, and P.F. Patel-Schneider, editors, The Description Logics Handbook: Theory, Implementation and Applications, pp. 219–261, Cambridge University Press, 2003.
    BibTeX   Download: [HTML] 
  • 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), pp. 122–136, Lecture Notes in Artificial Intelligence 2850, Springer, 2003.
    BibTeX   Abstract   Download: [ps.gz] 
  • 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, pp. 124–135, Lecture Notes in Computer Science 2914, Springer, 2003.
    BibTeX   Abstract   Download: [ps.gz] 
  • Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani.
    An NP Decision Procedure for Protocol Insecurity with XOR.
    Technical Report RR-4697, INRIA, January 2003.
    BibTeX   Abstract   Download: [pdf] 
  • 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), pp. 261–270, IEEE Computer Society Press, 2003.
    BibTeX   Abstract   Download: [pdf] 
  • Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani.
    Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents.
    Technical Report 0305, Institut für Informatik und Praktische Mathematik, CAU Kiel, Germany, 2003. Available from http://www.informatik.uni-kiel.de/ifi/forschung/technische-berichte/
    BibTeX   Abstract   Download: [pdf] [ps.gz] 
  • 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), pp. 128–141, Lecture Note in Computer Science 2803, Springer-Verlag, 2003.
    BibTeX   Abstract   Download: [ps.gz] 
  • Ralf Küsters.
    Tree Transducer-based Analysis of Cryptographic Protocols.
    Technical Report 0301, Institut für Informatik und Praktische Mathematik, CAU Kiel, Germany, 2003. Available from http://www.informatik.uni-kiel.de/ifi/forschung/technische-berichte/
    BibTeX   Abstract   Download: [ps.gz] [ps] 
  • Ralf Küsters and Thomas Wilke.
    Automata-based Analysis of Recursive Cryptographic Protocols.
    Technical Report 0311, Institut für Informatik und Praktische Mathematik, CAU Kiel, Germany, 2003. Available from http://www.informatik.uni-kiel.de/ifi/forschung/technische-berichte/
    BibTeX   Abstract   Download: [pdf] 

2002

  • Ralf Küsters.
    Memoryless Determinacy of Parity Games.
    In Automata, Logics, and Infinite Games: A Guide to Current Research, pp. 95–106, Lecture Notes in Computer Science 2500, Springer, 2002.
    BibTeX   Download: [HTML] 
  • 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/
    BibTeX   Abstract   Download: [ps.gz] 
  • S. Brandt, R. Küsters, and A.-Y. Turhan.
    Approximating $\mathcalALCN$-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/
    BibTeX   Abstract   Download: [ps.gz] 
  • 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), pp. 203–214, Morgan Kaufmann Publishers, 2002.
    BibTeX   Abstract   Download: [ps.gz] 
  • 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, pp. 3–12, 2002. This is an extended and revised version of the CONCUR 2002 paper.
    BibTeX   Abstract   Download: [ps.gz] 
  • Ralf Küsters.
    On the Decidability of Cryptographic Protocols with Open-ended Data Structures.
    In 13th International Conference on Concurrency Theory (CONCUR 2002), pp. 515–530, Lecture Notes in Computer Science 2421, Springer-Verlag, 2002.
    BibTeX   Abstract   Download: [ps.gz] 
  • Ralf Küsters.
    On the Decidability of Cryptographic Protocols with Open-ended Data Structures.
    Technical Report 0204, Institut für Informatik und Praktische Mathematik, CAU Kiel, Germany, 2002. Available from http://www.informatik.uni-kiel.de/ifi/forschung/technische-berichte/
    BibTeX   Abstract   Download: [ps.gz] 
  • Ralf Küsters and Ralf Molitor.
    Approximating Most Specific Concepts in Description Logics with Existential Restrictions.
    AI Communications, 15(1):47–59, 2002.
    BibTeX   Abstract    
  • 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, pp. 241–252, Lecture Notes in Computer Science 2556, Springer-Verlag, 2002.
    BibTeX   Abstract   Download: [ps.gz] 
  • Ralf Küsters and Thomas Wilke.
    Deciding the First Level of the $\mu$-calculus Alternation Hierarchy.
    Technical Report 0209, Institut für Informatik und Praktische Mathematik, CAU Kiel, Germany, 2002. Available from http://www.informatik.uni-kiel.de/ifi/forschung/technische-berichte/
    BibTeX   Abstract   Download: [ps.gz] 
  • Jerzy Marcinkowski and Tomasz Truderung.
    Optimal Complexity Bounds for Positive LTL Games.
    In Computer Science Logic, CSL 2002, , pp. 262–275, Lecture Notes in Computer Science 2471, Springer, 2002.
    BibTeX   Download: [pdf] 

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), pp. 213–218, Morgan Kaufman, 2001.
    BibTeX   Abstract   Download: [ps.gz] 
  • F. Baader, S. Brandt, and R. Küsters.
    Matching under Side Conditions in Description Logics.
    LTCS-Report 01-02, LuFG Theoretical Computer Science, RWTH Aachen, 2001.
    BibTeX   Abstract   Download: [ps.gz] 
  • 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. Proceedings online available from http://SunSITE.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/
    BibTeX   Abstract   Download: [ps.gz] 
  • 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), Lecture Notes in Artificial Intelligence 2250, Springer-Verlag, Vienna, Austria, 2001.
    BibTeX   Abstract   Download: [ps.gz] 
  • F. Baader and R. Küsters.
    Unification in a Description Logic with Transitive Closure of Roles.
    LTCS-Report 01-05, LuFG Theoretical Computer Science, RWTH Aachen, 2001. See http://www.informatik.rwth-aachen.de/Forschung/aib.php.
    BibTeX   Abstract   Download: [ps.gz] 
  • F. Baader and R. Küsters.
    Solving Linear Equations over Regular Languages.
    In Proceedings of the 15th International Workshop on Unification (UNIF 2001), pp. 27–31, 2001. Available via http://goedel.cs.uiowa.edu/unif2001/
    BibTeX   Download: [ps.gz] 
  • Ralf Küsters.
    Non-Standard Inferences in Description Logics,
    Lecture Notes in Artificial Intelligence 2100, Springer-Verlag, 2001. Ph.D. thesis
    BibTeX   Abstract   Download: [ps.gz] 
  • Ralf Küsters and Alex Borgida.
    What's in an Attribute? Consequences for the Least Common Subsumer.
    Journal of Artificial Intelligence Research, 14:167–203, 2001.
    BibTeX   Abstract   Download: [ps.gz] 
  • 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), pp. 219–224, Morgan Kaufman, 2001.
    BibTeX   Abstract   Download: [ps.gz] 
  • 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), pp. 33–47, Lecture Notes in Artificial Intelligence 2174, Springer-Verlag, Vienna, Austria, 2001.
    BibTeX   Abstract   Download: [ps.gz] 

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), pp. 261–272, Morgan Kaufmann Publishers, San Francisco, CA, 2000.
    BibTeX   Abstract   Download: [ps.gz] 
  • 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), pp. 297–308, Morgan Kaufmann Publishers, San Francisco, CA, 2000.
    BibTeX   Abstract   Download: [ps.gz] 
  • F. Baader, R. Küsters, and R. Molitor.
    Rewriting Concepts Using Terminologies -- Revisited.
    LTCS-Report 00-04, LuFG Theoretical Computer Science, RWTH Aachen, 2000. See http://www.informatik.rwth-aachen.de/Forschung/aib.php.
    BibTeX   Abstract   Download: [ps.gz] 
  • 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), CEUR-WS, RWTH Aachen, Aachen, Germany, 2000. Proceedings online available from http://SunSITE.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/Vol-33/
    BibTeX   Abstract   Download: [ps.gz] 
  • R. Küsters and R. Molitor.
    Computing Most Specific Concepts in Description Logics with Existential Restrictions.
    LTCS-Report 00-05, LuFG Theoretical Computer Science, 2000.
    BibTeX   Abstract   Download: [ps.gz] 
  • R. Küsters and R. Molitor.
    Computing Least Common Subsumers in ALEN.
    LTCS-Report 00-07, LuFG Theoretical Computer Science, RWTH Aachen, 2000.
    BibTeX   Abstract   Download: [ps.gz] 

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), pp. 96–101, Morgan Kaufmann, 1999.
    BibTeX   Abstract   Download: [ps.gz] 
  • F. Baader, R. Küsters, A. Borgida, and D. McGuinness.
    Matching in Description Logics.
    Journal of Logic and Computation, 9(3):411–447, 1999.
    BibTeX   Abstract    
  • 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), CEUR-WS, Linköping University, Sweden, 1999. Proceedings online available from http://SunSITE.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/Vol-22/
    BibTeX   Abstract   Download: [ps.gz] 
  • F. Baader and R. Küsters.
    Matching in Description Logics with Existential Restrictions.
    LTCS-Report LTCS-99-07, LuFg Theoretical Computer Science, RWTH Aachen, 1999. See http://www.informatik.rwth-aachen.de/Forschung/aib.php
    BibTeX   Abstract   Download: [ps.gz] 
  • F. Baader and R. Küsters.
    Matching Concept Descriptions with Existential Restrictions Revisited.
    LTCS-Report LTCS-99-13, LuFG Theoretical Computer Science, RWTH Aachen, 1999. See http://www.informatik.rwth-aachen.de/Forschung/aib.php.
    BibTeX   Abstract   Download: [ps.gz] 
  • F. Baader, R. Küsters, and R. Molitor.
    Rewriting Concepts Using Terminologies -- Revisited.
    LTCS-Report 99-12, LuFG Theoretical Computer Science, RWTH Aachen, 1999. Please refer to the revised version LTCS-Report 00-04.
    BibTeX   Abstract   Download: [ps.gz] 
  • A. Borgida and R. Küsters.
    What's not in a name? Initial Explorations of a Structural Approach to Integrating Large Concept Knowledge-Bases.
    Technical Report DCS-TR-391, Rutgers University, USA, 1999.
    BibTeX   Download: [ps.gz] 
  • 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, Dagstuhl-Seminar-Report 244, 1999. ISSN 0940-1121. Joint work with Alex Borgida (http://www.cs.rutgers.edu/~borgida/)
    BibTeX   Abstract    
  • R. Küsters and A. Borgida.
    What's in an Attribute? Consequences for the Least Common Subsumer.
    Technical Report DCS-TR-404, Rutgers University, USA, 1999.
    BibTeX   Abstract   Download: [ps.gz] 

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.
    BibTeX   Abstract   Download: [ps.gz] 
  • 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.
    BibTeX   Abstract   Download: [ps.gz] 
  • F. Baader and R. Küsters.
    Computing the least common subsumer and the most specific concept in the presence of cyclic $\mathcalALN$-concept descriptions.
    In Proceedings of the 22nd Annual German Conference on Artificial Intelligence, KI-98, pp. 129–140, Lecture Notes in Computer Science 1504, Springer-Verlag, Bremen, Germany, 1998.
    BibTeX   Abstract   Download: [ps.gz] 
  • F. Baader and R. Küsters.
    Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions.
    LTCS-Report LTCS-98-06, LuFg Theoretical Computer Science, RWTH Aachen, Germany, 1998.
    BibTeX   Abstract   Download: [ps.gz] 
  • F. Baader, R. Küsters, and R. Molitor.
    Structural Subsumption Considered from an Automata Theoretic Point of View.
    LTCS-Report LTCS-98-04, LuFG Theoretical Computer Science, RWTH Aachen, 1998. See http://www.informatik.rwth-aachen.de/Forschung/aib.php.
    BibTeX   Abstract   Download: [ps.gz] 
  • F. Baader, R. Küsters, and R. Molitor.
    Computing Least Common Subsumers in Description Logics with Existential Restrictions.
    LTCS-Report LTCS-98-09, LuFG Theoretical Computer Science, RWTH Aachen, 1998. See http://www.informatik.rwth-aachen.de/Forschung/aib.php.
    BibTeX   Abstract   Download: [ps.gz] 
  • 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), pp. 499–510, Morgan Kaufmann, 1998.
    BibTeX   Abstract   Download: [ps.gz] 

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, pp. 10–14, LRI, Universitè PARIS-SUD, Cente d'Orsay, 1997.
    BibTeX   Abstract   Download: [ps.gz] 
  • R. Küsters.
    Characterizing the semantics of terminological cycles in ALN using finite automata.
    LTCS-Report LTCS-97-04, LuFg Theoretical Computer Science, RWTH Aachen, Germany, 1997.
    BibTeX   Abstract   Download: [ps.gz]