Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarRalf Küsters
Person information
- affiliation: University of Stuttgart, Germany
- affiliation (former): University of Trier, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[e2]Lujo Bauer, Ralf Küsters:
Principles of Security and Trust - 7th International Conference, POST 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings. Lecture Notes in Computer Science 10804, Springer 2018, ISBN 978-3-319-89721-9 [contents]- 2017
- [c68]Daniel Fett, Ralf Küsters, Guido Schmitz:
The Web SSO Standard OpenID Connect: In-depth Formal Security Analysis and Security Guidelines. CSF 2017: 189-202 - [c67]Ralf Küsters, Daniel Rausch:
A Framework for Universally Composable Diffie-Hellman Key Exchange. IEEE Symposium on Security and Privacy 2017: 881-900 - [c66]Ralf Küsters, Johannes Müller:
Cryptographic Security Analysis of E-voting Systems: Achievements, Misconceptions, and Limitations. E-VOTE-ID 2017: 21-41 - [i36]Daniel Fett, Ralf Küsters, Guido Schmitz:
The Web SSO Standard OpenID Connect: In-Depth Formal Security Analysis and Security Guidelines. CoRR abs/1704.08539 (2017) - [i35]Ralf Küsters, Daniel Rausch:
A Framework for Universally Composable Diffie-Hellman Key Exchange. IACR Cryptology ePrint Archive 2017: 256 (2017) - 2016
- [c65]Jan Camenisch, Robert R. Enderlein, Stephan Krenn, Ralf Küsters, Daniel Rausch:
Universal Composition with Responsive Environments. ASIACRYPT (2) 2016: 807-840 - [c64]Daniel Fett, Ralf Küsters, Guido Schmitz:
A Comprehensive Formal Security Analysis of OAuth 2.0. ACM Conference on Computer and Communications Security 2016: 1204-1215 - [c63]Ralf Küsters, Johannes Müller, Enrico Scapin, Tomasz Truderung:
sElect: A Lightweight Verifiable Remote Voting System. CSF 2016: 341-354 - [c62]Ralf Küsters, Tomasz Truderung:
Security Analysis of Re-Encryption RPC Mix Nets. EuroS&P 2016: 227-242 - [c61]Véronique Cortier, David Galindo, Ralf Küsters, Johannes Müller, Tomasz Truderung:
SoK: Verifiability Notions for E-Voting Protocols. IEEE Symposium on Security and Privacy 2016: 779-798 - [i34]Daniel Fett, Ralf Küsters, Guido Schmitz:
A Comprehensive Formal Security Analysis of OAuth 2.0. CoRR abs/1601.01229 (2016) - [i33]Jan Camenisch, Robert R. Enderlein, Stephan Krenn, Ralf Küsters, Daniel Rausch:
Universal Composition with Responsive Environments. IACR Cryptology ePrint Archive 2016: 34 (2016) - [i32]Véronique Cortier, David Galindo, Ralf Küsters, Johannes Müller, Tomasz Truderung:
Verifiability Notions for E-Voting Protocols. IACR Cryptology ePrint Archive 2016: 287 (2016) - [i31]Ralf Küsters, Johannes Müller, Enrico Scapin, Tomasz Truderung:
sElect: A Lightweight Verifiable Remote Voting System. IACR Cryptology ePrint Archive 2016: 438 (2016) - 2015
- [c60]Daniel Fett, Ralf Küsters, Guido Schmitz:
SPRESSO: A Secure, Privacy-Respecting Single Sign-On System for the Web. ACM Conference on Computer and Communications Security 2015: 1358-1369 - [c59]Ralf Küsters, Tomasz Truderung, Bernhard Beckert, Daniel Bruns, Michael Kirsten, Martin Mohr:
A Hybrid Approach for Proving Noninterference of Java Programs. CSF 2015: 305-319 - [c58]Daniel Fett, Ralf Küsters, Guido Schmitz:
Analyzing the BrowserID SSO System with Primary Identity Providers Using an Expressive Model of the Web. ESORICS (1) 2015: 43-65 - [i30]Daniel Fett, Ralf Küsters, Guido Schmitz:
SPRESSO: A Secure, Privacy-Respecting Single Sign-On System for the Web. CoRR abs/1508.01719 (2015) - [i29]Ralf Küsters, Tomasz Truderung:
Security Analysis of Re-Encryption RPC Mix Nets. IACR Cryptology ePrint Archive 2015: 295 (2015) - [i28]Ralf Küsters, Tomasz Truderung, Bernhard Beckert, Daniel Bruns, Michael Kirsten, Martin Mohr:
A Hybrid Approach for Proving Noninterference of Java Programs. IACR Cryptology ePrint Archive 2015: 438 (2015) - 2014
- [j16]Ralf Küsters, Tomasz Truderung:
Security in e-voting. it - Information Technology 56(6): 300-306 (2014) - [c57]Ralf Küsters, Enrico Scapin, Tomasz Truderung, Juergen Graf:
Extending and Applying a Framework for the Cryptographic Verification of Java Programs. POST 2014: 220-239 - [c56]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking. IEEE Symposium on Security and Privacy 2014: 343-358 - [c55]Daniel Fett, Ralf Küsters, Guido Schmitz:
An Expressive Model for the Web Infrastructure: Definition and Application to the Browser ID SSO System. IEEE Symposium on Security and Privacy 2014: 673-688 - [p2]
- [i27]Daniel Fett, Ralf Küsters, Guido Schmitz:
An Expressive Model for the Web Infrastructure: Definition and Application to the BrowserID SSO System. CoRR abs/1403.1866 (2014) - [i26]Daniel Fett, Ralf Küsters, Guido Schmitz:
Analyzing the BrowserID SSO System with Primary Identity Providers Using an Expressive Model of the Web. CoRR abs/1411.7210 (2014) - [i25]Ralf Küsters, Enrico Scapin, Tomasz Truderung, Juergen Graf:
Extending and Applying a Framework for the Cryptographic Verification of Java Programs. IACR Cryptology ePrint Archive 2014: 38 (2014) - [i24]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking. IACR Cryptology ePrint Archive 2014: 341 (2014) - 2013
- [i23]Ralf Küsters, Max Tuengerthal:
The IITM Model: a Simple and Expressive Model for Universal Composability. IACR Cryptology ePrint Archive 2013: 25 (2013) - 2012
- [j15]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
A game-based definition of coercion resistance and its applications. Journal of Computer Security 20(6): 709-764 (2012) - [c54]Ralf Küsters, Tomasz Truderung, Juergen Graf:
A Framework for the Cryptographic Verification of Java-Like Programs. CSF 2012: 198-212 - [c53]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
Clash Attacks on the Verifiability of E-Voting Systems. IEEE Symposium on Security and Privacy 2012: 395-409 - [i22]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
Clash Attacks on the Verifiability of E-Voting Systems. IACR Cryptology ePrint Archive 2012: 116 (2012) - [i21]Ralf Küsters, Tomasz Truderung, Juergen Graf:
A Framework for the Cryptographic Verification of Java-like Programs. IACR Cryptology ePrint Archive 2012: 153 (2012) - 2011
- [b2]Ralf Küsters, Thomas Wilke:
Moderne Kryptographie - Eine Einführung. Vieweg + Teubner 2011, ISBN 978-3-519-00509-4 - [j14]Ralf Küsters, Tomasz Truderung:
Reducing Protocol Analysis with XOR to the XOR-Free Case in the Horn Theory Based Approach. J. Autom. Reasoning 46(3-4): 325-352 (2011) - [c52]Ralf Küsters, Max Tuengerthal:
Composition theorems without pre-established session identifiers. ACM Conference on Computer and Communications Security 2011: 41-50 - [c51]Ralf Küsters, Max Tuengerthal:
Ideal Key Derivation and Encryption in Simulation-Based Security. CT-RSA 2011: 161-179 - [c50]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
Verifiability, Privacy, and Coercion-Resistance: New Insights from a Case Study. IEEE Symposium on Security and Privacy 2011: 538-553 - [i20]Alexander Borgida, Ralf Küsters:
What's in an Attribute? Consequences for the Least Common Subsumer. CoRR abs/1106.0238 (2011) - [i19]Hubert Comon-Lundh, Ralf Küsters, Catherine A. Meadows:
Security and Rewriting (Dagstuhl Seminar 11332). Dagstuhl Reports 1(8): 53-66 (2011) - [i18]Ralf Küsters, Max Tuengerthal:
Composition Theorems Without Pre-Established Session Identifiers. IACR Cryptology ePrint Archive 2011: 406 (2011) - [i17]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
Verifiability, Privacy, and Coercion-Resistance: New Insights from a Case Study. IACR Cryptology ePrint Archive 2011: 517 (2011) - 2010
- [j13]Detlef Kähler, Ralf Küsters, Thomas Wilke:
Deciding strategy properties of contract-signing protocols. ACM Trans. Comput. Log. 11(3): 17:1-17:42 (2010) - [c49]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
Accountability: definition and relationship to verifiability. ACM Conference on Computer and Communications Security 2010: 526-535 - [c48]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
A Game-Based Definition of Coercion-Resistance and Its Applications. CSF 2010: 122-136 - [c47]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
Proving Coercion-Resistance of Scantegrity II. ICICS 2010: 281-295 - [c46]Ralf Küsters, Henning Schnoor, Tomasz Truderung:
A Formal Definition of Online Abuse-Freeness. SecureComm 2010: 484-497 - [i16]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
Accountability: Definition and Relationship to Verifiability. IACR Cryptology ePrint Archive 2010: 236 (2010) - [i15]Ralf Küsters, Max Tuengerthal:
Ideal Key Derivation and Encryption in Simulation-based Security. IACR Cryptology ePrint Archive 2010: 295 (2010) - [i14]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
Proving Coercion-Resistance of Scantegrity II. IACR Cryptology ePrint Archive 2010: 502 (2010)
2000 – 2009
- 2009
- [c45]Ralf Küsters, Max Tuengerthal:
Computational soundness for key exchange protocols with symmetric encryption. ACM Conference on Computer and Communications Security 2009: 91-100 - [c44]Ralf Küsters, Tomasz Truderung:
Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation. CSF 2009: 157-171 - [c43]
- [c42]Ralf Küsters, Tomasz Truderung:
An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols. IEEE Symposium on Security and Privacy 2009: 251-266 - [c41]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
Improving and Simplifying a Variant of Prêt à Voter. VOTE-ID 2009: 37-53 - [i13]Ralf Küsters, Tomasz Truderung:
An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols. CoRR abs/0903.0802 (2009) - [i12]Ralf Küsters, Max Tuengerthal:
Universally Composable Symmetric Encryption. IACR Cryptology ePrint Archive 2009: 55 (2009) - [i11]Ralf Küsters, Max Tuengerthal:
Computational Soundness for Key Exchange Protocols with Symmetric Encryption. IACR Cryptology ePrint Archive 2009: 392 (2009) - [i10]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
A Game-Based Definition of Coercion-Resistance and its Applications. IACR Cryptology ePrint Archive 2009: 582 (2009) - 2008
- [j12]Pierpaolo Degano, Ralf Küsters, Luca Viganò, Steve Zdancewic:
Joint workshop on foundations of computer security and automated reasoning for security protocol analysis (FCS-ARSPA '06). Inf. Comput. 206(2-4): 129 (2008) - [j11]Michael Backes, Markus Dürmuth, Dennis Hofheinz, Ralf Küsters:
Conditional reactive simulatability. Int. J. Inf. Sec. 7(2): 155-169 (2008) - [j10]Ralf Küsters, Anupam Datta, John C. Mitchell, Ajith Ramanathan:
On the Relationships between Notions of Simulation-Based Security. J. Cryptology 21(4): 492-546 (2008) - [j9]Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani:
Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption. ACM Trans. Comput. Log. 9(4): 24:1-24:52 (2008) - [c40]Ralf Küsters, Tomasz Truderung:
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach. ACM Conference on Computer and Communications Security 2008: 129-138 - [c39]Ralf Küsters, Max Tuengerthal:
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation. CSF 2008: 270-284 - [i9]Ralf Küsters, Tomasz Truderung:
Reducing Protocol Analysis with XOR to the XOR-free Case in the Horn Theory Based Approach. CoRR abs/0808.0634 (2008) - [i8]Ralf Küsters, Max Tuengerthal:
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation. IACR Cryptology ePrint Archive 2008: 6 (2008) - 2007
- [j8]Ralf Küsters, Thomas Wilke:
Transducer-based analysis of cryptographic protocols. Inf. Comput. 205(12): 1741-1776 (2007) - [c38]Klaas Ole Kürtz, Ralf Küsters, Thomas Wilke:
Selecting theories and nonce generation for recursive protocols. FMSE 2007: 61-70 - [c37]Véronique Cortier, Ralf Küsters, Bogdan Warinschi:
A Cryptographic Model for Branching Time Security Properties - The Case of Contract Signing Protocols. ESORICS 2007: 422-437 - [c36]Michael Backes, Markus Dürmuth, Ralf Küsters:
On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography. FSTTCS 2007: 108-120 - [c35]Detlef Kähler, Ralf Küsters, Tomasz Truderung:
Infinite State AMC-Model Checking for Cryptographic Protocols. LICS 2007: 181-192 - [c34]Ralf Küsters, Tomasz Truderung:
On the Automatic Analysis of Recursive Security Protocols with XOR. STACS 2007: 646-657 - [i7]Michael Backes, Markus Dürmuth, Ralf Küsters:
On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography. IACR Cryptology ePrint Archive 2007: 233 (2007) - [i6]Véronique Cortier, Ralf Küsters, Bogdan Warinschi:
A Cryptographic Model for Branching Time Security Properties - the Case of Contract Signing Protocols. IACR Cryptology ePrint Archive 2007: 251 (2007) - 2006
- [c33]Ralf Küsters:
Simulation-Based Security with Inexhaustible Interactive Turing Machines. CSFW 2006: 309-320 - [c32]Michael Backes, Markus Dürmuth, Dennis Hofheinz, Ralf Küsters:
Conditional Reactive Simulatability. ESORICS 2006: 424-443 - [c31]Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi:
Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. FSTTCS 2006: 176-187 - [c30]Detlef Kähler, Ralf Küsters, Thomas Wilke:
A Dolev-Yao-Based Definition of Abuse-Free Protocols. ICALP (2) 2006: 95-106 - [i5]Max Tuengerthal, Ralf Küsters, Mathieu Turuani:
Implementing a Unification Algorithm for Protocol Analysis with XOR. CoRR abs/cs/0610014 (2006) - [i4]Michael Backes, Markus Dürmuth, Dennis Hofheinz, Ralf Küsters:
Conditional Reactive Simulatability. IACR Cryptology ePrint Archive 2006: 132 (2006) - [i3]Ralf Küsters:
Simulation-Based Security with Inexhaustible Interactive Turing Machines. IACR Cryptology ePrint Archive 2006: 151 (2006) - [i2]Anupam Datta, Ralf Küsters, John C. Mitchell, Ajith Ramanathan:
On the Relationships Between Notions of Simulation-Based Security. IACR Cryptology ePrint Archive 2006: 153 (2006) - [i1]Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi:
Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. IACR Cryptology ePrint Archive 2006: 218 (2006) - 2005
- [j7]Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani:
Deciding the Security of Protocols with Commuting Public Key Encryption. Electr. Notes Theor. Comput. Sci. 125(1): 55-66 (2005) - [j6]Ralf Küsters:
On the decidability of cryptographic protocols with open-ended data structures. Int. J. Inf. Sec. 4(1-2): 49-70 (2005) - [j5]Ralf Küsters, Ralf Molitor:
Structural Subsumption and Least Common Subsumers in a Description Logic with Existential and Number Restrictions. Studia Logica 81(2): 227-259 (2005) - [j4]Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani:
An NP decision procedure for protocol insecurity with XOR. Theor. Comput. Sci. 338(1-3): 247-274 (2005) - [c29]Detlef Kähler, Ralf Küsters:
Constraint Solving for Contract-Signing Protocols. CONCUR 2005: 233-247 - [c28]Detlef Kähler, Ralf Küsters, Thomas Wilke:
Deciding Properties of Contract-Signing Protocols. STACS 2005: 158-169 - [c27]Anupam Datta, Ralf Küsters, John C. Mitchell, Ajith Ramanathan:
On the Relationships Between Notions of Simulation-Based Security. TCC 2005: 476-494 - [e1]Vijay Atluri, Pierangela Samarati, Ralf Küsters, John C. Mitchell:
Proceedings of the 2005 ACM workshop on Formal methods in security engineering, FMSE 2005, Fairfax, VA, USA, November 11, 2005. ACM 2005, ISBN 1-59593-231-3 [contents] - 2004
- [c26]Ralf Küsters, Thomas Wilke:
Automata-Based Analysis of Recursive Cryptographic Protocols. STACS 2004: 382-393 - 2003
- [c25]Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani, Laurent Vigneron:
Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions. CSL 2003: 128-141 - [c24]Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani:
Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents. FSTTCS 2003: 124-135 - [c23]Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani:
An NP Decision Procedure for Protocol Insecurity with XOR. LICS 2003: 261-270 - [c22]Sebastian Brandt, Anni-Yasmin Turhan, Ralf Küsters:
Extensions of Non-standard Inferences to Descriptions Logics with Transitive Roles. LPAR 2003: 122-136 - [p1]Franz Baader, Ralf Küsters, Frank Wolter:
Extensions to Description Logics. Description Logic Handbook 2003: 219-261 - 2002
- [j3]Ralf Küsters, Ralf Molitor:
Approximating most specific concepts in description logics with existential restrictions. AI Commun. 15(1): 47-59 (2002) - [c21]Ralf Küsters:
On the Decidability of Cryptographic Protocols with Open-Ended Data Structures. CONCUR 2002: 515-530 - [c20]Franz Baader, Ralf Küsters:
Unification in a Description Logic with Inconsistency and Transitive Closure of Roles. Description Logics 2002 - [c19]Sebastian Brandt, Ralf Küsters, Anni-Yasmin Turhan:
Approximating ALCN-Concept Descriptions. Description Logics 2002 - [c18]Ralf Küsters, Thomas Wilke:
Deciding the First Level of the µ-Calculus Alternation Hierarchy. FSTTCS 2002: 241-252 - [c17]Sebastian Brandt, Ralf Küsters, Anni-Yasmin Turhan:
Approximation and Difference in Description Logics. KR 2002: 203-214 - 2001
- [b1]Ralf Küsters:
Non-Standard Inferences in Description Logics. Lecture Notes in Computer Science 2100, Springer 2001, ISBN 3-540-42397-4, pp. 1-250 - [j2]Ralf Küsters, Alexander Borgida:
What's in an Attribute? Consequences for the Least Common Subsumer. J. Artif. Intell. Res. 14: 167-203 (2001) - [c16]Ralf Küsters:
Memoryless Determinacy of Parity Games. Automata, Logics, and Infinite Games 2001: 95-106 - [c15]Franz Baader, Ralf Küsters:
Unification in a Description Logic with Transitive Closure of Roles. Description Logics 2001 - [c14]Franz Baader, Sebastian Brandt, Ralf Küsters:
Matching under Side Conditions in Description Logics. IJCAI 2001: 213-218 - [c13]
- [c12]Ralf Küsters, Ralf Molitor:
Approximating Most Specific Concepts in Description Logics with Existential Restrictions. KI/ÖGAI 2001: 33-47 - [c11]Franz Baader, Ralf Küsters:
Unification in a Description Logic with Transitive Closure of Roles. LPAR 2001: 217-232 - 2000
- [c10]Alexander Borgida, Ralf Küsters:
What's not in a name: Some Properties of a Purely Structural Approach to Integrating Large DL Knowledge Bases. Description Logics 2000: 65-78 - [c9]Franz Baader, Ralf Küsters:
Matching Concept Descriptions with Existential Restrictions. KR 2000: 261-272 - [c8]
1990 – 1999
- 1999
- [j1]Franz Baader, Ralf Küsters, Alexander Borgida, Deborah L. McGuinness:
Matching in Description Logics. J. Log. Comput. 9(3): 411-447 (1999) - [c7]Franz Baader, Ralf Küsters:
Matching in Description Logics with Existential Restrictions. Description Logics 1999 - [c6]Franz Baader, Ralf Küsters, Ralf Molitor:
Computing Least Common Subsumers in Description Logics with Existential Restrictions. IJCAI 1999: 96-103 - 1998
- [c5]Franz Baader, Ralf Küsters:
Least Common Subsumer Computation w.r.t. cyclic ALN-Terminologies. Description Logics 1998 - [c4]Franz Baader, Ralf Küsters, Ralf Molitor:
Structural Subsumption Considered from an Automata-Theoretic Point of View. Description Logics 1998 - [c3]Franz Baader, Ralf Küsters:
Computing the Least Common Subsumer and the Most Specific Concept in the Presence of Cyclic ALN-Concept Descriptions. KI 1998: 129-140 - [c2]Ralf Küsters:
Characterizing the Semantics of Terminological Cycles in ALN Using Finite Automata. KR 1998: 499-511 - 1997
- [c1]Ralf Küsters:
Characterizing the semantics of terminological cycles with the help of finite automata. Description Logics 1997
Coauthor Index