default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRalf 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
export refined list as
showing all ?? records
2020 – today
- 2024
[j20]Mayar Elfares
, Pascal Reisert, Zhiming Hu, Wenwu Tang, Ralf Küsters, Andreas Bulling:
PrivatEyes: Appearance-based Gaze Estimation Using Federated Secure Multi-Party Computation. Proc. ACM Hum. Comput. Interact. 8(ETRA): 1-23 (2024)- [j19]Sebastian Hasler, Pascal Reisert, Marc Rivinius, Ralf Küsters:
Multipars: Reduced-Communication MPC over Z2k. Proc. Priv. Enhancing Technol. 2024(2): 5-28 (2024) - [c92]Mike Graf, Ralf Küsters, Daniel Rausch, Simon Egger, Marvin Bechtold, Marcel Flinspach:
Accountable Bulletin Boards: Definition and Provably Secure Implementation. CSF 2024: 201-216 - [c91]Pedram Hosseyni, Ralf Küsters, Tim Würtele:
Formal Security Analysis of the OpenID FAPI 2.0: Accompanying a Standardization Process. CSF 2024: 589-604 - [c90]Nicolas Huber, Ralf Küsters, Julian Liedtke, Daniel Rausch:
ZK-SNARKs for Ballot Validity: A Feasibility Study. E-Vote-ID 2024: 107-123 - [i63]Mayar Elfares, Pascal Reisert, Zhiming Hu, Wenwu Tang, Ralf Küsters, Andreas Bulling:
PrivatEyes: Appearance-based Gaze Estimation Using Federated Secure Multi-Party Computation. CoRR abs/2402.18970 (2024) - [i62]Pedram Hosseyni, Ralf Küsters, Tim Würtele:
Formal Security Analysis of the OpenID FAPI 2.0: Accompanying a Standardization Process. IACR Cryptol. ePrint Arch. 2024: 78 (2024) - [i61]Pascal Reisert, Marc Rivinius, Toomas Krips, Sebastian Hasler, Ralf Küsters:
Actively Secure Polynomial Evaluation from Shared Polynomial Encodings. IACR Cryptol. ePrint Arch. 2024: 1435 (2024) - [i60]Pedram Hosseyni, Ralf Küsters, Tim Würtele:
Formal Security Analysis of the OpenID FAPI 2.0 Family of Protocols: Accompanying a Standardization Process. IACR Cryptol. ePrint Arch. 2024: 1540 (2024) - [i59]Nicolas Huber, Ralf Küsters, Julian Liedtke, Daniel Rausch:
ZK-SNARKs for Ballot Validity: A Feasibility Study. IACR Cryptol. ePrint Arch. 2024: 1902 (2024) - 2023
- [j18]Marc Rivinius, Pascal Reisert, Sebastian Hasler, Ralf Küsters:
Convolutions in Overdrive: Maliciously Secure Convolutions for MPC. Proc. Priv. Enhancing Technol. 2023(3): 321-353 (2023) - [c89]Pascal Reisert, Marc Rivinius, Toomas Krips, Ralf Küsters:
Overdrive LowGear 2.0: Reduced-Bandwidth MPC without Sacrifice. AsiaCCS 2023: 372-386 - [c88]Karthikeyan Bhargavan, Abhishek Bichhawat, Pedram Hosseyni, Ralf Küsters, Klaas Pruiksma, Guido Schmitz, Clara Waldmann, Tim Würtele:
Layered Symbolic Security Analysis in $\textsf {DY}^\star $. ESORICS (3) 2023: 3-21 - [c87]Carmen Wabartha, Julian Liedtke, Nicolas Huber, Daniel Rausch, Ralf Küsters:
Fully Tally-Hiding Verifiable E-Voting for Real-World Elections with Seat-Allocations. ESORICS (1) 2023: 209-228 - [c86]Florian Helmschmidt, Pedram Hosseyni, Ralf Küsters, Klaas Pruiksma, Clara Waldmann, Tim Würtele:
The Grant Negotiation and Authorization Protocol: Attacking, Fixing, and Verifying an Emerging Standard. ESORICS (3) 2023: 222-242 - [c85]Mike Graf, Ralf Küsters, Daniel Rausch:
AUC: Accountable Universal Composability. SP 2023: 1148-1167 - [i58]Marc Rivinius, Pascal Reisert, Sebastian Hasler, Ralf Küsters:
Convolutions in Overdrive: Maliciously Secure Convolutions for MPC. IACR Cryptol. ePrint Arch. 2023: 359 (2023) - [i57]Sebastian Hasler, Toomas Krips, Ralf Küsters, Pascal Reisert, Marc Rivinius:
Overdrive LowGear 2.0: Reduced-Bandwidth MPC without Sacrifice. IACR Cryptol. ePrint Arch. 2023: 462 (2023) - [i56]Carmen Wabartha, Julian Liedtke, Nicolas Huber, Daniel Rausch, Ralf Küsters:
Fully Tally-Hiding Verifiable E-Voting for Real-World Elections with Seat-Allocations. IACR Cryptol. ePrint Arch. 2023: 1289 (2023) - [i55]Florian Helmschmidt, Pedram Hosseyni, Ralf Küsters, Klaas Pruiksma, Clara Waldmann, Tim Würtele:
The Grant Negotiation and Authorization Protocol: Attacking, Fixing, and Verifying an Emerging Standard. IACR Cryptol. ePrint Arch. 2023: 1325 (2023) - [i54]Karthikeyan Bhargavan, Abhishek Bichhawat, Pedram Hosseyni, Ralf Küsters, Klaas Pruiksma, Guido Schmitz, Clara Waldmann, Tim Würtele:
Layered Symbolic Security Analysis in DY$^\star$. IACR Cryptol. ePrint Arch. 2023: 1329 (2023) - [i53]Mike Graf, Ralf Küsters, Daniel Rausch, Simon Egger, Marvin Bechtold, Marcel Flinspach:
Accountable Bulletin Boards: Definition and Provably Secure Implementation. IACR Cryptol. ePrint Arch. 2023: 1869 (2023) - [i52]Sebastian Hasler, Pascal Reisert, Marc Rivinius, Ralf Küsters:
Multipars: Reduced-Communication MPC over Z2k. IACR Cryptol. ePrint Arch. 2023: 1932 (2023) - 2022
- [c84]Nicolas Huber, Ralf Küsters, Toomas Krips, Julian Liedtke, Johannes Müller, Daniel Rausch, Pascal Reisert, Andreas Vogt:
Kryvos: Publicly Tally-Hiding Verifiable E-Voting. CCS 2022: 1443-1457 - [c83]Hussam Amrouch, Jens Anders, Steffen Becker, Maik Betka, Gerd Bleher, Peter Domanski, Nourhan Elhamawy, Thomas Ertl, Athanasios Gatzastras, Paul R. Genssler, Sebastian Hasler, Martin Heinrich, André van Hoorn, Hanieh Jafarzadeh, Ingmar Kallfass, Florian Klemme, Steffen Koch, Ralf Küsters, Andrés Lalama, Raphaël Latty, Yiwen Liao, Natalia Lylina, Zahra Paria Najafi-Haghi, Dirk Pflüger, Ilia Polian, Jochen Rivoir, Matthias Sauer, Denis Schwachhofer, Steffen Templin, Christian Volmer, Stefan Wagner, Daniel Weiskopf, Hans-Joachim Wunderlich, Bin Yang, Martin Zimmermann:
Intelligent Methods for Test and Reliability. DATE 2022: 969-974 - [c82]Daniel Rausch, Ralf Küsters, Céline Chevalier:
Embedding the UC Model into the IITM Model. EUROCRYPT (2) 2022: 242-272 - [c81]Mayar Elfares, Zhiming Hu, Pascal Reisert, Andreas Bulling, Ralf Küsters:
Federated Learning for Appearance-based Gaze Estimation in the Wild. Gaze Meets ML 2022: 20-36 - [c80]Bernhard Beckert, Jurlind Budurushi, Armin Grunwald, Robert Krimmer, Oksana Kulyk, Ralf Küsters, Andreas Mayer, Jörn Müller-Quade, Stephan Neumann, Melanie Volkamer:
Recent Developments in the Context of Online Elections and Digital Polls in Germany. Sicherheit 2022: 213-217 - [c79]Quoc Huy Do, Pedram Hosseyni, Ralf Küsters, Guido Schmitz, Nils Wenzler, Tim Würtele:
A Formal Security Analysis of the W3C Web Payment APIs: Attacks and Verification. SP 2022: 215-234 - [c78]Marc Rivinius, Pascal Reisert, Daniel Rausch, Ralf Küsters:
Publicly Accountable Robust Multi-Party Computation. SP 2022: 2430-2449 - [i51]Mayar Elfares, Zhiming Hu, Pascal Reisert, Andreas Bulling, Ralf Küsters:
Federated Learning for Appearance-based Gaze Estimation in the Wild. CoRR abs/2211.07330 (2022) - [i50]Daniel Rausch, Ralf Küsters, Céline Chevalier:
Embedding the UC Model into the IITM Model. IACR Cryptol. ePrint Arch. 2022: 224 (2022) - [i49]Marc Rivinius, Pascal Reisert, Daniel Rausch, Ralf Küsters:
Publicly Accountable Robust Multi-Party Computation. IACR Cryptol. ePrint Arch. 2022: 436 (2022) - [i48]Pascal Reisert, Marc Rivinius, Toomas Krips, Ralf Küsters:
Arithmetic Tuples for MPC. IACR Cryptol. ePrint Arch. 2022: 667 (2022) - [i47]Nicolas Huber, Ralf Küsters, Toomas Krips, Julian Liedtke, Johannes Müller, Daniel Rausch, Pascal Reisert, Andreas Vogt:
Kryvos: Publicly Tally-Hiding Verifiable E-Voting. IACR Cryptol. ePrint Arch. 2022: 1132 (2022) - [i46]Mike Graf, Ralf Küsters, Daniel Rausch:
AUC: Accountable Universal Composability. IACR Cryptol. ePrint Arch. 2022: 1606 (2022) - 2021
- [c77]Karthikeyan Bhargavan, Abhishek Bichhawat, Quoc Huy Do, Pedram Hosseyni, Ralf Küsters, Guido Schmitz, Tim Würtele:
A Tutorial-Style Introduction to DY*. Protocols, Strands, and Logic 2021: 77-97 - [c76]Mike Graf, Daniel Rausch, Viktoria Ronge, Christoph Egger, Ralf Küsters, Dominique Schröder:
A Security Framework for Distributed Ledgers. CCS 2021: 1043-1064 - [c75]Karthikeyan Bhargavan, Abhishek Bichhawat, Quoc Huy Do, Pedram Hosseyni, Ralf Küsters, Guido Schmitz, Tim Würtele:
An In-Depth Symbolic Security Analysis of the ACME Standard. CCS 2021: 2601-2617 - [c74]Karthikeyan Bhargavan, Abhishek Bichhawat, Quoc Huy Do, Pedram Hosseyni, Ralf Küsters, Guido Schmitz, Tim Würtele:
DY*: A Modular Symbolic Verification Framework for Executable Cryptographic Protocol Code. EuroS&P 2021: 523-542 - [e5]Avishek Adhikari, Ralf Küsters, Bart Preneel:
Progress in Cryptology - INDOCRYPT 2021 - 22nd International Conference on Cryptology in India, Jaipur, India, December 12-15, 2021, Proceedings. Lecture Notes in Computer Science 13143, Springer 2021, ISBN 978-3-030-92517-8 [contents] - [i45]Christoph Egger, Mike Graf, Ralf Küsters, Daniel Rausch, Viktoria Ronge, Dominique Schröder:
A Security Framework for Distributed Ledgers. IACR Cryptol. ePrint Arch. 2021: 145 (2021) - [i44]Quoc Huy Do, Pedram Hosseyni, Ralf Küsters, Guido Schmitz, Nils Wenzler, Tim Würtele:
A Formal Security Analysis of the W3C Web Payment APIs: Attacks and Verification. IACR Cryptol. ePrint Arch. 2021: 1012 (2021) - [i43]Fabian Hertel, Nicolas Huber, Jonas Kittelberger, Ralf Küsters, Julian Liedtke, Daniel Rausch:
Extending the Tally-Hiding Ordinos System: Implementations for Borda, Hare-Niemeyer, Condorcet, and Instant-Runoff Voting. IACR Cryptol. ePrint Arch. 2021: 1420 (2021) - [i42]Karthikeyan Bhargavan, Abhishek Bichhawat, Quoc Huy Do, Pedram Hosseyni, Ralf Küsters, Guido Schmitz, Tim Würtele:
An In-Depth Symbolic Security Analysis of the ACME Standard. IACR Cryptol. ePrint Arch. 2021: 1457 (2021) - 2020
- [j17]Ralf Küsters, Max Tuengerthal, Daniel Rausch:
The IITM Model: A Simple and Expressive Model for Universal Composability. J. Cryptol. 33(4): 1461-1584 (2020) - [j16]Ralf Küsters, Max Tuengerthal, Daniel Rausch:
Joint State Composition Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation. J. Cryptol. 33(4): 1585-1658 (2020) - [c73]Ralf Küsters, Julian Liedtke, Johannes Müller, Daniel Rausch, Andreas Vogt:
Ordinos: A Verifiable Tally-Hiding E-Voting System. EuroS&P 2020: 216-235 - [c72]Mike Graf, Ralf Küsters, Daniel Rausch:
Accountability in a Permissioned Blockchain: Formal Analysis of Hyperledger Fabric. EuroS&P 2020: 236-255 - [e4]Robert Krimmer, Melanie Volkamer, Bernhard Beckert, Ralf Küsters, Oksana Kulyk, David Duenas-Cid, Mikhel Solvak:
Electronic Voting - 5th International Joint Conference, E-Vote-ID 2020, Bregenz, Austria, October 6-9, 2020, Proceedings. Lecture Notes in Computer Science 12455, Springer 2020, ISBN 978-3-030-60346-5 [contents] - [i41]Ralf Küsters, Daniel Rausch, Mike Simon:
Accountability in a Permissioned Blockchain: Formal Analysis of Hyperledger Fabric. IACR Cryptol. ePrint Arch. 2020: 386 (2020) - [i40]Ralf Küsters, Julian Liedtke, Johannes Müller, Daniel Rausch, Andreas Vogt:
Ordinos: A Verifiable Tally-Hiding E-Voting System. IACR Cryptol. ePrint Arch. 2020: 405 (2020)
2010 – 2019
- 2019
- [c71]Jan Camenisch, Stephan Krenn, Ralf Küsters, Daniel Rausch:
iUC: Flexible Universal Composability Made Simple. ASIACRYPT (3) 2019: 191-221 - [c70]Daniel Fett, Pedram Hosseyni, Ralf Küsters:
An Extensive Formal Security Analysis of the OpenID Financial-Grade API. IEEE Symposium on Security and Privacy 2019: 453-471 - [e3]Robert Krimmer, Melanie Volkamer, Véronique Cortier, Bernhard Beckert, Ralf Küsters, Uwe Serdült, David Duenas-Cid:
Electronic Voting - 4th International Joint Conference, E-Vote-ID 2019, Bregenz, Austria, October 1-4, 2019, Proceedings. Lecture Notes in Computer Science 11759, Springer 2019, ISBN 978-3-030-30624-3 [contents] - [i39]Daniel Fett, Pedram Hosseyni, Ralf Küsters:
An Extensive Formal Security Analysis of the OpenID Financial-grade API. CoRR abs/1901.11520 (2019) - [i38]Jan Camenisch, Ralf Küsters, Anna Lysyanskaya, Alessandra Scafuro:
Practical Yet Composably Secure Cryptographic Protocols (Dagstuhl Seminar 19042). Dagstuhl Reports 9(1): 88-103 (2019) - [i37]Jan Camenisch, Stephan Krenn, Ralf Küsters, Daniel Rausch:
iUC: Flexible Universal Composability Made Simple. IACR Cryptol. ePrint Arch. 2019: 1073 (2019) - 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
- [c69]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 - [c68]Ralf Küsters, Daniel Rausch:
A Framework for Universally Composable Diffie-Hellman Key Exchange. IEEE Symposium on Security and Privacy 2017: 881-900 - [c67]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 Cryptol. ePrint Arch. 2017: 256 (2017) - 2016
- [c66]Jan Camenisch, Robert R. Enderlein, Stephan Krenn, Ralf Küsters, Daniel Rausch:
Universal Composition with Responsive Environments. ASIACRYPT (2) 2016: 807-840 - [c65]Daniel Fett, Ralf Küsters, Guido Schmitz:
A Comprehensive Formal Security Analysis of OAuth 2.0. CCS 2016: 1204-1215 - [c64]Ralf Küsters, Johannes Müller, Enrico Scapin, Tomasz Truderung:
sElect: A Lightweight Verifiable Remote Voting System. CSF 2016: 341-354 - [c63]Ralf Küsters, Tomasz Truderung:
Security Analysis of Re-Encryption RPC Mix Nets. EuroS&P 2016: 227-242 - [c62]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 Cryptol. ePrint Arch. 2016: 34 (2016) - [i32]Véronique Cortier, David Galindo, Ralf Küsters, Johannes Müller, Tomasz Truderung:
Verifiability Notions for E-Voting Protocols. IACR Cryptol. ePrint Arch. 2016: 287 (2016) - [i31]Ralf Küsters, Johannes Müller, Enrico Scapin, Tomasz Truderung:
sElect: A Lightweight Verifiable Remote Voting System. IACR Cryptol. ePrint Arch. 2016: 438 (2016) - 2015
- [c61]Daniel Fett, Ralf Küsters, Guido Schmitz:
SPRESSO: A Secure, Privacy-Respecting Single Sign-On System for the Web. CCS 2015: 1358-1369 - [c60]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 - [c59]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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2015: 438 (2015) - 2014
- [j15]Ralf Küsters, Tomasz Truderung:
Security in e-voting. it Inf. Technol. 56(6): 300-306 (2014) - [c58]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 - [c57]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 - [c56]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]Ralf Küsters:
E-Voting Systems. Software Systems Safety 2014: 135-164 - [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 Cryptol. ePrint Arch. 2014: 38 (2014) - [i24]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking. IACR Cryptol. ePrint Arch. 2014: 341 (2014) - 2013
- [i23]Ralf Küsters, Max Tuengerthal:
The IITM Model: a Simple and Expressive Model for Universal Composability. IACR Cryptol. ePrint Arch. 2013: 25 (2013) - 2012
- [j14]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
A game-based definition of coercion resistance and its applications. J. Comput. Secur. 20(6): 709-764 (2012) - [c55]Ralf Küsters, Tomasz Truderung, Juergen Graf:
A Framework for the Cryptographic Verification of Java-Like Programs. CSF 2012: 198-212 - [c54]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 Cryptol. ePrint Arch. 2012: 116 (2012) - [i21]Ralf Küsters, Tomasz Truderung, Juergen Graf:
A Framework for the Cryptographic Verification of Java-like Programs. IACR Cryptol. ePrint Arch. 2012: 153 (2012) - 2011
- [b2]Ralf Küsters, Thomas Wilke:
Moderne Kryptographie - Eine Einführung. Vieweg + Teubner 2011, ISBN 978-3-519-00509-4 - [j13]Ralf Küsters, Tomasz Truderung:
Reducing Protocol Analysis with XOR to the XOR-Free Case in the Horn Theory Based Approach. J. Autom. Reason. 46(3-4): 325-352 (2011) - [c53]Ralf Küsters, Max Tuengerthal:
Composition theorems without pre-established session identifiers. CCS 2011: 41-50 - [c52]Ralf Küsters, Max Tuengerthal:
Ideal Key Derivation and Encryption in Simulation-Based Security. CT-RSA 2011: 161-179 - [c51]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 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 Cryptol. ePrint Arch. 2011: 406 (2011) - [i17]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
Verifiability, Privacy, and Coercion-Resistance: New Insights from a Case Study. IACR Cryptol. ePrint Arch. 2011: 517 (2011) - 2010
- [j12]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) - [c50]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
Accountability: definition and relationship to verifiability. CCS 2010: 526-535 - [c49]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
A Game-Based Definition of Coercion-Resistance and Its Applications. CSF 2010: 122-136 - [c48]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
Proving Coercion-Resistance of Scantegrity II. ICICS 2010: 281-295 - [c47]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 Cryptol. ePrint Arch. 2010: 236 (2010) - [i15]Ralf Küsters, Max Tuengerthal:
Ideal Key Derivation and Encryption in Simulation-based Security. IACR Cryptol. ePrint Arch. 2010: 295 (2010) - [i14]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
Proving Coercion-Resistance of Scantegrity II. IACR Cryptol. ePrint Arch. 2010: 502 (2010)
2000 – 2009
- 2009
- [c46]Ralf Küsters, Max Tuengerthal:
Computational soundness for key exchange protocols with symmetric encryption. CCS 2009: 91-100 - [c45]Ralf Küsters, Tomasz Truderung:
Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation. CSF 2009: 157-171 - [c44]Ralf Küsters, Max Tuengerthal:
Universally Composable Symmetric Encryption. CSF 2009: 293-307 - [c43]Ralf Küsters, Tomasz Truderung:
An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols. SP 2009: 251-266 - [c42]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
Improving and Simplifying a Variant of Prêt à Voter. VoteID 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 Cryptol. ePrint Arch. 2009: 55 (2009) - [i11]Ralf Küsters, Max Tuengerthal:
Computational Soundness for Key Exchange Protocols with Symmetric Encryption. IACR Cryptol. ePrint Arch. 2009: 392 (2009) - [i10]Ralf Küsters, Tomasz Truderung, Andreas Vogt:
A Game-Based Definition of Coercion-Resistance and its Applications. IACR Cryptol. ePrint Arch. 2009: 582 (2009) - 2008
- [j11]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) - [j10]Michael Backes, Markus Dürmuth, Dennis Hofheinz, Ralf Küsters:
Conditional reactive simulatability. Int. J. Inf. Sec. 7(2): 155-169 (2008) - [j9]Ralf Küsters, Anupam Datta, John C. Mitchell, Ajith Ramanathan:
On the Relationships between Notions of Simulation-Based Security. J. Cryptol. 21(4): 492-546 (2008) - [j8]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) - [c41]Ralf Küsters, Tomasz Truderung:
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach. CCS 2008: 129-138 - [c40]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 Cryptol. ePrint Arch. 2008: 6 (2008) - 2007
- [j7]Ralf Küsters, Thomas Wilke:
Transducer-based analysis of cryptographic protocols. Inf. Comput. 205(12): 1741-1776 (2007) - [c39]Klaas Ole Kürtz, Ralf Küsters, Thomas Wilke:
Selecting theories and nonce generation for recursive protocols. FMSE 2007: 61-70 - [c38]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 - [c37]Michael Backes, Markus Dürmuth, Ralf Küsters:
On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography. FSTTCS 2007: 108-120 - [c36]Detlef Kähler, Ralf Küsters, Tomasz Truderung:
Infinite State AMC-Model Checking for Cryptographic Protocols. LICS 2007: 181-192 - [c35]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 Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2007: 251 (2007) - 2006
- [c34]Ralf Küsters:
Simulation-Based Security with Inexhaustible Interactive Turing Machines. CSFW 2006: 309-320 - [c33]Michael Backes, Markus Dürmuth, Dennis Hofheinz, Ralf Küsters:
Conditional Reactive Simulatability. ESORICS 2006: 424-443 - [c32]Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi:
Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. FSTTCS 2006: 176-187 - [c31]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 Cryptol. ePrint Arch. 2006: 132 (2006) - [i3]Ralf Küsters:
Simulation-Based Security with Inexhaustible Interactive Turing Machines. IACR Cryptol. ePrint Arch. 2006: 151 (2006) - [i2]Anupam Datta, Ralf Küsters, John C. Mitchell, Ajith Ramanathan:
On the Relationships Between Notions of Simulation-Based Security. IACR Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 2006: 218 (2006) - 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. Stud 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) - [c30]Detlef Kähler, Ralf Küsters:
Constraint Solving for Contract-Signing Protocols. CONCUR 2005: 233-247 - [c29]Detlef Kähler, Ralf Küsters, Thomas Wilke:
Deciding Properties of Contract-Signing Protocols. STACS 2005: 158-169 - [c28]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
- [c27]Ralf Küsters, Thomas Wilke:
Automata-Based Analysis of Recursive Cryptographic Protocols. STACS 2004: 382-393 - [c26]Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani:
Deciding the Security of Protocols with Commuting Public Key Encryption. ARSPA@IJCAR 2004: 55-66 - 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. RWTH Aachen University, Germany, 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]Ralf Küsters, Ralf Molitor:
Computing Least Common Subsumers in ALEN. IJCAI 2001: 219-224 - [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]Franz Baader, Ralf Küsters, Ralf Molitor:
Rewriting Concepts Using Terminologies. KR 2000: 297-308
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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-12 22:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
