Ralf Küsters

	2012
90		Ralf Küsters, Tomasz Truderung, Andreas Vogt: Clash Attacks on the Verifiability of E-Voting Systems. IACR Cryptology ePrint Archive 2012: 116 (2012)
89		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
88		Ralf Küsters, Thomas Wilke: Moderne Kryptographie - Eine Einführung. Vieweg + Teubner 2011
87		Ralf Küsters, Max Tuengerthal: Composition theorems without pre-established session identifiers. ACM Conference on Computer and Communications Security 2011: 41-50
86		Ralf Küsters, Max Tuengerthal: Ideal Key Derivation and Encryption in Simulation-Based Security. CT-RSA 2011: 161-179
85		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
84		Alexander Borgida, Ralf Küsters: What's in an Attribute? Consequences for the Least Common Subsumer CoRR abs/1106.0238: (2011)
83		Hubert Comon-Lundh, Ralf Küsters, Catherine Meadows: Security and Rewriting (Dagstuhl Seminar 11332). Dagstuhl Reports 1(8): 53-66 (2011)
82		Ralf Küsters, Max Tuengerthal: Composition Theorems Without Pre-Established Session Identifiers. IACR Cryptology ePrint Archive 2011: 406 (2011)
81		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)
80		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)
	2010
79		Ralf Küsters, Tomasz Truderung, Andreas Vogt: Accountability: definition and relationship to verifiability. ACM Conference on Computer and Communications Security 2010: 526-535
78		Ralf Küsters, Tomasz Truderung, Andreas Vogt: A Game-Based Definition of Coercion-Resistance and Its Applications. CSF 2010: 122-136
77		Ralf Küsters, Tomasz Truderung, Andreas Vogt: Proving Coercion-Resistance of Scantegrity II. ICICS 2010: 281-295
76		Ralf Küsters, Henning Schnoor, Tomasz Truderung: A Formal Definition of Online Abuse-Freeness. SecureComm 2010: 484-497
75		Detlef Kähler, Ralf Küsters, Thomas Wilke: Deciding strategy properties of contract-signing protocols. ACM Trans. Comput. Log. 11(3): (2010)
74		Ralf Küsters, Tomasz Truderung, Andreas Vogt: Accountability: Definition and Relationship to Verifiability. IACR Cryptology ePrint Archive 2010: 236 (2010)
73		Ralf Küsters, Max Tuengerthal: Ideal Key Derivation and Encryption in Simulation-based Security. IACR Cryptology ePrint Archive 2010: 295 (2010)
72		Ralf Küsters, Tomasz Truderung, Andreas Vogt: Proving Coercion-Resistance of Scantegrity II. IACR Cryptology ePrint Archive 2010: 502 (2010)
	2009
71		Ralf Küsters, Max Tuengerthal: Computational soundness for key exchange protocols with symmetric encryption. ACM Conference on Computer and Communications Security 2009: 91-100
70		Ralf Küsters, Tomasz Truderung: Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation. CSF 2009: 157-171
69		Ralf Küsters, Max Tuengerthal: Universally Composable Symmetric Encryption. CSF 2009: 293-307
68		Ralf Küsters, Tomasz Truderung: An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols. IEEE Symposium on Security and Privacy 2009: 251-266
67		Ralf Küsters, Tomasz Truderung, Andreas Vogt: Improving and Simplifying a Variant of Prêt à Voter. VOTE-ID 2009: 37-53
66		Ralf Küsters, Tomasz Truderung: An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols CoRR abs/0903.0802: (2009)
65		Ralf Küsters, Max Tuengerthal: Computational Soundness for Key Exchange Protocols with Symmetric Encryption. IACR Cryptology ePrint Archive 2009: 392 (2009)
64		Ralf Küsters, Max Tuengerthal: Universally Composable Symmetric Encryption. IACR Cryptology ePrint Archive 2009: 55 (2009)
63		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
62		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
61		Ralf Küsters, Max Tuengerthal: Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation. CSF 2008: 270-284
60		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): (2008)
59		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)
58		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)
57		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)
56		Michael Backes, Markus Dürmuth, Dennis Hofheinz, Ralf Küsters: Conditional reactive simulatability. Int. J. Inf. Sec. 7(2): 155-169 (2008)
55		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)
	2007
