David Bernhard

Orcid: 0009-0005-6700-7607

According to our database1, David Bernhard authored at least 20 papers between 2011 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Multilingual Scraper of Privacy Policies and Terms of Service.
Proceedings of the 2025 Symposium on Computer Science and Law, 2025

2018
Verifiability Analysis of CHVote.
IACR Cryptol. ePrint Arch., 2018

2017
Adaptive Proofs Have Straightline Extractors (in the Random Oracle Model).
Proceedings of the Applied Cryptography and Network Security, 2017

Security Proofs for Participation Privacy, Receipt-Freeness and Ballot Privacy for the Helios Voting Scheme.
Proceedings of the 12th International Conference on Availability, Reliability and Security, Reggio Calabria, Italy, August 29, 2017

2016
Security Proofs for Participation Privacy and Stronger Veri ability for Helios.
IACR Cryptol. ePrint Arch., 2016

On the Hardness of Proving CCA-Security of Signed ElGamal.
Proceedings of the Public-Key Cryptography - PKC 2016, 2016

2015
On Limitations of the Fiat­ - Shamir Transformation.
IACR Cryptol. ePrint Arch., 2015

A comprehensive analysis of game-based ballot privacy definitions.
IACR Cryptol. ePrint Arch., 2015

SoK: A Comprehensive Analysis of Game-Based Ballot Privacy Definitions.
Proceedings of the 2015 IEEE Symposium on Security and Privacy, 2015

Adaptive Proofs of Knowledge in the Random Oracle Model.
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

2014
Zero-knowledge proofs in theory and practice.
PhD thesis, 2014

2013
Towards a Practical Cryptographic Voting Scheme Based on Malleable Proofs.
Proceedings of the E-Voting and Identify - 4th International Conference, 2013

Cryptographic Voting - A Gentle Introduction.
Proceedings of the Foundations of Security Analysis and Design VII, 2013

Ballot Secrecy and Ballot Independence Coincide.
Proceedings of the Computer Security - ESORICS 2013, 2013

Efficient Signatures of Knowledge and DAA in the Standard Model.
Proceedings of the Applied Cryptography and Network Security, 2013

2012
On Necessary and Sufficient Conditions for Private Ballot Submission.
IACR Cryptol. ePrint Arch., 2012

Measuring vote privacy, revisited.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011
Anonymous attestation with user-controlled linkability.
IACR Cryptol. ePrint Arch., 2011

Adapting Helios for Provable Ballot Privacy.
Proceedings of the Computer Security - ESORICS 2011, 2011


  Loading...