Characterizing the semantics of terminological cycles with the help of finite automata. - Ralf Küsters (Description Logics, 1997)

Least Common Subsumer Computation w.r.t. cyclic ALN-Terminologies. - Franz Baader; Ralf Küsters (Description Logics, 1998)

Structural Subsumption Considered from an Automata-Theoretic Point of View. - Franz Baader; Ralf Küsters; Ralf Molitor (Description Logics, 1998)

Computing the Least Common Subsumer and the Most Specific Concept in the Presence of Cyclic ALN-Concept Descriptions. - Franz Baader; Ralf Küsters (KI, 1998)

Characterizing the Semantics of Terminological Cycles in ALN Using Finite Automata. - Ralf Küsters (KR, 1998)

Matching in Description Logics with Existential Restrictions. - Franz Baader; Ralf Küsters (Description Logics, 1999)

Computing Least Common Subsumers in Description Logics with Existential Restrictions. - Franz Baader; Ralf Küsters; Ralf Molitor (IJCAI, 1999)

Matching in Description Logics. - Franz Baader; Ralf Küsters; Alexander Borgida; Deborah L. McGuinness (J. Log. Comput., 1999)

What's not in a name: Some Properties of a Purely Structural Approach to Integrating Large DL Knowledge Bases. - Alexander Borgida; Ralf Küsters (Description Logics, 2000)

Matching Concept Descriptions with Existential Restrictions. - Franz Baader; Ralf Küsters (KR, 2000)

Rewriting Concepts Using Terminologies. - Franz Baader; Ralf Küsters; Ralf Molitor (KR, 2000)

Non-Standard Inferences in Description Logics - Ralf Küsters (Springer, 2001)

Memoryless Determinacy of Parity Games. - Ralf Küsters (Automata, Logics, and Infinite Games, 2001)

Matching under Side Conditions in Description Logics. - Franz Baader; Sebastian Brandt 001; Ralf Küsters (IJCAI, 2001)

Computing Least Common Subsumers in ALEN. - Ralf Küsters; Ralf Molitor (IJCAI, 2001)

Unification in a Description Logic with Transitive Closure of Roles. - Franz Baader; Ralf Küsters (LPAR, 2001)

What's in an Attribute? Consequences for the Least Common Subsumer. - Ralf Küsters; Alexander Borgida (J. Artif. Intell. Res., 2001)

Unification in a Description Logic with Inconsistency and Transitive Closure of Roles. - Franz Baader; Ralf Küsters (Description Logics, 2002)

Approximating ALCN-Concept Descriptions. - Sebastian Brandt 001; Ralf Küsters; Anni-Yasmin Turhan (Description Logics, 2002)

Deciding the First Level of the µ-Calculus Alternation Hierarchy. - Ralf Küsters; Thomas Wilke (FSTTCS, 2002)

Approximation and Difference in Description Logics. - Sebastian Brandt 001; Ralf Küsters; Anni-Yasmin Turhan (KR, 2002)

Approximating most specific concepts in description logics with existential restrictions. - Ralf Küsters; Ralf Molitor (AI Commun., 2002)

Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions. - Yannick Chevalier; Ralf Küsters; Michaël Rusinowitch; Mathieu Turuani; Laurent Vigneron (CSL, 2003)

Extensions to Description Logics. - Franz Baader; Ralf Küsters; Frank Wolter (Description Logic Handbook, 2003)

Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents. - Yannick Chevalier; Ralf Küsters; Michaël Rusinowitch; Mathieu Turuani (FSTTCS, 2003)

Extensions of Non-standard Inferences to Descriptions Logics with Transitive Roles. - Sebastian Brandt 001; Anni-Yasmin Turhan; Ralf Küsters (LPAR, 2003)

Automata-Based Analysis of Recursive Cryptographic Protocols. - Ralf Küsters; Thomas Wilke (STACS, 2004)