54		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
53		Klaas Ole Kürtz, Ralf Küsters, Thomas Wilke: Selecting theories and nonce generation for recursive protocols. FMSE 2007: 61-70
52		Michael Backes, Markus Dürmuth, Ralf Küsters: On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography. FSTTCS 2007: 108-120
51		Detlef Kähler, Ralf Küsters, Tomasz Truderung: Infinite State AMC-Model Checking for Cryptographic Protocols. LICS 2007: 181-192
50		Ralf Küsters, Tomasz Truderung: On the Automatic Analysis of Recursive Security Protocols with XOR. STACS 2007: 646-657
49		Michael Backes, Markus Dürmuth, Ralf Küsters: On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography. IACR Cryptology ePrint Archive 2007: 233 (2007)
48		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)
47		Ralf Küsters, Thomas Wilke: Transducer-based analysis of cryptographic protocols. Inf. Comput. 205(12): 1741-1776 (2007)
	2006
46		Ralf Küsters: Simulation-Based Security with Inexhaustible Interactive Turing Machines. CSFW 2006: 309-320
45		Michael Backes, Markus Dürmuth, Dennis Hofheinz, Ralf Küsters: Conditional Reactive Simulatability. ESORICS 2006: 424-443
44		Véronique Cortier, Steve Kremer, Ralf Küsters, Bogdan Warinschi: Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. FSTTCS 2006: 176-187
43		Detlef Kähler, Ralf Küsters, Thomas Wilke: A Dolev-Yao-Based Definition of Abuse-Free Protocols. ICALP (2) 2006: 95-106
42		Max Tuengerthal, Ralf Küsters, Mathieu Turuani: Implementing a Unification Algorithm for Protocol Analysis with XOR CoRR abs/cs/0610014: (2006)
41		Michael Backes, Markus Dürmuth, Dennis Hofheinz, Ralf Küsters: Conditional Reactive Simulatability. IACR Cryptology ePrint Archive 2006: 132 (2006)
40		Ralf Küsters: Simulation-Based Security with Inexhaustible Interactive Turing Machines. IACR Cryptology ePrint Archive 2006: 151 (2006)
39		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)
38		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
37		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
36		Detlef Kähler, Ralf Küsters: Constraint Solving for Contract-Signing Protocols. CONCUR 2005: 233-247
35		Detlef Kähler, Ralf Küsters, Thomas Wilke: Deciding Properties of Contract-Signing Protocols. STACS 2005: 158-169
34		Anupam Datta, Ralf Küsters, John C. Mitchell, Ajith Ramanathan: On the Relationships Between Notions of Simulation-Based Security. TCC 2005: 476-494
33		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)
32		Ralf Küsters: On the decidability of cryptographic protocols with open-ended data structures. Int. J. Inf. Sec. 4(1-2): 49-70 (2005)
31		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)
30		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)
	2004
29		Ralf Küsters, Thomas Wilke: Automata-Based Analysis of Recursive Cryptographic Protocols. STACS 2004: 382-393
	2003
28		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
27		Franz Baader, Ralf Küsters, Frank Wolter: Extensions to Description Logics. Description Logic Handbook 2003: 219-261
26		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
25		Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani: An NP Decision Procedure for Protocol Insecurity with XOR. LICS 2003: 261-270
24		Sebastian Brandt, Anni-Yasmin Turhan, Ralf Küsters: Extensions of Non-standard Inferences to Descriptions Logics with Transitive Roles. LPAR 2003: 122-136
	2002
23		Ralf Küsters: On the Decidability of Cryptographic Protocols with Open-Ended Data Structures. CONCUR 2002: 515-530
22		Ralf Küsters, Thomas Wilke: Deciding the First Level of the µ-Calculus Alternation Hierarchy. FSTTCS 2002: 241-252
21		Sebastian Brandt, Ralf Küsters, Anni-Yasmin Turhan: Approximation and Difference in Description Logics. KR 2002: 203-214
20		Ralf Küsters, Ralf Molitor: Approximating most specific concepts in description logics with existential restrictions. AI Commun. 15(1): 47-59 (2002)
	2001
