Modeling a Bulletin Board Service Based on Broadcast Channels with Memory

  • Severin Hauser
  • Rolf HaenniEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10958)


The publication of the election data is fundamental for making electronic voting systems universally verifiable. For this, voting protocols usually rely on a secure bulletin board, which keeps track of the data produced during the protocol execution. This paper presents a general model for implementing such a bulletin board service. The design of the model is based on the concept of an ideal broadcast channel with memory, which transmits messages without loss of information to a present or future receiver. The challenge of implementing a bulletin board service is to approximate the properties of such an ideal channel to the best possible degree. Our model contributes to a better understanding of these properties and may help in designing future bulletin board implementations.



This research has been supported by the Hasler Foundation (project no. 14028). We thank the anonymous reviewers for their reviews and appreciate their valuable comments and suggestions.


  1. 1.
    Adida, B.: Helios: web-based open-audit voting. In: Van Oorschot, P. (ed.) SS 2008, 17th USENIX Security Symposium, pp. 335–348. San Jose, USA (2008)Google Scholar
  2. 2.
    Baum, C., Damgård, I., Orlandi, C.: Publicly auditable secure multi-party computation. In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 175–196. Springer, Cham (2014). Scholar
  3. 3.
    Beuchat, J.: Append-Only Web Bulletin Board. Master’s thesis, Bern University of Applied Sciences, Biel, Switzerland (2012)Google Scholar
  4. 4.
    Burton, C., et al.: A supervised verifiable voting protocol for the Victorian electoral commission. In: Kripp, M., Volkamer, M., Grimm, R. (eds.) EVOTE 2012, 5th International Workshop on Electronic Voting, no. P-205 in Lecture Notes in Informatics, Bregenz, Austria, pp. 81–94 (2012)Google Scholar
  5. 5.
    Clarkson, M.R., Chong, S., Myers, A.C.: Civitas: toward a secure voting system. In: SP 2008, 29th IEEE Symposium on Security and Privacy, pp. 354–368. Oakland, USA (2008)Google Scholar
  6. 6.
    Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 103–118. Springer, Heidelberg (1997). Scholar
  7. 7.
    Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. Eur. Trans. Telecommun. 8(5), 481–490 (1997)CrossRefGoogle Scholar
  8. 8.
    Culnane, C., Ryan, P.Y.A., Schneider, S., Teague, V.: vVote: a verifiable voting system. ACM Trans. Inf. Syst. Secur. 18(1), 3:1–3:30 (2015)CrossRefGoogle Scholar
  9. 9.
    Culnane, C., Schneider, S.: A peered bulletin board for robust use in verifiable voting systems. In: CSF 2014, 27th Computer Security Foundations Symposium, pp. 169–183. Vienna, Austria (2014)Google Scholar
  10. 10.
    Dold, F., Grothoff, C.: Byzantine set-union consensus using efficient set reconciliation. In: Wicker, S.B., Engel, D. (eds.) ARES 2016, 11th International Conference on Availability, Reliability and Security, pp. 29–38. Salzburg, Austria (2016)Google Scholar
  11. 11.
    Dubuis, E., et al.: Verifizierbare Internet-Wahlen an Schweizer Hochschulen mit UniVote. In: Horbach, M. (ed.) INFORMATIK 2013, 43. Jahrestagung der Gesellschaft für Informatik. LNI P-220, Koblenz, Germany, pp. 767–788 (2013)Google Scholar
  12. 12.
    Goldreich, O.: The Foundations of Cryptography - Volume II: Basic Applications. Cambridge University Press, New York (2004)Google Scholar
  13. 13.
    Haenni, R., Koenig, R.E.: A generic approach to prevent board flooding attacks in coercion-resistant electronic voting schemes. Comput. Secur. 33, 59–69 (2013)CrossRefGoogle Scholar
  14. 14.
    Hauser, S., Haenni, R.: Implementing broadcast channels with memory for electronic voting systems. JeDEM eJournal eDemocracy Open Gov. 8(3), 61–79 (2016)CrossRefGoogle Scholar
  15. 15.
    Heather, J., Lundin, D.: The append-only web bulletin board. In: Degano, P., Guttman, J., Martinelli, F. (eds.) FAST 2008. LNCS, vol. 5491, pp. 242–256. Springer, Heidelberg (2009). Scholar
  16. 16.
    Krummenacher, R.: Implementation of a Web Bulletin Board for E-Voting Applications. Project report, Hochschule für Technik Rapperswil (HSR), Switzerland (2010)Google Scholar
  17. 17.
    Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Programm. Lang. Syst. 4, 382–401 (1982)CrossRefGoogle Scholar
  18. 18.
    Lundin, D., Heather, J.: The robust append-only web bulletin board. Technical report, University of Surrey, Guildford, U.K. (2008)Google Scholar
  19. 19.
    Nakamoto, S.: Bitcoin: A Peer-to-Peer Electronic Cash System. Anonymous Publication (2009)Google Scholar
  20. 20.
    Peters, R.A.: A Secure Bulletin Board. Master’s thesis, Department of Mathematics and Computing Science, Technische Universiteit Eindhoven, The Netherlands (2005)Google Scholar
  21. 21.
    Reiter, M.K.: Secure agreement protocols: reliable and atomic group multicast in Rampart. In: CCS 1994, 2nd ACM Conference on Computer and Communications Security, pp. 68–80. Fairfax, USA (1994)Google Scholar

Copyright information

© International Financial Cryptography Association 2019

Authors and Affiliations

  1. 1.Bern University of Applied SciencesBielSwitzerland
  2. 2.University of FribourgFribourgSwitzerland

Personalised recommendations