Publications

Here, you find a full list of publications of members of the institute.

  1. 2020

    1. 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, 2020. To appear.
    2. Ralf Küsters, Daniel Rausch, and Mike Simon, “Accountability in a Permissioned Blockchain: Formal Analysis of Hyperledger Fabric,” in IEEE European Symposium on Security and Privacy, EuroS&P 2020, 2020. To appear.
  2. 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), 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, 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 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8-12, 2019, Proceedings, Part III, 2019, vol. 11923, 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/1037, 2019.
    6. Benjamin Hilprecht, Martin Härterich, and Daniel Bernau, “Reconstruction and Membership Inference Attacks against Generative Models,” CoRR, vol. abs/1906.03006, 2019.
    7. Benjamin Hilprecht, Martin Härterich, and Daniel Bernau, “Monte Carlo and Reconstruction Membership Inference Attacks against Generative Models,” PoPETs, vol. 2019, no. 4, pp. 232--249, 2019.
    8. Ralf Küsters, Julian Liedtke, Johannes Müller, Daniel Rausch, and Andreas Vogt, “Ordinos: A Verifiable Tally-Hiding Remote E-Voting System,” 2019.
    9. 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, 2019. To appear. See also https://eprint.iacr.org/2008/006 for the technical report.
    10. Ralf Küsters, Max Tuengerthal, and Daniel Rausch, “The IITM Model: a Simple and Expressive Model for Universal Composability,” Journal of Cryptology, 2019. To appear. See also https://eprint.iacr.org/2013/025 for the technical report.
    11. 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), 2019, vol. 1, pp. 1054–1072.
    12. Daniel Fett, Pedram Hosseyni, and Ralf Küsters, “An Extensive Formal Security Analysis of the OpenID Financial-grade API,” arXiv, Technical Report arXiv:1901.11520, 2019. Available at http://arxiv.org/abs/1901.11520.
  3. 2018

    1. Enrico Scapin, “Implementation-level analysis of cryptographic protocols and their applications to e-voting systems,” University of Stuttgart, Germany, 2018.
    2. Günther Eibl, Kaibin Bao, Philip-William Grassal, Daniel Bernau, and Hartmut Schmeck, “The Influence of Differential Privacy on Short Term Electric Load Forecasting,” CoRR, vol. abs/1807.02361, 2018.
    3. Benjamin Weggenmann and Florian Kerschbaum, “SynTF: Synthetic and Differentially Private Term Frequency Vectors for Privacy-Preserving Text Mining,” in The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval, SIGIR 2018, Ann Arbor, MI, USA, July 08-12, 2018, 2018, pp. 305--314.
    4. Benjamin Weggenmann and Florian Kerschbaum, “SynTF: Synthetic and Differentially Private Term Frequency Vectors for Privacy-Preserving Text Mining,” CoRR, vol. abs/1805.00904, 2018.
    5. 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. Available at http://eprint.iacr.org/2013/025/. This is an updated version of the technical report from 2013. Compared to the previous version, we added a discussion on Canetti’s UC model, version July 2013. We provided more examples of how the IITM model can be used. The actual model did not change at all.
    6. Daniel Fett, “An Expressive Formal Model of the Web Infrastructure,” 2018. received an award from the “Vereinigung von Freunden der Universität Stuttgart” in 2019.
    7. 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, vol. 10804. Springer, 2018.
  4. 2017

    1. Jonas Böhler, Daniel Bernau, and Florian Kerschbaum, “Privacy-Preserving Outlier Detection for Data Streams,” in Data and Applications Security and Privacy XXXI - 31st Annual IFIP WG 11.3 Conference, DBSec 2017, Philadelphia, PA, USA, July 19-21, 2017, Proceedings, 2017, vol. 10359, pp. 225--238.
    2. Anselme Tueno, Florian Kerschbaum, Daniel Bernau, and Sara Foresti, “Selective access for supply chain management in the cloud,” in 2017 IEEE Conference on Communications and Network Security, CNS 2017, Las Vegas, NV, USA, October 9-11, 2017, 2017, pp. 476--482.
    3. Quoc Huy Do, Richard Bubel, and Reiner Hähnle, “Inferring Secrets by Guided Experiments,” in Theoretical Aspects of Computing - ICTAC 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings, 2017, pp. 269–287. Best paper award.
    4. Quoc Huy Do, “Detection and Exploitation of Information Flow Leaks,” 2017. Available at http://tuprints.ulb.tu-darmstadt.de/6258/.
    5. Quoc Huy Do, Richard Bubel, and Reiner Hähnle, “Automatic detection and demonstrator generation for information flow leaks in object-oriented programs,” Computers & Security, vol. 67, pp. 335–349, 2017.
    6. 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, 2017, vol. 10615, pp. 21–41. Invited paper.
    7. 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), 2017, pp. 189--202.
    8. Daniel Fett, Ralf Küsters, and Guido Schmitz, “The Web SSO Standard OpenID Connect: In-Depth Formal Security Analysis and Security Guidelines,” arXiv, Technical Report arXiv:1704.08539, 2017. Available at http://arxiv.org/abs/1704.08539.
    9. Ralf Küsters and Daniel 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.
    10. Ralf Küsters and Daniel Rausch, “A Framework for Universally Composable Diffie-Hellman Key Exchange,” Cryptology ePrint Archive, Technical Report 2017/256, 2017. Available at http://eprint.iacr.org/2017/256.
  5. 2016

    1. Vassil Dimitrov, Liisi Kerik, Toomas Krips, Jaak Randmets, and Jan Willemson, “Alternative Implementations of Secure Real Numbers,” in Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, October 24-28, 2016, 2016, pp. 553--564.
    2. Vassil Dimitrov, Liisi Kerik, Toomas Krips, Jaak Randmets, and Jan Willemson, “Alternative Implementations of Secure Real Numbers,” IACR Cryptology ePrint Archive, vol. 2016, p. 773, 2016.
    3. Quoc Huy Do, Eduard Kamburjan, and Nathan Wasser, “Towards Fully Automatic Logic-Based Information Flow Analysis: An Electronic-Voting Case Study,” in Principles of Security and Trust - 5th International Conference, POST 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings, 2016, pp. 97–115.
    4. 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, 2016, vol. P-259, pp. 1195--1196.
    5. 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, 2016, pp. 807--840.
    6. Tilman Dingler, Corinna Giebler, Ulf Kunze, Tim Würtele, Niels Henze, and Albrecht Schmidt, “Memory displays: investigating the effects of learning in the periphery,” in Proceedings of the 5th ACM International Symposium on Pervasive Displays, PerDis 2016, Oulu, Finland, June 20 - 22, 2016, 2016, pp. 118--123.
    7. 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), 2016, pp. 1204--1215.
    8. 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.
    9. 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), 2016, pp. 341--354.
    10. 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), 2016, pp. 779--798.
    11. 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.
    12. Jan Camenisch, Robert R. Enderlein, Stephan Krenn, Ralf Küsters, and Daniel Rausch, “Universal Composition with Responsive Environments,” Cryptology ePrint Archive, Report 2016/034, 2016. Available at http://eprint.iacr.org/2016/034.
    13. Daniel Fett, Ralf Küsters, and Guido Schmitz, “A Comprehensive Formal Security Analysis of OAuth 2.0,” arXiv, Technical Report arXiv:1601.01229, 2016. Available at http://arxiv.org/abs/1601.01229.
    14. 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), 2016, pp. 227--242.
  6. 2015

    1. Toomas Krips and Jan Willemson, “Point-Counting Method for Embarrassingly Parallel Evaluation in Secure Computation,” in Foundations and Practice of Security - 8th International Symposium, FPS 2015, Clermont-Ferrand, France, October 26-28, 2015, Revised Selected Papers, 2015, vol. 9482, pp. 66--82.
    2. Quoc Huy Do, Richard Bubel, and Reiner Hähnle, “Exploit Generation for Information Flow Leaks in Object-Oriented Programs,” in ICT Systems Security and Privacy Protection - 30th IFIP TC 11 International Conference, SEC 2015, Hamburg, Germany, May 26-28, 2015, Proceedings, 2015, pp. 401--415.
    3. Enrico Scapin, “A Proof Technique for Noninterference In Open Systems,” University of Trier, 2015.
    4. Enrico Scapin, “A Proof Technique for Noninterference In Open Systems,” Workshop on Foundations of Computer Security (FCS 2015). 2015.
    5. Daniel Fett, Ralf Küsters, and Guido Schmitz, “SPRESSO: A Secure, Privacy-Respecting Single Sign-On System for the Web,” arXiv, Technical Report arXiv:1508.01719, 2015. Available at http://arxiv.org/abs/1508.01719.
    6. 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), 2015, pp. 1358--1369.
    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,” 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.
    8. 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.
    9. 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, 2015, pp. 305--319.
    10. 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.
    11. 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, Technical Report arXiv:1411.7210v2, 2015. Available at http://arxiv.org/abs/1411.7210v2.
  7. 2014

    1. Toomas Krips and Jan Willemson, “Hybrid Model of Fixed and Floating Point Numbers in Secure Multiparty Computations,” in Information Security - 17th International Conference, ISC 2014, Hong Kong, China, October 12-14, 2014. Proceedings, 2014, vol. 8783, pp. 179--197.
    2. Toomas Krips and Jan Willemson, “Hybrid Model of Fixed and Floating Point Numbers in Secure Multiparty Computations,” IACR Cryptology ePrint Archive, vol. 2014, p. 221, 2014.
    3. Michael Weiß, Benjamin Weggenmann, Moritz August, and Georg Sigl, “On Cache Timing Attacks Considering Multi-core Aspects in Virtualized Embedded Systems,” in Trusted Systems - 6th International Conference, INTRUST 2014, Beijing, China, December 16-17, 2014, Revised Selected Papers, 2014, vol. 9473, pp. 151--167.
    4. Ralf Küsters, “E-Voting Systems,” in Software Systems Safety, O. Grumberg, H. Seidl, and M. Irlbeck, Eds. IOS Press, 2014, pp. 135--164.
    5. Ralf Küsters and Tomasz Truderung, “Security in E-Voting,” it - Information Technology, vol. 56, no. 6, pp. 300--306, 2014.
    6. 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/.
    7. Enrico Scapin and Fausto Spoto, “Field-sensitive unreachability and non-cyclicity analysis,” Sci. Comput. Program., vol. 95, pp. 359--375, 2014. Available at http://dx.doi.org/10.1016/j.scico.2014.03.012.
    8. 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/.
    9. Daniel Fett, Ralf Küsters, and Guido Schmitz, “An Expressive Model for the Web Infrastructure: Definition and Application to the BrowserID SSO System,” arXiv, Technical Report arXiv:1403.1866, 2014. Available at http://arxiv.org/abs/1403.1866.
    10. 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), 2014, pp. 673–688.
    11. 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), 2014, pp. 343–358. Download the full and revised version: http://eprint.iacr.org/2014/341/.
    12. 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, 2014, vol. 8414, pp. 220--239. A full version is available at http://eprint.iacr.org/2014/038.
  8. 2013

    1. Max Tuengerthal, “Analysis of real-world security protocols in a universal composability framework,” University of Trier, 2013.
    2. Ralf Küsters and Max Tuengerthal, “The IITM Model: a Simple and Expressive Model for Universal Composability,” Cryptology ePrint Archive, Technical Report 2013/025, 2013.
    3. Oana Ciobotaru, “Rational Cryptography: Novel Constructions, Automated Verification and Unified Definitions,” 2013.
    4. Michael Backes, Oana Ciobotaru, and Matteo Maffei, “Towards Automated Verification of Rational Cryptographic Protocols.” 2013. In Preparation.
    5. Enrico Scapin and Fausto Spoto, “Field-Sensitive Unreachability and Non-Cyclicity Analysis,” ETAPS/BYTECODE. 2013.
  9. 2012

    1. Enrico Scapin, “Field-Sensitive Unreachability and Non-Cyclicity Analysis,” 2012.
    2. 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, 2012, pp. 198–212.
    3. 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.
    4. Ralf Küsters, Tomasz Truderung, and Andreas Vogt, “Clash Attacks on the Verifiability of E-Voting Systems,” Cryptology ePrint Archive, Technical Report 2012/116, 2012.
    5. 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), 2012, pp. 395–409.
    6. A. Vogt, “Universal Interpolation,” ANALYSIS, vol. 32, pp. 87–96, 2012.
    7. A. Vogt, “On bounded universal Functions,” Computational Methods and Function Theory, vol. 12, no. 1, pp. 213–219, 2012.
    8. A. Vogt, “Universal properties of approximation operators,” Journal of Approximation Theory, vol. 164, pp. 367–370, 2012.
    9. 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.
    10. Oana Ciobotaru, “On the (Non-)Equivalence of UC Security Notions,” in Provable Security - 6th International Conference, ProvSec 2012, Proceedings, 2012, vol. 7496.
  10. 2011

    1. Ralf Küsters and Thomas Wilke, Moderne Kryptographie - Eine Einführung. Vieweg + Teubner, 2011.
    2. 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), 2011, pp. 41–50.
    3. Ralf Küsters and Max Tuengerthal, “Composition Theorems Without Pre-Established Session Identifiers,” Cryptology ePrint Archive, Technical Report 2011/406, 2011.
    4. 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.
    5. 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/.
    6. 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), 2011, pp. 538--553.
    7. 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, 2011, vol. 6558, pp. 161–179.
    8. 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.
  11. 2010

    1. Quoc Huy Do, “Using SMT solver and symbolic execution to generate test inputs for C programs,” 2010. Available at http://repository.vnu.edu.vn/handle/VNU_123/42121.
    2. Quoc Huy Do, Anh Hoang Truong, and Ngoc Binh Nguyen, “Extending CREST with Multiple SMT Solvers and Real Arithmetic,” in 2010 Second International Conference on Knowledge and Systems Engineering, 2010, pp. 183–187.
    3. 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, 2010, vol. 6345.
    4. 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), 2010, vol. 6476, pp. 281–295.
    5. Ralf Küsters, Tomasz Truderung, and Andreas Vogt, “Proving Coercion-Resistance of Scantegrity II,” Cryptology ePrint Archive, Technical Report 2010/502, 2010.
    6. 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), 2010, pp. 526--535.
    7. 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), 2010, vol. 50, pp. 484–497.
    8. Ralf Küsters, Henning Schnoor, and Tomasz Truderung, “A Formal Definition of Online Abuse-freeness,” University of Trier, 2010.
    9. Ralf Küsters and Max Tuengerthal, “Ideal Key Derivation and Encryption in Simulation-based Security,” Cryptology ePrint Archive, Technical Report 2010/295, 2010.
    10. Ralf Küsters, Tomasz Truderung, and Andreas Vogt, “Accountability: Definition and Relationship to Verifiability,” IACR Cryptology ePrint Archive, vol. 2010. p. 236, 2010.
    11. 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), 2010, pp. 122–136.
    12. 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), 2010. (C) 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/.
    13. 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.
  12. 2009

    1. 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), 2009, no. 5913, pp. 109--123. The original publication is available at http://www.springerlink.com/.
    2. Klaas Ole Kürtz, Henning Schnoor, and Thomas Wilke, “A Simulation-Based Treatment of Authenticated Message Exchange,” Cryptology ePrint Archive, Technical Report 2009/368, 2009.
    3. Klaas Ole Kürtz, Henning Schnoor, and Thomas Wilke, “Computationally Secure Two-Round Authenticated Message Exchange,” Cryptology ePrint Archive, Technical Report 2009/262, 2009.
    4. 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), 2009, pp. 91--100.
    5. Ralf Küsters and Max Tuengerthal, “Computational Soundness for Key Exchange Protocols with Symmetric Encryption,” Cryptology ePrint Archive, Technical Report 2009/392, 2009.
    6. 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), 2009, vol. 5767, pp. 37–53.
    7. 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), 2009, pp. 157--171.
    8. Ralf Küsters and Max Tuengerthal, “Universally Composable Symmetric Encryption,” in Proceedings of the 22nd IEEE Computer Security Foundations Symposium (CSF 2009), 2009, pp. 293--307.
    9. Ralf Küsters and Max Tuengerthal, “Universally Composable Symmetric Encryption,” Cryptology ePrint Archive, Technical Report 2009/055, 2009.
    10. 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), 2009, pp. 251--266.
    11. Ralf Küsters and Tomasz Truderung, “An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols,” arXiv, Technical Report arXiv:0903.0802, 2009. Available at http://arxiv.org/abs/0903.0802.
    12. Ralf Küsters, Tomasz Truderung, and Andreas Vogt, “A Game-Based Definition of Coercion-Resistance and its Applications,” Cryptology ePrint Archive, Technical Report 2009/582, 2009.
  13. 2008

    1. Van Huong Pham, Minh Tuan Truong, Quoc Huy Do, Hong Trang Le, Thanh Nhan Vu, Ngoc Binh Nguyen, and Anh Hoang Truong, “Some Approaches to Nom Optical Character Recognition,” VNU, Hanoi. J. of Science, Natural Sciences and Technology, vol. 24, pp. 90–99, 2008.
    2. 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.
    3. 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.
    4. 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, vol. 206, no. 2–4, pp. 129--490, 2008.
    5. 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.
    6. 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, Technical Report arXiv:0808.0634v1, 2008. Available at http://arxiv.org/abs/0808.0634v1.
    7. 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), 2008, pp. 129–138.
    8. 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), 2008, pp. 270–284.
    9. Ralf Küsters and Max Tuengerthal, “Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation,” Cryptology ePrint Archive, Technical Report 2008/006, 2008.
    10. Oana Ciobotaru, “Efficient long-term secure universally composable commitments,” 2008.
  14. 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), 2007, vol. 4855, 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), 2007, vol. 4734, 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, Technical Report 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), 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), 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), 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), 2007, vol. 4393, 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.
  15. 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, vol. 4, 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, Technical Report 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), 2006, vol. 4189, 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), 2006, vol. 4337, 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, Technical Report 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), 2006, vol. 4052, 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, Technical Report 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), 2006, pp. 309--320.
    10. Ralf Küsters, “Simulation-Based Security with Inexhaustible Interactive Turing Machines,” Cryptology ePrint Archive, Technical Report 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.
    12. Max Tuengerthal, “Implementing a Unification Algorithm for Protocol Analysis with XOR,” Institut für Informatik, CAU Kiel, Germany, Technical Report 0609, 2006.
  16. 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), 2005, vol. 3378, 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), 2005, vol. 3653, 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, Technical Report 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), 2005, no. 3404, 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). Fairfax, Virginia, USA: ACM Press, 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.
    11. Tomasz Truderung, “Regular Protocols and Attacks with Regular Knowledge,” in Automated Deduction - CADE-20, 20th International Conference on Automated Deduction, 2005, vol. 3632, pp. 377–391.
    12. Tomasz Truderung, “Selecting Theories and Recursive Protocols,” in CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005, vol. 3653, pp. 217–232.
  17. 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, Technical Report 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), 2004, vol. 2996, pp. 382--393.
    6. 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, 2004, pp. 458–472.
  18. 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), 2003, vol. 2850, 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, 2003, vol. 2914, pp. 124–135.
    4. 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.
    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), 2003, pp. 261--270.
    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, Technical Report 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), 2003, vol. 2803, pp. 128--141.
    8. Ralf Küsters, “Tree Transducer-based Analysis of Cryptographic Protocols,” Institut für Informatik und Praktische Mathematik, CAU Kiel, Germany, Technical Report 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, Technical Report 0311, 2003. Available from http://www.informatik.uni-kiel.de/ifi/forschung/technische-berichte/.
  19. 2002

    1. Ralf Küsters, “Memoryless Determinacy of Parity Games,” in Automata, Logics, and Infinite Games: A Guide to Current Research, 2002, vol. 2500, 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), 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), 2002, vol. 2421, 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, Technical Report 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, 2002, vol. 2556, 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, Technical Report 0209, 2002. Available from http://www.informatik.uni-kiel.de/ifi/forschung/technische-berichte/.
    11. Jerzy Marcinkowski and Tomasz Truderung, “Optimal Complexity Bounds for Positive LTL Games,” in Computer Science Logic, CSL 2002, 2002, vol. 2471, pp. 262–275.
  20. 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), 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, Technical 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), Stanford University, CA, 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), Vienna, Austria, 2001, vol. 2250.
    5. 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. 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, 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), 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), Vienna, Austria, 2001, vol. 2174, pp. 33--47.
  21. 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), San Francisco, CA, 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), San Francisco, CA, 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, Technical 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), Aachen, Germany, 2000, no. 33. 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, Technical Report 00–05, 2000.
    6. R. Küsters and R. Molitor, “Computing Least Common Subsumers in ALEN,” LuFG Theoretical Computer Science, RWTH Aachen, Germany, Technical Report 00–07, 2000.
  22. 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), 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), Sweden, 1999, no. 22. 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, Technical 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, Technical 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, Technical 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, Technical Report 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, 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, Technical Report DCS-TR-404, 1999.
  23. 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, Trento, Italy, 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), Trento, Italy, 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, Bremen, Germany, 1998, vol. 1504, 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, Technical 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, Technical 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, Technical 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), 1998, pp. 499–510.
  24. 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, 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, Technical Report LTCS-97-04, 1997.
To the top of the page