19		Ralf Küsters: Non-Standard Inferences in Description Logics Springer 2001
18		Ralf Küsters: Memoryless Determinacy of Parity Games. Automata, Logics, and Infinite Games 2001: 95-106
17		Franz Baader, Ralf Küsters: Unification in a Description Logic with Transitive Closure of Roles. Description Logics 2001
16		Franz Baader, Sebastian Brandt, Ralf Küsters: Matching under Side Conditions in Description Logics. IJCAI 2001: 213-218
15		Ralf Küsters, Ralf Molitor: Computing Least Common Subsumers in ALEN. IJCAI 2001: 219-224
14		Ralf Küsters, Ralf Molitor: Approximating Most Specific Concepts in Description Logics with Existential Restrictions. KI/ÖGAI 2001: 33-47
13		Franz Baader, Ralf Küsters: Unification in a Description Logic with Transitive Closure of Roles. LPAR 2001: 217-232
12		Ralf Küsters, Alexander Borgida: What's in an Attribute? Consequences for the Least Common Subsumer. J. Artif. Intell. Res. (JAIR) 14: 167-203 (2001)
	2000
11		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
10		Franz Baader, Ralf Küsters: Matching Concept Descriptions with Existential Restrictions. KR 2000: 261-272
9		Franz Baader, Ralf Küsters, Ralf Molitor: Rewriting Concepts Using Terminologies. KR 2000: 297-308
	1999
8		Franz Baader, Ralf Küsters: Matching in Description Logics with Existential Restrictions. Description Logics 1999
7		Franz Baader, Ralf Küsters, Ralf Molitor: Computing Least Common Subsumers in Description Logics with Existential Restrictions. IJCAI 1999: 96-103
6		Franz Baader, Ralf Küsters, Alexander Borgida, Deborah L. McGuinness: Matching in Description Logics. J. Log. Comput. 9(3): 411-447 (1999)
	1998
5		Franz Baader, Ralf Küsters: Least Common Subsumer Computation w.r.t. cyclic ALN-Terminologies. Description Logics 1998
4		Franz Baader, Ralf Küsters, Ralf Molitor: Structural Subsumption Considered from an Automata-Theoretic Point of View. Description Logics 1998
3		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
2		Ralf Küsters: Characterizing the Semantics of Terminological Cycles in ALN Using Finite Automata. KR 1998: 499-511
	1997
1		Ralf Küsters: Characterizing the semantics of terminological cycles with the help of finite automata. Description Logics 1997

Coauthor Index

1	Vijayalakshmi Atluri (Vijay Atluri)	[37]
2	Franz Baader	[3] [4] [5] [6] [7] [8] [9] [10] [13] [16] [17] [27]
3	Michael Backes	[41] [45] [49] [52] [56]
4	Alexander Borgida	[6] [11] [12] [84]
5	Sebastian Brandt	[16] [21] [24]
6	Yannick Chevalier	[25] [26] [28] [30] [33] [60]
7	Hubert Comon-Lundh (Hubert Comon)	[83]
8	Véronique Cortier	[38] [44] [48] [54]
9	Anupam Datta	[34] [39] [55]
10	Pierpaolo Degano	[57]
11	Markus Dürmuth	[41] [45] [49] [52] [56]
12	Juergen Graf	[89]
13	Dennis Hofheinz	[41] [45] [56]
14	Detlef Kähler	[35] [36] [43] [51] [75]
15	Steve Kremer	[38] [44]
16	Klaas Ole Kürtz	[53]
17	Deborah L. McGuinness	[6]
18	Catherine Meadows	[83]
19	John C. Mitchell	[34] [37] [39] [55]
20	Ralf Molitor	[4] [7] [9] [14] [15] [20] [31]
21	Ajith Ramanathan	[34] [39] [55]
22	Michaël Rusinowitch	[25] [26] [28] [30] [33] [60]
23	Pierangela Samarati	[37]
24	Henning Schnoor	[76]
25	Tomasz Truderung	[50] [51] [59] [62] [63] [66] [67] [68] [70] [72] [74] [76] [77] [78] [79] [80] [81] [85] [89] [90]
26	Max Tuengerthal	[42] [58] [61] [64] [65] [69] [71] [73] [82] [86] [87]
27	Anni-Yasmin Turhan	[21] [24]
28	Mathieu Turuani	[25] [26] [28] [30] [33] [42] [60]
29	Luca Viganò	[57]
30	Laurent Vigneron	[28]
31	Andreas Vogt	[63] [67] [72] [74] [77] [78] [79] [81] [85] [90]
32	Bogdan Warinschi	[38] [44] [48] [54]
33	Thomas Wilke	[22] [29] [35] [43] [47] [53] [75] [88]
34	Frank Wolter	[27]
35	Steve Zdancewic	[57]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page