David Bernhard
Teaching Fellow
Bristol

Dr David Bernhard is a Teaching Fellow and former Research Associate in the Department of Computer Science at the University of Bristol in England. He holds a PhD in Computer Science from Bristol with the title 'Zero-Knowledge Proofs in Theory and Practice' and a MSc with distinction in Mathematics from ETH Zurich. Dr Bernhard has taught units across Computer Science from 1st year undergraduates to postgraduate masters students, including databases, mathematics, computer architecture, concurrent programming, software development/engineering and security. In his previous job, Dr Bernhard worked on the foundations of Cryptography with a particular interest in Zero-Knowledge and turning theoretical insight into practically useful applications and guidelines. In his work on the Helios voting system, he discovered an attack and a fix which led to a fuller understanding of the most widely used, decades-old technique for producing non-interactive Zero-Knowledge proofs. Dr Bernhard's publications include one paper at Asiacrypt, two at ESORICS and one each at ACNS and ACM-CCS.
ETH Zurich
Mathematics - MSc with distinction
2004-09-01 - 2009-09-01
University of Bristol
Computer Science - PhD
2010-09-01 - 2014-01-01
Anonymous Attestation with User-Controlled Linkability
International Journal of Information Security, pages 1–31, 2011. Eprint 2011/658
with G. Fuchsbauer, E. Ghadafi, N. P. Smart and B. Warinschi.

Adapting Helios for Provable Ballot Privacy
ESORICS, LNCS 6879, pages 335–354, 2011.
with V. Cortier, B. Smyth, O. Pereira and B. Warinschi.

Measuring Vote Privacy, Revisited.
ACM CCS, pages 941–952, 2012.
with V. Cortier, O. Pereira and B. Warinschi.

Efficient Signatures of Knowledge and DAA in the Standard Model.
ACNS, LNCS 7954, pages 518–533, 2013. Eprint 2012/475
with E. Ghadafi and G. Fuchsbauer.

How Not to Prove Yourself: Pitfalls of Fiat-Shamir and Applications to Helios.
Advances in Cryptology — Asiacrypt '12, LNCS 7658, pages 626–643, 2012.
with O. Pereira and B. Warinschi.

Towards a Practical Internet Voting Scheme based on Malleable Proofs.
Vote-ID, LNCS 7985, pages 176–192, 2013. Eprint 2013/276
with S. Neumann and M. Volkamer.

Ballot secrecy and ballot independence coincide.
ESORICS, LNCS 8134, pages 463–480, 2013. Eprint 2013/235
with B. Smyth.

Zero-Knowledge Proofs in Theory and Practice.
University of Bristol
PhD thesis

English
Native speaker
German
fluent
French
intermediate