臺灣博碩士論文加值系統

安全電子投票系統之設計

研究生：黃昭龍 指導教授：黃士殷

元智大學電機與資訊研究所

摘要

本論文提出一電子投票系統，希望藉由電腦與網路的結合，快速、安全且
正確的傳送與整合資料。傳統投票的重點，在於身份的確認與選票的安全
性正確性。但由於需耗費大量的物力人力，近年來雖透過電腦系統的協助
，已逐步簡化了以往繁瑣的投開票過程。但其中仍有許多方面，受限於環
境的因素，無法進一步得到改善，而因著這些因素，也使得投開票過程仍
陷於冗長。

電子投票系統最關鍵的問題在於如何設計其安全協定，這是一個隱含許多
設計困難的題目，它的安全考量不同於電子商務中SET(Secure
Electronic Transaction)所考量的方式。因此，本論文重點目的為結合
現行電腦安全的身份認證，保持傳輸資料安全與完整性的各種應用與標準
，定義出適用於複雜選舉下的電子選舉與投開票模式，並依此模型實作出
電子投票系統。

The Design of Secure Electronic Voting System

Student: Jau Lung Hwang Advisor: Dr. Shyh-In Hwang

Institute of the Electrical Engineering and Computer
Engineering & Science Yuan-Ze University

Abstract

As Internet has become more and more popular, electronic voting
based on Internet is also proving to be more practical to common
people. The key issue is how to reach the goal of both security
and privacy.

In this paper, we propose to design and implement a secure
voting protocol. In the protocol, the techniques of blind
signature and anonymous channel are used to protect the privacy
of the voter and to verify the validity of voting paper. Secure
sharing scheme is incorporated into the protocol to reduce the
trouble of two session voting. Also, the voting information is
published in the public bulletin board so that the voting result
can be verified. To sum up, the protocol proposed here can
satisfy a number of requirements of a practical secure
electronic voting system

Keywords：Electronic voting,Blind signature,Anonymous channel
,Secret sharing,Privacy,Verifiability

目錄

1緒論1
1.1研究動機與背景1
1.2研究目的2
1.3章節概要3
2相關研究3
2.1電子投票系統的安全需求3
2.2電子投票系統之相關架構5
2.3BLIND SIGNATURE8
2.4SECRET SHARING10
2.5ANONYMOUS CHANNEL13
3電子投票協定的設計15
3.1投票系統之參考模型15
3.2使用SECRET SHARING於加密金匙20
3.3PREVENTION OF TICKET BUYING21
3.4投票系統之改進模型23
3.5實作27
3.6成果28
4結論與未來展望29
5參考文獻30

[1] B. Schneier. Applied Cryptography : Protocols, Algorithms, and Source Code in C. Wiley, 2nd Edition, 1995.

[2] D. L. Chaum. "Untraceable electronic mail, return addresses ,and digital pseudonyms". Communication of the ACM , Vol.24, No.2, pp.84-88(Feb.,1981).

[3] D. Chaum, "Elections with Unconditionally-secret Ballots and Disruption Equivalent to breaking RSA", in Advances in Cryptology - EUROCRYPT '88, Leture Notes in Computer Science 330, Springer-Verlag, Berlin, pp.177-182(1988).

[4] Kenneth R. Iversen, "A Cryptographic Scheme for Computerized General Elections", in Advances in Cryptology - CRYPTO '91, Le0ture Notes in Computer Science 576, Springer-Verlag, Berlin, pp.405-419(1992)

[5] Josh D. Cohen and Michael J. Fischer. A robust and verifiable cryptographically secure election scheme (extended abstract). Technical Report YALEU/DCS/TR-454, Yale University, July 1985.

[6] Josh Benaloh and Dwight Tuinstra. Receipt-free secret-ballot elections, In Proccedings of the Twenty-sixth Annual ACM Symposium on the Theory of Computing, pages 544--553, May 23-25, 1994

[7] Richard Demillo and Michael Merritt. Protocols for data security. Computer, pages 39-51, February 1983.

[8] Hannu Nurmi, Arto Salomaa, and Lila Santean, Secret ballot elections in computer networks. Computer & Security, 36(10):553-560, 1991

[9] Salomaa, A. Verifying and recasting secret ballots in computer networks. In New Results and New Trends in Computer Science Springer-Verlag, Berlin. 1991, pp. 283-289

[10] D. Chaum. Blind signatures for untraceable payments. In Advances in Cryptology - Crypto '82, pages 199-203, Springer-Verlag, 1983.

[11] Fujioka , A ,Okamoto, T., and Ohta, K. A practical secret voting scheme for large scale elections. In Advances in Cryptology - AUSCRYPT '92, Springer-Verlag, Berlin. 1993, pp. 244-251.