Ben Smyth

According to our database1, Ben Smyth authored at least 45 papers between 2007 and 2022.

Collaborative distances:



In proceedings 
PhD thesis 




Surveying definitions of election verifiability.
Inf. Process. Lett., 2022

Ballot secrecy: Security definition, sufficient conditions, and analysis of Helios.
J. Comput. Secur., 2021

Cast-as-Intended: A Formal Definition and Case Studies.
Proceedings of the Financial Cryptography and Data Security. FC 2021 International Workshops, 2021

Surveying global verifiability.
Inf. Process. Lett., 2020

Mind the Gap: Individual- and universal-verifiability plus cast-as-intended don't yield verifiable voting systems.
IACR Cryptol. ePrint Arch., 2020

Exploiting re-voting in the Helios election system.
Inf. Process. Lett., 2019

Non-malleable encryption with proofs of plaintext knowledge and applications to voting.
Int. J. Secur. Networks, 2019

Surveying definitions of coercion resistance.
IACR Cryptol. ePrint Arch., 2019

Athena: A verifiable, coercion-resistant voting system with linear complexity.
IACR Cryptol. ePrint Arch., 2019

A critique of game-based definitions of receipt-freeness for voting.
IACR Cryptol. ePrint Arch., 2019

An Overview of GSMA's M2M Remote Provisioning Specification.
CoRR, 2019

TLS 1.3 for engineers: An exploration of the TLS 1.3 specification and Oracle's Java implementation.
CoRR, 2019

Secret, verifiable auctions from elections.
Theor. Comput. Sci., 2018

Automated reasoning for equivalences in the applied pi calculus with barriers.
J. Comput. Secur., 2018

A foundation for secret, verifiable elections.
IACR Cryptol. ePrint Arch., 2018

Verifiability of Helios Mixnet.
IACR Cryptol. ePrint Arch., 2018

Authentication with weaker trust assumptions for voting systems.
IACR Cryptol. ePrint Arch., 2018

Modelling and Analysis of a Hierarchy of Distance Bounding Attacks.
Proceedings of the 27th USENIX Security Symposium, 2018

Attacks Against GSMA's M2M Remote Provisioning (Short Paper).
Proceedings of the Financial Cryptography and Data Security, 2018

A short introduction to secrecy and verifiability for elections.
CoRR, 2017

CryptoCache: Network caching with confidentiality.
Proceedings of the IEEE International Conference on Communications, 2017

Adapting Helios for provable ballot privacy.
IACR Cryptol. ePrint Arch., 2016

An attack against the Helios election system that violates eligibility.
CoRR, 2016

Formal analysis of privacy in Direct Anonymous Attestation schemes.
Sci. Comput. Program., 2015

Computational Election Verifiability: Definitions and an Analysis of Helios and JCJ.
IACR Cryptol. ePrint Arch., 2015

Secrecy and independence for election schemes.
IACR Cryptol. ePrint Arch., 2015

Constructing secret, verifiable auction schemes from election schemes.
IACR Cryptol. ePrint Arch., 2015

Automatically Checking Commitment Protocols in ProVerif without False Attacks.
Proceedings of the Principles of Security and Trust - 4th International Conference, 2015

NM-CPA Secure Encryption with Proofs of Plaintext Knowledge.
Proceedings of the Advances in Information and Computer Security, 2015

Ballot secrecy with malicious bulletin boards.
IACR Cryptol. ePrint Arch., 2014

Hawk and Aucitas: e-Auction Schemes from the Helios and Civitas e-Voting Schemes.
Proceedings of the Financial Cryptography and Data Security, 2014

Ballot secrecy and ballot independence coincide.
IACR Cryptol. ePrint Arch., 2013

Truncating TLS Connections to Violate Beliefs in Web Applications.
Proceedings of the 7th USENIX Workshop on Offensive Technologies, 2013

Formal analysis of privacy in Direct Anonymous Attestation schemes.
IACR Cryptol. ePrint Arch., 2012

Replay attacks that violate ballot secrecy in Helios.
IACR Cryptol. ePrint Arch., 2012

Secure authenticated key exchange with revocation for smart grid.
Proceedings of the IEEE PES Innovative Smart Grid Technologies Conference, 2012

A Fair and Robust Voting System by Broadcast.
Proceedings of the 5th International Conference on Electronic Voting 2012, 2012

Formal verification of cryptographic protocols with automated reasoning.
PhD thesis, 2011

Formal Analysis of Anonymity in ECC-Based Direct Anonymous Attestation Schemes.
Proceedings of the Formal Aspects of Security and Trust - 8th International Workshop, 2011

Applied pi calculus.
Proceedings of the Formal Models and Techniques for Analyzing Security Protocols, 2011

Attacking and fixing Helios: An analysis of ballot secrecy.
IACR Cryptol. ePrint Arch., 2010

Towards Automatic Analysis of Election Verifiability Properties.
Proceedings of the Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security, 2010

Election Verifiability in Electronic Voting Protocols.
Proceedings of the Computer Security, 2010

Automatic Verification of Privacy Properties in the Applied pi Calculus.
Proceedings of the Trust Management II, 2008

Direct Anonymous Attestation (DAA): Ensuring Privacy with Corrupt Administrators.
Proceedings of the Security and Privacy in Ad-hoc and Sensor Networks, 2007