Tomasz Truderung

Affiliations:
  • Polyas GmbH, Germany
  • University of Trier, Department of Computer Science, Germany (former)


According to our database1, Tomasz Truderung authored at least 30 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Systematic User Evaluation of a Second Device Based Cast-as-Intended Verifiability Approach.
Proceedings of the Financial Cryptography and Data Security. FC 2024 International Workshops, 2024

2023
A Protocol for Cast-as-Intended Verifiability with a Second Device.
CoRR, 2023

CAISED: A Protocol for Cast-as-Intended Verifiability with a Second Device.
Proceedings of the Electronic Voting: 8th International Joint Conference, 2023

2017
Cast-as-Intended Mechanism with Return Codes Based on PETs.
Proceedings of the Electronic Voting - Second International Joint Conference, 2017

2016
Verifiability Notions for E-Voting Protocols.
IACR Cryptol. ePrint Arch., 2016

SoK: Verifiability Notions for E-Voting Protocols.
Proceedings of the IEEE Symposium on Security and Privacy, 2016

Security Analysis of Re-Encryption RPC Mix Nets.
Proceedings of the IEEE European Symposium on Security and Privacy, 2016

sElect: A Lightweight Verifiable Remote Voting System.
Proceedings of the IEEE 29th Computer Security Foundations Symposium, 2016

2015
A Hybrid Approach for Proving Noninterference of Java Programs.
Proceedings of the IEEE 28th Computer Security Foundations Symposium, 2015

2014
Security in e-voting.
it Inf. Technol., 2014

Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking.
Proceedings of the 2014 IEEE Symposium on Security and Privacy, 2014

Extending and Applying a Framework for the Cryptographic Verification of Java Programs.
Proceedings of the Principles of Security and Trust - Third International Conference, 2014

2012
Clash Attacks on the Verifiability of E-Voting Systems.
Proceedings of the IEEE Symposium on Security and Privacy, 2012

A Framework for the Cryptographic Verification of Java-Like Programs.
Proceedings of the 25th IEEE Computer Security Foundations Symposium, 2012

2011
Verifiability, Privacy, and Coercion-Resistance: New Insights from a Case Study.
Proceedings of the 32nd IEEE Symposium on Security and Privacy, 2011

2010
A Formal Definition of Online Abuse-Freeness.
Proceedings of the Security and Privacy in Communication Networks, 2010

Proving Coercion-Resistance of Scantegrity II.
Proceedings of the Information and Communications Security - 12th International Conference, 2010

A Game-Based Definition of Coercion-Resistance and Its Applications.
Proceedings of the 23rd IEEE Computer Security Foundations Symposium, 2010

Accountability: definition and relationship to verifiability.
Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

2009
Improving and Simplifying a Variant of Prêt à Voter.
Proceedings of the E-Voting and Identity, Second International Conference, 2009

An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols.
Proceedings of the 30th IEEE Symposium on Security and Privacy (SP 2009), 2009

Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation.
Proceedings of the 22nd IEEE Computer Security Foundations Symposium, 2009

2008
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach.
Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008

2007
On the Automatic Analysis of Recursive Security Protocols with XOR.
Proceedings of the STACS 2007, 2007

Infinite State AMC-Model Checking for Cryptographic Protocols.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

2005
Selecting Theories and Recursive Protocols.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Regular Protocols and Attacks with Regular Knowledge.
Proceedings of the Automated Deduction, 2005

2004
Set Constraints on Regular Terms.
Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2002
Optimal Complexity Bounds for Positive LTL Games.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001
Polymorphic Directional Types for Logic Programming.
Proceedings of the 3rd international ACM SIGPLAN conference on Principles and practice of declarative programming, 2001


  Loading...