Deciding the Security of Protocols with Commuting Public Key Encryption. - Yannick Chevalier; Ralf Küsters; Michaël Rusinowitch; Mathieu Turuani (ARSPA@IJCAR, 2004)

Constraint Solving for Contract-Signing Protocols. - Detlef Kähler; Ralf Küsters (CONCUR, 2005)

Deciding Properties of Contract-Signing Protocols. - Detlef Kähler; Ralf Küsters; Thomas Wilke (STACS, 2005)

On the decidability of cryptographic protocols with open-ended data structures. - Ralf Küsters (Int. J. Inf. Sec., 2005)

Structural Subsumption and Least Common Subsumers in a Description Logic with Existential and Number Restrictions. - Ralf Küsters; Ralf Molitor (Stud Logica, 2005)

An NP decision procedure for protocol insecurity with XOR. - Yannick Chevalier; Ralf Küsters; Michaël Rusinowitch; Mathieu Turuani (Theor. Comput. Sci., 2005)

A Dolev-Yao-Based Definition of Abuse-Free Protocols. - Detlef Kähler; Ralf Küsters; Thomas Wilke (ICALP (2), 2006)

Implementing a Unification Algorithm for Protocol Analysis with XOR - Max Tuengerthal; Ralf Küsters; Mathieu Turuani (CoRR, 2006)

Conditional Reactive Simulatability. - Michael Backes 001; Markus Dürmuth; Dennis Hofheinz; Ralf Küsters (IACR Cryptol. ePrint Arch., 2006)

Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. - Véronique Cortier; Steve Kremer; Ralf Küsters; Bogdan Warinschi (IACR Cryptol. ePrint Arch., 2006)

Simulation-Based Security with Inexhaustible Interactive Turing Machines. - Ralf Küsters (IACR Cryptol. ePrint Arch., 2006)

Selecting theories and nonce generation for recursive protocols. - Klaas Ole Kürtz; Ralf Küsters; Thomas Wilke (FMSE, 2007)

Infinite State AMC-Model Checking for Cryptographic Protocols. - Detlef Kähler; Ralf Küsters; Tomasz Truderung (LICS, 2007)

On the Automatic Analysis of Recursive Security Protocols with XOR. - Ralf Küsters; Tomasz Truderung (STACS, 2007)

On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography. - Michael Backes 001; Markus Dürmuth; Ralf Küsters (IACR Cryptol. ePrint Arch., 2007)

A Cryptographic Model for Branching Time Security Properties - the Case of Contract Signing Protocols. - Véronique Cortier; Ralf Küsters; Bogdan Warinschi (IACR Cryptol. ePrint Arch., 2007)

Transducer-based analysis of cryptographic protocols. - Ralf Küsters; Thomas Wilke (Inf. Comput., 2007)

Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation. - Ralf Küsters; Max Tuengerthal (IACR Cryptol. ePrint Arch., 2008)

