Skip to main content

Universally Composable NIZK Protocol in an Internet Voting Scheme

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 6710))

Abstract

We use the Universally Composable (UC) framework to evaluate our Non-Interactive Zero-Knowledge (NIZK) protocol for verifying the validity of the ballot in an Internet voting scheme. We first describe the Internet voting scheme followed by the explanation of the NIZK protocol for ballot verification in that voting scheme. We then define the ideal functionalities using the UC framework and evaluate the NIZK protocol by using these ideal functionalities. We find that this NIZK protocol is secure in the UC framework in the presence of malicious and adaptive adversaries.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. Electronic Colloquium on Computational Complexity, Revision 3 of Report N0. 16 (2001), ISSN: 1443-8092 (2005), http://eprint.iacr.org/2000/067

  2. Groth, J.: Evaluating Security of Voting Schemes in the Universal Composability Framework. Springer, Heidelberg (2004) ISBN: 978-3-540-22217-0

    Book  MATH  Google Scholar 

  3. Iversen, K.R.: The Application of Cryptographic Zero-Knowledge Techniques in Computerized Secret Ballot Election Schemes. Ph.D. dissertation, IDT-report, 1991:3, Norwegian Institute of Technology (February 1991)

    Google Scholar 

  4. Schoenmakers, B.: A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 148–164. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  5. Damgard, I., Groth, J., Salomonsen, G.: The Theory and Implementation of an Electronic Voting System. In: Gritzalis, D. (ed.) Secure Electronic Voting, pp. 77–100. Kluwer Academic Publishers, Dordrecht (2003)

    Chapter  Google Scholar 

  6. Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally Composable Two-Party and Multi-Party Secure Computation. In: 34th STOC, pp. 494–503 (2002)

    Google Scholar 

  7. Wikström, D.: A universally composable mix-net. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 317–335. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19–40. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  9. Based, M.A., Mjølsnes, S.F.: A Non-interactive Zero Knowledge Proof Protocol in an Internet Voting Scheme. In: Proceedings of the the 2nd Norwegian Security Conference (NISK 2009), Tapir Akademisk Forlag, pp. 148–160 (2009) ISBN: 978-82-519-2492-4

    Google Scholar 

  10. Based, M.A.: Security Aspects of Internet based Voting. In: Sobh, et al. (eds.) Proceedings of the International Conference on Telecommunications and Networking (TeNe 2008), Novel Algorithms and Techniques in Telecommunications and Networking, pp. 329–332. Springer, Heidelberg (2010) ISBN: 978-90-481-3661-2

    Chapter  Google Scholar 

  11. Santis, A.D., Persiano, G.: Zero-Knowledge Proofs of Knowledge Without Interaction. In: Proceedings of the 33rd Symposium on Foundations of Computer Science 1992 (FOCS 1992), Pittsburgh, PA, pp. 427–437 (October 24-27, 1992)

    Google Scholar 

  12. Feige, U., Lapidot, D., Shamir, A.: Multiple Non-Interactive Zero-Knowledge Proofs Based on a Single Random String. In: Proceedings of the 22th Annual Symposium on the Theory of Computing, pp. 308–317 (1990)

    Google Scholar 

  13. Blum, M., Feldman, P., Micali, S.: Non-Interactive Zero-Knowledge and its Applications. In: Proceedings of STOC 1988, pp. 103–112 (1988)

    Google Scholar 

  14. Meng, B.: Analyzing and Improving Internet Voting Protocol. In: Proceedings of the IEEE International Conference on e-Business Engineering, pp. 351–354. IEEE Computer Society, Los Alamitos (2007) ISBN 0-7695-3003-6

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Based, M.A., Mjølsnes, S.F. (2011). Universally Composable NIZK Protocol in an Internet Voting Scheme. In: Cuellar, J., Lopez, J., Barthe, G., Pretschner, A. (eds) Security and Trust Management. STM 2010. Lecture Notes in Computer Science, vol 6710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22444-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22444-7_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22443-0

  • Online ISBN: 978-3-642-22444-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics