 | 2009 |
|---|
| 13 |       | Ralf Küsters,
Tomasz Truderung:
Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation.
CSF 2009: 157-171 |
| 12 | | Ralf Küsters,
Tomasz Truderung:
An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols.
IEEE Symposium on Security and Privacy 2009: 251-266 |
| 11 | | Ralf Küsters,
Tomasz Truderung,
Andreas Vogt:
Improving and Simplifying a Variant of Prêt à Voter.
VOTE-ID 2009: 37-53 |
| 10 | | Ralf Küsters,
Tomasz Truderung:
An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols
CoRR abs/0903.0802: (2009) |
| 2008 |
|---|
| 9 | | 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 |
| 8 | | 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) |
| 2007 |
|---|
| 7 | | Detlef Kähler,
Ralf Küsters,
Tomasz Truderung:
Infinite State AMC-Model Checking for Cryptographic Protocols.
LICS 2007: 181-192 |
| 6 | | Ralf Küsters,
Tomasz Truderung:
On the Automatic Analysis of Recursive Security Protocols with XOR.
STACS 2007: 646-657 |
| 2005 |
|---|
| 5 | | Tomasz Truderung:
Regular Protocols and Attacks with Regular Knowledge.
CADE 2005: 377-391 |
| 4 | | Tomasz Truderung:
Selecting Theories and Recursive Protocols.
CONCUR 2005: 217-232 |
| 2004 |
|---|
| 3 | | Pawel Rychlikowski,
Tomasz Truderung:
Set Constraints on Regular Terms.
CSL 2004: 458-472 |
| 2002 |
|---|
| 2 | | Jerzy Marcinkowski,
Tomasz Truderung:
Optimal Complexity Bounds for Positive LTL Games.
CSL 2002: 262-275 |
| 2001 |
|---|
| 1 |  | Pawel Rychlikowski,
Tomasz Truderung:
Polymorphic Directional Types for Logic Programming.
PPDP 2001: 61-72 |
