Last ned (Gratis)

Abstrakt

An Internet voting scheme allows voters to cast their votes or
ballots over Internet. Several information security issues to deploy
an Internet voting system are becoming a popular research topic in
recent years. An Internet voting system should satisfy information
security requirements which include confidentiality, integrity, anonymity,
reliability, verifiability, and unreusability of ballots like paper based
traditional election system. Satisfying all these requirements in a system
is really a very challenging issue. In this paper, an Internet voting scheme
is presented that aims to satisfy authentication of voter, confidentiality
and integrity of the ballot, validity of ballot, and counting of valid
ballots. Here, a novel and efficientNon-interactive Zero Knowledge Proof
(NZKP) protocol is presented to prove the validity of anonymous ballots
cast by authenticated voter. Hence, authentication of voter is equally
considered in this voting scheme.

Referanser

[1] Bo Meng: Analyzing and Improving Internet Voting Protocol, Proceedings of the
IEEE International Conference on e-Business Engineering, pp. 351-354, ISBN
0-7695-3003-6, IEEE Computer Society, (2007)
[2] T. Tjøstheim, T. Peacock, and P.Y. A. Ryan: A model for system-based analysis
of voting systems. Fifteenth International Workshop on Security Protocols,
(2007)
[3] European University Institute, Robert Schuman center for Advanced Studies,
Report for the Council of Europe: Internet Voting in the March 2007
Parliamentary Elections in Estonia. July 31, (2007)
The Norwegian Information Security Conference (NISK) 2009 157
[4] Norwegian Ministry of Local Government and regional Development: Report:
Electronic voting- challenges and opportunities. February, (2006)
[5] Kenneth R. Iversen: The Application of Cryptographic Zero-Knowledge
Techniques in Computerized Secret Ballot Election Schemes. Ph.D. dissertation,
IDT-report, 1991:3, Norweigan Institute of Technology, February, (1991)
[6] Md. Abdul Based: Security Aspects of Internet based Voting, Proceedings of the
International Conference on Telecommunications and Networking (TeNe 08),
CISSE 2008, December 5-13, Volume 1: Novel Algorithms and Techniques in
Telecommunications and Networking ; Sobh et. al. ISBN: 978-90-481-3661-2,
Springer, (2009)
[7] Berry Schoenmakers: A Simple Publicly Verifiable Secret Sharing Scheme and
its Application to Electronic Voting. In Advances in Cryptology-CRYPTO 99,
Vol. 1966 of Lecture Notes in Computer Science, Springer-Verlag, pp. 148-164,
(1999)
[8] G. Anjan Babau, and Dr. M. Padmavathamma: OPTIMALLY EFFICIENT
MULTI AUTHORITY SECRET BALLOT E-ELECTION SCHEME. Journal
of Theoretical and Applied Information Technology, JATIT (2006)
[9] Steven G. Krantz: Zero Knowledge Proofs, AIM Preprint Series, 2007-46, July
25, (2007)
[10] H. Shin: A brief survey of zero-knowledge proofs, CS-R9232, ISSN 0169-118X,
(1992)
[11] Jens Groth: Evaluating Security of Voting Schemes in the Universal
Composability Framework. ISBN 978-3-540-22217-0, Springer Berlin/Heidelberg,
(2004)
[12] Xavier Boyen, and Brent Waters: Compact Group Signatures Without Random
Oracles. EUROCRYPT 2006, LNCS 4004, pp. 427-444, (2006)
[13] Jan Camenisch, and Markus Michels: A Group Signature Scheme Based on
an RSA-Variant. BRICS Report Series RS-98-27. ISSN 0909-0878 November,
(1998)
[14] Song Han, Jie Wang, and Wanquan: An Efficient Identity-Based Group
Signature Scheme over Elliptic Curves. ISBN: 978-3-540-23551-4, Springer Berlin
/ Heidelberg, pp. 417-429, September 27, (2004)
[15] D. Chaum, and E. Van Heyst: Group signatures. Advances in Cryptography,
EUROCRYPT91, Springer-Verlag, Lecture Notes in Computer Science, vol. 547,
pp. 257-265, (1991)
[16] L. Chen, and T.P. Pedersen: New group signature schemes . EUROCRYPT95,
Springer-Verlag, Lecture Notes in Computer Science, vol. 950, pp. 171-181,
(1995)
158 The Norwegian Information Security Conference (NISK) 2009
[17] Oliver Baudron, Pierre-Alain Fouque, David Pointcheval, Guillaume Poupard,
and Jacques Stern: Practical multi-candidate election scheme . In PODC 01,
pp. 274-283, (2001)
[18] Ronald Cramer, Rosario Gennaro, and Berry Schoenmakers: A secure
and optimally eficient multi-authority election scheme . In proceedings of
EUROCRYPT 97, LNCS series, volume 1233, pp. 103-118, (1997)
[19] Ivan Damgard, Jens Groth, and Gorm Salomonsen: The theory and
implementation of an electronic voting system. In D. Gritzalis, editor, Secure
Electronic Voting, pp. 77-100. Kluwer Academic Publishers, (2003)
[20] Ivan Damgard, and Mads J. Jurik: A generalisation, a simplification and some
applications of pailliers probabilistic public-key system . In 4th International
Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2001,
LNCS series, volume 1992, (2001)
[21] Jens Groth, Rafail Ostrovsky, and Amit Sahai: Perfect non-interactive
zeroknowledge for NP . ECCC Report TR05-097, http://eccc.uni-trier.de/eccc-
reports/2005/TR05-097/index.html, (2005)
[22] Alfredo De Santis, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano,
and Amit Sahai: Robust non-interactive zero knowledge. In proceedings of
CRYPTO 01, LNCS series, volume 2139, pp. 566-598, (2002)
[23] Alfredo De Santis, Giovanni Di Crescenzo, and Giuseppe Persiano: Non-
interactive zero-knowledge . A low-randomness characterization of NP. In
proceedings of ICALP 99, LNCS series, volume 1644, pp. 271-280, (1999)
[24] Manuel Blum, Alfredo De Santis, Silvio Micali, and Giuseppe Persiano:
Noninteractive zero-knowledge . SIAM Jornal of Computation, 20(6):1084-1118,
(1991)
[25] Manuel Blum, Paul Feldman, and SilvioMicali: Non-interactive zero-knowledge
and its applications . In proceedings of STOC 88, pp. 103-112, (1988)
[26] Andre Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis and Salil Vadhan:
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model
. ISSN: 0302-9743, ISBN: 978-3-540-78523-1, Springer Berlin / Heidelberg,
February 26, (2008)
[27] Martin Hirt, and Kazue Sako: Efficient Receipt-Free Voting Based on
Homomorphic Encryption. EUROCRYPT 2000, LNCS 1807, pp. 539-556, 2000.
Springer-Verlag Berlin Heidelberg (2000)
[28] Dragos Florin Ciocan, and Salil Vadhan: Interactive and Noninteractive
Zero Knowledge Coincide in the Help ModelE. Cryptology ePrint Archive,
http://eprint.iacr.org/2007/389.pdf, (2007)
[29] Alfredo De Santis, and Giuseppe Persiano: Zero-Knowledge Proofs of
Knowledge Without Interaction. In Proceedings of the 33rd Symposium on
Foundations of Computer Science 1992, (FOCS ’92), Pittsburgh, PA, 24–27
October 1992, pages 427–437, (1992)
The Norwegian Information Security Conference (NISK) 2009 159
[30] U. Feige, D. Lapidot, and A. Shamir: 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)



Forrige artikkel      Neste artikkel