Joint workshop on foundations of computer security and automated reasoning for security protocol analysis (FCS-ARSPA '06). - Pierpaolo Degano; Ralf Küsters; Luca Viganò 001; Steve Zdancewic (Inf. Comput., 2008)

On the Relationships between Notions of Simulation-Based Security. - Ralf Küsters; Anupam Datta; John C. Mitchell; Ajith Ramanathan (J. Cryptol., 2008)

Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption. - Yannick Chevalier; Ralf Küsters; Michaël Rusinowitch; Mathieu Turuani (ACM Trans. Comput. Log., 2008)

Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation. - Ralf Küsters; Tomasz Truderung (CSF, 2009)

An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols. - Ralf Küsters; Tomasz Truderung (SP, 2009)

Improving and Simplifying a Variant of Prêt à Voter. - Ralf Küsters; Tomasz Truderung; Andreas Vogt 001 (VoteID, 2009)

Universally Composable Symmetric Encryption. - Ralf Küsters; Max Tuengerthal (IACR Cryptol. ePrint Arch., 2009)

Computational Soundness for Key Exchange Protocols with Symmetric Encryption. - Ralf Küsters; Max Tuengerthal (IACR Cryptol. ePrint Arch., 2009)

A Formal Definition of Online Abuse-Freeness. - Ralf Küsters; Henning Schnoor; Tomasz Truderung (SecureComm, 2010)

Ideal Key Derivation and Encryption in Simulation-based Security. - Ralf Küsters; Max Tuengerthal (IACR Cryptol. ePrint Arch., 2010)

Accountability: Definition and Relationship to Verifiability. - Ralf Küsters; Tomasz Truderung; Andreas Vogt 001 (IACR Cryptol. ePrint Arch., 2010)

Proving Coercion-Resistance of Scantegrity II. - Ralf Küsters; Tomasz Truderung; Andreas Vogt 001 (IACR Cryptol. ePrint Arch., 2010)

Deciding strategy properties of contract-signing protocols. - Detlef Kähler; Ralf Küsters; Thomas Wilke (ACM Trans. Comput. Log., 2010)

Moderne Kryptographie - Eine Einführung. - Ralf Küsters; Thomas Wilke (Vieweg + Teubner, 2011)

Security and Rewriting (Dagstuhl Seminar 11332). - Hubert Comon-Lundh; Ralf Küsters; Catherine Meadows 001 (Dagstuhl Reports, 2011)

Composition Theorems Without Pre-Established Session Identifiers. - Ralf Küsters; Max Tuengerthal (IACR Cryptol. ePrint Arch., 2011)

Verifiability, Privacy, and Coercion-Resistance: New Insights from a Case Study. - Ralf Küsters; Tomasz Truderung; Andreas Vogt 001 (IACR Cryptol. ePrint Arch., 2011)

Reducing Protocol Analysis with XOR to the XOR-Free Case in the Horn Theory Based Approach. - Ralf Küsters; Tomasz Truderung (J. Autom. Reason., 2011)

A Framework for the Cryptographic Verification of Java-like Programs. - Ralf Küsters; Tomasz Truderung; Juergen Graf (IACR Cryptol. ePrint Arch., 2012)

Clash Attacks on the Verifiability of E-Voting Systems. - Ralf Küsters; Tomasz Truderung; Andreas Vogt 001 (IACR Cryptol. ePrint Arch., 2012)

A game-based definition of coercion resistance and its applications. - Ralf Küsters; Tomasz Truderung; Andreas Vogt 001 (J. Comput. Secur., 2012)

The IITM Model: a Simple and Expressive Model for Universal Composability. - Ralf Küsters; Max Tuengerthal (IACR Cryptol. ePrint Arch., 2013)

An Expressive Model for the Web Infrastructure: Definition and Application to the Browser ID SSO System. - Daniel Fett; Ralf Küsters; Guido Schmitz (IEEE Symposium on Security and Privacy, 2014)

An Expressive Model for the Web Infrastructure: Definition and Application to the BrowserID SSO System. - Daniel Fett; Ralf Küsters; Guido Schmitz (CoRR, 2014)

Extending and Applying a Framework for the Cryptographic Verification of Java Programs. - Ralf Küsters; Enrico Scapin; Tomasz Truderung; Juergen Graf (IACR Cryptol. ePrint Arch., 2014)

Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking. - Ralf Küsters; Tomasz Truderung; Andreas Vogt 001 (IACR Cryptol. ePrint Arch., 2014)

Security in e-voting. - Ralf Küsters; Tomasz Truderung (it Inf. Technol., 2014)

E-Voting Systems. - Ralf Küsters (Software Systems Safety, 2014)

SPRESSO: A Secure, Privacy-Respecting Single Sign-On System for the Web. - Daniel Fett; Ralf Küsters; Guido Schmitz (CCS, 2015)

Analyzing the BrowserID SSO System with Primary Identity Providers Using an Expressive Model of the Web. - Daniel Fett; Ralf Küsters; Guido Schmitz (ESORICS (1), 2015)

Security Analysis of Re-Encryption RPC Mix Nets. - Ralf Küsters; Tomasz Truderung (IACR Cryptol. ePrint Arch., 2015)

A Hybrid Approach for Proving Noninterference of Java Programs. - Ralf Küsters; Tomasz Truderung; Bernhard Beckert; Daniel Bruns; Michael Kirsten; Martin Mohr (IACR Cryptol. ePrint Arch., 2015)

A Comprehensive Formal Security Analysis of OAuth 2.0. - Daniel Fett; Ralf Küsters; Guido Schmitz (CCS, 2016)

SoK: Verifiability Notions for E-Voting Protocols. - Véronique Cortier; David Galindo; Ralf Küsters; Johannes Müller 001; Tomasz Truderung (IEEE Symposium on Security and Privacy, 2016)

Universal Composition with Responsive Environments. - Jan Camenisch; Robert R. Enderlein; Stephan Krenn; Ralf Küsters; Daniel Rausch 001 (IACR Cryptol. ePrint Arch., 2016)

Verifiability Notions for E-Voting Protocols. - Véronique Cortier; David Galindo; Ralf Küsters; Johannes Müller 001; Tomasz Truderung (IACR Cryptol. ePrint Arch., 2016)

sElect: A Lightweight Verifiable Remote Voting System. - Ralf Küsters; Johannes Müller 001; Enrico Scapin; Tomasz Truderung (IACR Cryptol. ePrint Arch., 2016)

The Web SSO Standard OpenID Connect: In-depth Formal Security Analysis and Security Guidelines. - Daniel Fett; Ralf Küsters; Guido Schmitz (CSF, 2017)

Cryptographic Security Analysis of E-voting Systems: Achievements, Misconceptions, and Limitations. - Ralf Küsters; Johannes Müller 001 (E-VOTE-ID, 2017)

A Framework for Universally Composable Diffie-Hellman Key Exchange. - Ralf Küsters; Daniel Rausch 001 (IACR Cryptol. ePrint Arch., 2017)

An Extensive Formal Security Analysis of the OpenID Financial-Grade API. - Daniel Fett; Pedram Hosseyni; Ralf Küsters (IEEE Symposium on Security and Privacy, 2019)

Practical Yet Composably Secure Cryptographic Protocols (Dagstuhl Seminar 19042). - Jan Camenisch; Ralf Küsters; Anna Lysyanskaya; Alessandra Scafuro (Dagstuhl Reports, 2019)

iUC: Flexible Universal Composability Made Simple. - Jan Camenisch; Stephan Krenn; Ralf Küsters; Daniel Rausch 001 (IACR Cryptol. ePrint Arch., 2019)

Ordinos: A Verifiable Tally-Hiding E-Voting System. - Ralf Küsters; Julian Liedtke; Johannes Müller 001; Daniel Rausch 001; Andreas Vogt 001 (IACR Cryptol. ePrint Arch., 2020)

Accountability in a Permissioned Blockchain: Formal Analysis of Hyperledger Fabric. - Ralf Küsters; Daniel Rausch 001; Mike Simon (IACR Cryptol. ePrint Arch., 2020)

The IITM Model: A Simple and Expressive Model for Universal Composability. - Ralf Küsters; Max Tuengerthal; Daniel Rausch 001 (J. Cryptol., 2020)

Joint State Composition Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation. - Ralf Küsters; Max Tuengerthal; Daniel Rausch 001 (J. Cryptol., 2020)

A Tutorial-Style Introduction to DY*. - Karthikeyan Bhargavan; Abhishek Bichhawat; Quoc Huy Do 001; Pedram Hosseyni; Ralf Küsters; Guido Schmitz; Tim Würtele (Protocols, Strands, and Logic, 2021)

DY*: A Modular Symbolic Verification Framework for Executable Cryptographic Protocol Code. - Karthikeyan Bhargavan; Abhishek Bichhawat; Quoc Huy Do 001; Pedram Hosseyni; Ralf Küsters; Guido Schmitz; Tim Würtele (EuroS&P, 2021)

An In-Depth Symbolic Security Analysis of the ACME Standard. - Karthikeyan Bhargavan; Abhishek Bichhawat; Quoc Huy Do 001; Pedram Hosseyni; Ralf Küsters; Guido Schmitz; Tim Würtele (IACR Cryptol. ePrint Arch., 2021)

A Formal Security Analysis of the W3C Web Payment APIs: Attacks and Verification. - Quoc Huy Do 001; Pedram Hosseyni; Ralf Küsters; Guido Schmitz; Nils Wenzler; Tim Würtele (IACR Cryptol. ePrint Arch., 2021)

A Security Framework for Distributed Ledgers. - Christoph Egger 001; Mike Graf 001; Ralf Küsters; Daniel Rausch 001; Viktoria Ronge; Dominique Schröder (IACR Cryptol. ePrint Arch., 2021)

Extending the Tally-Hiding Ordinos System: Implementations for Borda, Hare-Niemeyer, Condorcet, and Instant-Runoff Voting. - Fabian Hertel; Nicolas Huber; Jonas Kittelberger; Ralf Küsters; Julian Liedtke; Daniel Rausch 001 (IACR Cryptol. ePrint Arch., 2021)

Intelligent Methods for Test and Reliability. - Hussam Amrouch; Jens Anders; Steffen Becker 001; Maik Betka; Gerd Bleher; Peter Domanski; Nourhan Elhamawy; Thomas Ertl; Athanasios Gatzastras; Paul R. Genssler; Sebastian Hasler; Martin Heinrich; et al. (DATE, 2022)

Federated Learning for Appearance-based Gaze Estimation in the Wild. - Mayar Elfares; Zhiming Hu; Pascal Reisert; Andreas Bulling; Ralf Küsters (Gaze Meets ML, 2022)

Recent Developments in the Context of Online Elections and Digital Polls in Germany. - Bernhard Beckert; Jurlind Budurushi; Armin Grunwald; Robert Krimmer; Oksana Kulyk; Ralf Küsters; Andreas Mayer; Jörn Müller-Quade; Stephan Neumann; Melanie Volkamer (Sicherheit, 2022)

AUC: Accountable Universal Composability. - Mike Graf 001; Ralf Küsters; Daniel Rausch 001 (IACR Cryptol. ePrint Arch., 2022)

Kryvos: Publicly Tally-Hiding Verifiable E-Voting. - Nicolas Huber; Ralf Küsters; Toomas Krips; Julian Liedtke; Johannes Müller 001; Daniel Rausch 001; Pascal Reisert; Andreas Vogt 001 (IACR Cryptol. ePrint Arch., 2022)

Embedding the UC Model into the IITM Model. - Daniel Rausch 001; Ralf Küsters; Céline Chevalier (IACR Cryptol. ePrint Arch., 2022)

Arithmetic Tuples for MPC. - Pascal Reisert; Marc Rivinius; Toomas Krips; Ralf Küsters (IACR Cryptol. ePrint Arch., 2022)

Publicly Accountable Robust Multi-Party Computation. - Marc Rivinius; Pascal Reisert; Daniel Rausch 001; Ralf Küsters (IACR Cryptol. ePrint Arch., 2022)

Overdrive LowGear 2.0: Reduced-Bandwidth MPC without Sacrifice. - Pascal Reisert; Marc Rivinius; Toomas Krips; Ralf Küsters (AsiaCCS, 2023)

Layered Symbolic Security Analysis in $ textsf {DY}^ star $. - Karthikeyan Bhargavan; Abhishek Bichhawat; Pedram Hosseyni; Ralf Küsters; Klaas Pruiksma; Guido Schmitz; Clara Waldmann; Tim Würtele (ESORICS (3), 2023)

Layered Symbolic Security Analysis in DY$^ star$. - Karthikeyan Bhargavan; Abhishek Bichhawat; Pedram Hosseyni; Ralf Küsters; Klaas Pruiksma; Guido Schmitz; Clara Waldmann; Tim Würtele (IACR Cryptol. ePrint Arch., 2023)

Accountable Bulletin Boards: Definition and Provably Secure Implementation. - Mike Graf 001; Ralf Küsters; Daniel Rausch 001; Simon Egger; Marvin Bechtold; Marcel Flinspach (IACR Cryptol. ePrint Arch., 2023)

Overdrive LowGear 2.0: Reduced-Bandwidth MPC without Sacrifice. - Sebastian Hasler; Toomas Krips; Ralf Küsters; Pascal Reisert; Marc Rivinius (IACR Cryptol. ePrint Arch., 2023)

The Grant Negotiation and Authorization Protocol: Attacking, Fixing, and Verifying an Emerging Standard. - Florian Helmschmidt; Pedram Hosseyni; Ralf Küsters; Klaas Pruiksma; Clara Waldmann; Tim Würtele (IACR Cryptol. ePrint Arch., 2023)

Fully Tally-Hiding Verifiable E-Voting for Real-World Elections with Seat-Allocations. - Carmen Wabartha; Julian Liedtke; Nicolas Huber; Daniel Rausch 001; Ralf Küsters (IACR Cryptol. ePrint Arch., 2023)

Convolutions in Overdrive: Maliciously Secure Convolutions for MPC. - Marc Rivinius; Pascal Reisert; Sebastian Hasler; Ralf Küsters (Proc. Priv. Enhancing Technol., 2023)

Formal Security Analysis of the OpenID FAPI 2.0: Accompanying a Standardization Process. - Pedram Hosseyni; Ralf Küsters; Tim Würtele (IACR Cryptol. ePrint Arch., 2024)

ZK-SNARKs for Ballot Validity: A Feasibility Study. - Nicolas Huber; Ralf Küsters; Julian Liedtke; Daniel Rausch 001 (IACR Cryptol. ePrint Arch., 2024)

Actively Secure Polynomial Evaluation from Shared Polynomial Encodings. - Pascal Reisert; Marc Rivinius; Toomas Krips; Sebastian Hasler; Ralf Küsters (IACR Cryptol. ePrint Arch., 2024)

PrivatEyes: Appearance-based Gaze Estimation Using Federated Secure Multi-Party Computation. - Mayar Elfares; Pascal Reisert; Zhiming Hu; Wenwu Tang; Ralf Küsters; Andreas Bulling (Proc. ACM Hum. Comput. Interact., 2024)

Multipars: Reduced-Communication MPC over Z2k. - Sebastian Hasler; Pascal Reisert; Marc Rivinius; Ralf Küsters (Proc. Priv. Enhancing Technol., 2024)

Audience Injection Attacks: A New Class of Attacks on Web-Based Authorization and Authentication Standards. - Pedram Hosseyni; Ralf Küsters; Tim Würtele (IACR Cryptol. ePrint Arch., 2025)

Verifiable E-Voting with a Trustless Bulletin Board. - Daniel Rausch 001; Nicolas Huber; Ralf Küsters (IACR Cryptol. ePrint Arch., 2025)

Formal Security Analysis of the OpenID FAPI 2.0 Family of Protocols: Accompanying a Standardization Process. - Pedram Hosseyni; Ralf Küsters; Tim Würtele (ACM Trans. Priv. Secur., 2025)

QualitEye: Public and Privacy-preserving Gaze Data Quality Verification. - Mayar Elfares; Pascal Reisert; Ralf Küsters; Andreas Bulling (CoRR, 2025)

Guidelines for Gaze-based Neural Preliminary Diagnosis. - Mayar Elfares; Salma Younis; Pascal Reisert; Ralf Küsters; Tobias J. Renner; Andreas Bulling (CoRR, 2025)

Gaze3P: Gaze-Based Prediction of User-Perceived Privacy. - Mayar Elfares; Pascal Reisert; Ralf Küsters; Andreas Bulling (CoRR, 2025)