The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ralf Küsters: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Detlef Kähler, Ralf Küsters
    Constraint Solving for Contract-Signing Protocols. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:233-247 [Conf]
  2. Ralf Küsters
    On the Decidability of Cryptographic Protocols with Open-Ended Data Structures. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:515-530 [Conf]
  3. Ralf Küsters
    Simulation-Based Security with Inexhaustible Interactive Turing Machines. [Citation Graph (0, 0)][DBLP]
    CSFW, 2006, pp:309-320 [Conf]
  4. Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani, Laurent Vigneron
    Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:128-141 [Conf]
  5. Ralf Küsters
    Memoryless Determinacy of Parity Games. [Citation Graph (0, 0)][DBLP]
    Automata, Logics, and Infinite Games, 2001, pp:95-106 [Conf]
  6. Alexander Borgida, Ralf Küsters
    What's not in a name: Some Properties of a Purely Structural Approach to Integrating Large DL Knowledge Bases. [Citation Graph (0, 0)][DBLP]
    Description Logics, 2000, pp:65-78 [Conf]
  7. Franz Baader, Ralf Küsters
    Unification in a Description Logic with Transitive Closure of Roles. [Citation Graph (0, 0)][DBLP]
    Description Logics, 2001, pp:- [Conf]
  8. Franz Baader, Ralf Küsters
    Least Common Subsumer Computation w.r.t. cyclic ALN-Terminologies. [Citation Graph (0, 0)][DBLP]
    Description Logics, 1998, pp:- [Conf]
  9. Franz Baader, Ralf Küsters
    Matching in Description Logics with Existential Restrictions. [Citation Graph (0, 0)][DBLP]
    Description Logics, 1999, pp:- [Conf]
  10. Franz Baader, Ralf Küsters, Ralf Molitor
    Structural Subsumption Considered from an Automata-Theoretic Point of View. [Citation Graph (0, 0)][DBLP]
    Description Logics, 1998, pp:- [Conf]
  11. Franz Baader, Ralf Küsters, Frank Wolter
    Extensions to Description Logics. [Citation Graph (0, 0)][DBLP]
    Description Logic Handbook, 2003, pp:219-261 [Conf]
  12. Ralf Küsters
    Characterizing the semantics of terminological cycles with the help of finite automata. [Citation Graph (0, 0)][DBLP]
    Description Logics, 1997, pp:- [Conf]
  13. Michael Backes, Markus Dürmuth, Dennis Hofheinz, Ralf Küsters
    Conditional Reactive Simulatability. [Citation Graph (0, 0)][DBLP]
    ESORICS, 2006, pp:424-443 [Conf]
  14. Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani
    Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:124-135 [Conf]
  15. Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi
    Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:176-187 [Conf]
  16. Ralf Küsters, Thomas Wilke
    Deciding the First Level of the µ-Calculus Alternation Hierarchy. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:241-252 [Conf]
  17. Detlef Kähler, Ralf Küsters, Thomas Wilke
    A Dolev-Yao-Based Definition of Abuse-Free Protocols. [Citation Graph (0, 0)][DBLP]
    ICALP (2), 2006, pp:95-106 [Conf]
  18. Franz Baader, Sebastian Brandt, Ralf Küsters
    Matching under Side Conditions in Description Logics. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:213-218 [Conf]
  19. Franz Baader, Ralf Küsters, Ralf Molitor
    Computing Least Common Subsumers in Description Logics with Existential Restrictions. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1999, pp:96-103 [Conf]
  20. Ralf Küsters, Ralf Molitor
    Computing Least Common Subsumers in ALEN. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:219-224 [Conf]
  21. Franz Baader, Ralf Küsters
    Computing the Least Common Subsumer and the Most Specific Concept in the Presence of Cyclic ALN-Concept Descriptions. [Citation Graph (0, 0)][DBLP]
    KI, 1998, pp:129-140 [Conf]
  22. Ralf Küsters, Ralf Molitor
    Approximating Most Specific Concepts in Description Logics with Existential Restrictions. [Citation Graph (0, 0)][DBLP]
    KI/ÖGAI, 2001, pp:33-47 [Conf]
  23. Sebastian Brandt, Ralf Küsters, Anni-Yasmin Turhan
    Approximation and Difference in Description Logics. [Citation Graph (0, 0)][DBLP]
    KR, 2002, pp:203-214 [Conf]
  24. Franz Baader, Ralf Küsters
    Matching Concept Descriptions with Existential Restrictions. [Citation Graph (0, 0)][DBLP]
    KR, 2000, pp:261-272 [Conf]
  25. Franz Baader, Ralf Küsters, Ralf Molitor
    Rewriting Concepts Using Terminologies. [Citation Graph (0, 0)][DBLP]
    KR, 2000, pp:297-308 [Conf]
  26. Ralf Küsters
    Characterizing the Semantics of Terminological Cycles in ALN Using Finite Automata. [Citation Graph (0, 0)][DBLP]
    KR, 1998, pp:499-511 [Conf]
  27. Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani
    An NP Decision Procedure for Protocol Insecurity with XOR. [Citation Graph (0, 0)][DBLP]
    LICS, 2003, pp:261-270 [Conf]
  28. Franz Baader, Ralf Küsters
    Unification in a Description Logic with Transitive Closure of Roles. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:217-232 [Conf]
  29. Sebastian Brandt, Anni-Yasmin Turhan, Ralf Küsters
    Extensions of Non-standard Inferences to Descriptions Logics with Transitive Roles. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:122-136 [Conf]
  30. Detlef Kähler, Ralf Küsters, Thomas Wilke
    Deciding Properties of Contract-Signing Protocols. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:158-169 [Conf]
  31. Ralf Küsters, Thomas Wilke
    Automata-Based Analysis of Recursive Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:382-393 [Conf]
  32. Ralf Küsters, Tomasz Truderung
    On the Automatic Analysis of Recursive Security Protocols with XOR. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:646-657 [Conf]
  33. Anupam Datta, Ralf Küsters, John C. Mitchell, Ajith Ramanathan
    On the Relationships Between Notions of Simulation-Based Security. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:476-494 [Conf]
  34. Ralf Küsters, Ralf Molitor
    Approximating most specific concepts in description logics with existential restrictions. [Citation Graph (0, 0)][DBLP]
    AI Commun., 2002, v:15, n:1, pp:47-59 [Journal]
  35. Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani
    Deciding the Security of Protocols with Commuting Public Key Encryption. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:125, n:1, pp:55-66 [Journal]
  36. Ralf Küsters
    On the decidability of cryptographic protocols with open-ended data structures. [Citation Graph (0, 0)][DBLP]
    Int. J. Inf. Sec., 2005, v:4, n:1-2, pp:49-70 [Journal]
  37. Ralf Küsters, Alexander Borgida
    What's in an Attribute? Consequences for the Least Common Subsumer. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2001, v:14, n:, pp:167-203 [Journal]
  38. Franz Baader, Ralf Küsters, Alexander Borgida, Deborah L. McGuinness
    Matching in Description Logics. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1999, v:9, n:3, pp:411-447 [Journal]
  39. Ralf Küsters, Ralf Molitor
    Structural Subsumption and Least Common Subsumers in a Description Logic with Existential and Number Restrictions. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2005, v:81, n:2, pp:227-259 [Journal]
  40. Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani
    An NP decision procedure for protocol insecurity with XOR. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:338, n:1-3, pp:247-274 [Journal]
  41. Véronique Cortier, Ralf Küsters, Bogdan Warinschi
    A Cryptographic Model for Branching Time Security Properties - The Case of Contract Signing Protocols. [Citation Graph (0, 0)][DBLP]
    ESORICS, 2007, pp:422-437 [Conf]
  42. Detlef Kähler, Ralf Küsters, Tomasz Truderung
    Infinite State AMC-Model Checking for Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:181-192 [Conf]
  43. Max Tuengerthal, Ralf Küsters, Mathieu Turuani
    Implementing a Unification Algorithm for Protocol Analysis with XOR [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  44. Selecting theories and nonce generation for recursive protocols. [Citation Graph (, )][DBLP]


  45. Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach. [Citation Graph (, )][DBLP]


  46. Computational soundness for key exchange protocols with symmetric encryption. [Citation Graph (, )][DBLP]


  47. Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation. [Citation Graph (, )][DBLP]


  48. Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation. [Citation Graph (, )][DBLP]


  49. Universally Composable Symmetric Encryption. [Citation Graph (, )][DBLP]


  50. A Game-Based Definition of Coercion-Resistance and Its Applications. [Citation Graph (, )][DBLP]


  51. On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography. [Citation Graph (, )][DBLP]


  52. An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols. [Citation Graph (, )][DBLP]


  53. Improving and Simplifying a Variant of Prêt à Voter. [Citation Graph (, )][DBLP]


  54. Reducing Protocol Analysis with XOR to the XOR-free Case in the Horn Theory Based Approach [Citation Graph (, )][DBLP]


  55. An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols [Citation Graph (, )][DBLP]


Search in 0.088secs, Finished in 0.091secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002