Tomasz Truderung

CoRR, 2023

2017

Cast-as-Intended Mechanism with Return Codes Based on PETs.

[BibT_eX]

[DOI]

Achim Brelle

Proceedings of the Electronic Voting - Second International Joint Conference, 2017

2016

sElect: A Lightweight Verifiable Remote Voting System.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Verifiability Notions for E-Voting Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

SoK: Verifiability Notions for E-Voting Protocols.

[BibT_eX]

[DOI]

Proceedings of the IEEE Symposium on Security and Privacy, 2016

2015

A Hybrid Approach for Proving Noninterference of Java Programs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Security Analysis of Re-Encryption RPC Mix Nets.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

2014

Security in e-voting.

[BibT_eX]

[DOI]

it Inf. Technol., 2014

Formal Analysis of Chaumian Mix Nets with Randomized Partial Checking.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Extending and Applying a Framework for the Cryptographic Verification of Java Programs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

2012

Clash Attacks on the Verifiability of E-Voting Systems.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

A Framework for the Cryptographic Verification of Java-like Programs.

[BibT_eX]

[DOI]

Juergen Graf

IACR Cryptol. ePrint Arch., 2012

2011

Reducing Protocol Analysis with XOR to the XOR-Free Case in the Horn Theory Based Approach.

[BibT_eX]

[DOI]

J. Autom. Reason., 2011

Verifiability, Privacy, and Coercion-Resistance: New Insights from a Case Study.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

2010

Proving Coercion-Resistance of Scantegrity II.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

Accountability: Definition and Relationship to Verifiability.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

A Formal Definition of Online Abuse-Freeness.

[BibT_eX]

[DOI]

Henning Schnoor

Proceedings of the Security and Privacy in Communication Networks, 2010

2009

A Game-Based Definition of Coercion-Resistance and its Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Improving and Simplifying a Variant of Prêt à Voter.

[BibT_eX]

[DOI]

Proceedings of the E-Voting and Identity, Second International Conference, 2009

An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols.

[BibT_eX]

[DOI]

Proceedings of the 30th IEEE Symposium on Security and Privacy (SP 2009), 2009

Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE Computer Security Foundations Symposium, 2009

2007

On the Automatic Analysis of Recursive Security Protocols with XOR.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

Infinite State AMC-Model Checking for Cryptographic Protocols.

[BibT_eX]

[DOI]

Detlef Kähler

Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

2005

Selecting Theories and Recursive Protocols.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Regular Protocols and Attacks with Regular Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 2005

2004

Set Constraints on Regular Terms.

[BibT_eX]

[DOI]

Pawel Rychlikowski

Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2002

Optimal Complexity Bounds for Positive LTL Games.

[BibT_eX]

[DOI]

Jerzy Marcinkowski

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001

Polymorphic Directional Types for Logic Programming.

[BibT_eX]

[DOI]

Pawel Rychlikowski