Jannik Dreier

Orcid: 0000-0002-1026-3360

According to our database1, Jannik Dreier authored at least 41 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Shaken, not Stirred - Automated Discovery of Subtle Attacks on Protocols using Mix-Nets.
Proceedings of the 33rd USENIX Security Symposium, 2024

2022
Optimal threshold padlock systems.
J. Comput. Secur., 2022

Automatic generation of sources lemmas in Tamarin: Towards automatic proofs of security protocols.
J. Comput. Secur., 2022

Tamarin: Verification of Large-Scale, Real-World, Cryptographic Protocols.
IEEE Secur. Priv., 2022

Themis: An On-Site Voting System with Systematic Cast-as-intended Verification and Partial Accountability.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
Verifying Table-Based Elections.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
A faster cryptographer's Conspiracy Santa.
Theor. Comput. Sci., 2020

Verification of stateful cryptographic protocols with exclusive OR.
J. Comput. Secur., 2020

Automatic Generation of Sources Lemmas in Tamarin: Towards Automatic Proofs of Security Protocols.
Proceedings of the Computer Security - ESORICS 2020, 2020

2019
Security Issues in the 5G Standard and How Formal Methods Come to the Rescue.
ERCIM News, 2019

Formally and practically verifying flow properties in industrial systems.
Comput. Secur., 2019

2018
Physical Zero-Knowledge Proof for Makaro.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

Security analysis and psychological study of authentication methods with PIN codes.
Proceedings of the 12th International Conference on Research Challenges in Information Science, 2018

A Cryptographer's Conspiracy Santa.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

Automated Unbounded Verification of Stateful Cryptographic Protocols with Exclusive OR.
Proceedings of the 31st IEEE Computer Security Foundations Symposium, 2018

A Formal Analysis of 5G Authentication.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
Symbolically analyzing security protocols using tamarin.
ACM SIGLOG News, 2017

How to explain modern security concepts to your children.
Cryptologia, 2017

Formally Verifying Flow Properties in Industrial Systems.
Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017), 2017

Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols.
Proceedings of the Principles of Security and Trust - 6th International Conference, 2017

Formal Analysis of Combinations of Secure Protocols.
Proceedings of the Foundations and Practice of Security - 10th International Symposium, 2017

A Novel Approach for Reasoning about Liveness in Cryptographic Protocols and Its Application to Fair Exchange.
Proceedings of the 2017 IEEE European Symposium on Security and Privacy, 2017

2016
On the existence and decidability of unique decompositions of processes in the applied π-calculus.
Theor. Comput. Sci., 2016

Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015
Brandt's fully private auction protocol revisited.
J. Comput. Secur., 2015

Formal Analysis of E-Cash Protocols.
Proceedings of the SECRYPT 2015, 2015

A Framework for Analyzing Verifiability in Traditional and Electronic Exams.
Proceedings of the Information Security Practice and Experience, 2015

Automated Verification of e-Cash Protocols.
Proceedings of the E-Business and Telecommunications - 12th International Joint Conference, 2015

Automated Symbolic Proofs of Observational Equivalence.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
Formal Analysis of Electronic Exams.
Proceedings of the SECRYPT 2014, 2014

Formal Security Analysis of Traditional and Electronic Exams.
Proceedings of the E-Business and Telecommunications - 11th International Joint Conference, 2014

Secure Auctions without Cryptography.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013
Formal Verification of e-Auction Protocols.
Proceedings of the Principles of Security and Trust - Second International Conference, 2013

On Unique Decomposition of Processes in the Applied π-Calculus.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

Defining verifiability in e-auction protocols.
Proceedings of the 8th ACM Symposium on Information, Computer and Communications Security, 2013

2012
Attacking Privacy in a Fully Private Auction Protocol
CoRR, 2012

A formal taxonomy of privacy in voting protocols.
Proceedings of IEEE International Conference on Communications, 2012

Defining Privacy for Weighted Votes, Single and Multi-voter Coercion.
Proceedings of the Computer Security - ESORICS 2012, 2012

2011
Practical Secure and Efficient Multiparty Linear Programming Based on Problem Transformation.
IACR Cryptol. ePrint Arch., 2011

Practical Privacy-Preserving Multiparty Linear Programming Based on Problem Transformation.
Proceedings of the PASSAT/SocialCom 2011, Privacy, 2011

Vote-Independence: A Powerful Privacy Notion for Voting Protocols.
Proceedings of the Foundations and Practice of Security, 2011


  Loading...