Thomas Zacharias

Orcid: 0000-0002-5022-8543

Affiliations:
  • University of Glasgow, UK
  • University of Edinburgh, UK (former)
  • National and Kapodistrian University of Athens, Greece (former)


According to our database1, Thomas Zacharias authored at least 33 papers between 2013 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
ICT: Insured Cryptocurrency Transactions.
IACR Cryptol. ePrint Arch., 2025

E-cclesia: Universally Composable Self-Tallying Elections over Anonymous Broadcast.
IACR Commun. Cryptol., 2025

Attacking and Fixing the Android Protected Confirmation Protocol.
Proceedings of the 10th IEEE European Symposium on Security and Privacy, 2025

2024
Blockchain Bribing Attacks and the Efficacy of Counterincentives.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023
Are continuous stop-and-go mixnets provably secure?
IACR Cryptol. ePrint Arch., 2023

Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Recurring Contingent Service Payment.
Proceedings of the 8th IEEE European Symposium on Security and Privacy, 2023

On the (De) centralization of FruitChains.
Proceedings of the 36th IEEE Computer Security Foundations Symposium, 2023

2022
An Efficient E2E Crowd Verifiable E-Voting System.
IEEE Trans. Dependable Secur. Comput., 2022

Glass-Vault: A Generic Transparent Privacy-preserving Exposure Notification Analytics Platform.
IACR Cryptol. ePrint Arch., 2022

Blockchain Nash Dynamics and the Pursuit of Compliance.
Proceedings of the 4th ACM Conference on Advances in Financial Technologies, 2022

2021
Recurring Contingent Payment for Proofs of Retrievability.
IACR Cryptol. ePrint Arch., 2021

Polynomial Representation Is Tricky: Maliciously Secure Private Set Intersection Revisited.
Proceedings of the Computer Security - ESORICS 2021, 2021

Astrolabous: A Universally Composable Time-Lock Encryption Scheme.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
E-cclesia: Universally Composable Self-Tallying Elections.
IACR Cryptol. ePrint Arch., 2020

Crowd Verifiable Zero-Knowledge and End-to-End Verifiable Multiparty Computation.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
Distributed, end-to-end verifiable, and privacy-preserving internet voting systems.
Comput. Secur., 2019

2018
On the Security Properties of e-Voting Bulletin Boards.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

A Universally Composable Framework for the Privacy of Email Ecosystems.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
Auditing for privacy in threshold PKE e-voting.
Inf. Comput. Secur., 2017

An Efficient E2E Verifiable E-voting System without Setup Assumptions.
IEEE Secur. Priv., 2017

MCMix: Anonymous Messaging via Secure Multiparty Computation.
Proceedings of the 26th USENIX Security Symposium, 2017

Ceremonies for End-to-End Verifiable Elections.
Proceedings of the Public-Key Cryptography - PKC 2017, 2017

2016
The DEMOS family of e-voting systems: end-to-end verifiable elections in the standard model
PhD thesis, 2016

D-DEMOS: A Distributed, End-to-End Verifiable, Internet Voting System.
Proceedings of the 36th IEEE International Conference on Distributed Computing Systems, 2016

Indistinguishable Proofs of Work or Knowledge.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
A distributed, end-to-end verifiable, internet voting system.
CoRR, 2015

End-to-End Verifiable Elections in the Standard Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

On the Necessity of Auditing for Election Privacy in e-Voting Systems.
Proceedings of the E-Democracy - Citizen Rights in the World of the New Computing Paradigms, 2015

DEMOS-2: Scalable E2E Verifiable Elections without Random Oracles.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
Pressing the button for European elections: verifiable e-voting and public attitudes toward internet voting in Greece.
Proceedings of the 6th International Conference on Electronic Voting: Verifying the Vote, 2014

2013
Electronic Voting Systems - From Theory to Implementation.
Proceedings of the E-Democracy, Security, Privacy and Trust in a Digital World, 2013

Delegatable pseudorandom functions and applications.
Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013


  Loading...