Tomasz Truderung
Tomasz Truderung
Computer Science, University of Trier
Bestätigte E-Mail-Adresse bei uni-trier.de
Titel
Zitiert von
Zitiert von
Jahr
Accountability: definition and relationship to verifiability
R Küsters, T Truderung, A Vogt
Proceedings of the 17th ACM conference on Computer and communications …, 2010
1882010
Using ProVerif to analyze protocols with Diffie-Hellman exponentiation
R Küsters, T Truderung
2009 22nd IEEE Computer Security Foundations Symposium, 157-171, 2009
1232009
Clash attacks on the verifiability of e-voting systems
R Kusters, T Truderung, A Vogt
2012 IEEE Symposium on Security and Privacy, 395-409, 2012
1172012
Reducing protocol analysis with xor to the xor-free case in the horn theory based approach
R Küsters, T Truderung
Journal of Automated Reasoning 46 (3-4), 325-352, 2011
932011
Verifiability, privacy, and coercion-resistance: New insights from a case study
R Küsters, T Truderung, A Vogt
2011 IEEE Symposium on Security and Privacy, 538-553, 2011
832011
An epistemic approach to coercion-resistance for electronic voting protocols
R Küsters, T Truderung
2009 30th IEEE Symposium on Security and Privacy, 251-266, 2009
832009
A game-based definition of coercion resistance and its applications 1
R Küsters, T Truderung, A Vogt
Journal of Computer Security 20 (6), 709-764, 2012
772012
Sok: Verifiability notions for e-voting protocols
V Cortier, D Galindo, R Küsters, J Mueller, T Truderung
2016 IEEE Symposium on Security and Privacy (SP), 779-798, 2016
622016
A framework for the cryptographic verification of Java-like programs
R Küsters, T Truderung, J Graf
2012 IEEE 25th Computer Security Foundations Symposium, 198-212, 2012
462012
Selecting theories and recursive protocols
T Truderung
International Conference on Concurrency Theory, 217-232, 2005
342005
A hybrid approach for proving noninterference of Java programs
R Küsters, T Truderung, B Beckert, D Bruns, M Kirsten, M Mohr
2015 IEEE 28th Computer Security Foundations Symposium, 305-319, 2015
292015
On the automatic analysis of recursive security protocols with XOR
R Küsters, T Truderung
Annual Symposium on Theoretical Aspects of Computer Science, 646-657, 2007
292007
Formal analysis of chaumian mix nets with randomized partial checking
R Küsters, T Truderung, A Vogt
2014 IEEE Symposium on Security and Privacy, 343-358, 2014
262014
Proving coercion-resistance of scantegrity II
R Küsters, T Truderung, A Vogt
International Conference on Information and Communications Security, 281-295, 2010
242010
Extending and applying a framework for the cryptographic verification of java programs
R Küsters, E Scapin, T Truderung, J Graf
International Conference on Principles of Security and Trust, 220-239, 2014
212014
Infinite state AMC-model checking for cryptographic protocols
D Kahler, R Kusters, T Truderung
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 181-192, 2007
212007
sElect: A lightweight verifiable remote voting system
R Küsters, J Müller, E Scapin, T Truderung
2016 IEEE 29th Computer Security Foundations Symposium (CSF), 341-354, 2016
202016
Verifiability Notions for E-Voting Protocols.
V Cortier, D Galindo, R Küsters, J Müller, T Truderung
IACR Cryptol. ePrint Arch. 2016, 287, 2016
182016
Optimal complexity bounds for positive LTL games
J Marcinkowski, T Truderung
International Workshop on Computer Science Logic, 262-275, 2002
122002
Selecting theories and recursive protocols, CONCUR 2005-Concurrency Theory
T Truderung
Springer-Verlag, London, UK, 2005
112005
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20