Return to search

Provably Secure Randomized Blind Signature Scheme and Its Application

Due to resource-saving and efficiency consideration, electronic voting (e-voting) gradually replaces traditional paper-based voting in some developed countries. An anonymous e-voting system that can be used in elections with large electorates must meet various security requirements, such as anonymity, uncoercibility, tally correctness, unrecastability, verifiability, and so on. Especially, the uncoercibility property is an essential property which can greatly reduce the possibility of coercion and bribe. Since each voter can obtain one and only one voting receipt in an electronic voting system, coercers or bribers can enforce legal voters to show their voting receipts to identify whether the enforced voters follow their will or not. It turns out that the coercion and bribe will succeed more easily in digital environments than that in traditional paper-based voting. In this dissertation, we analyze four possible scenarios leading to coercion and discover that the randomization property is necessary to blind-signature-based e-voting systems against coercion. Based on this result, we extend our research and come up with two provably secure randomized blind signature schemes from different cryptographic primitives, which can be adopted as key techniques for an electronic voting system against coercion and bribery.

Identiferoai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0719111-174117
Date19 July 2011
CreatorsSun, Wei-Zhe
ContributorsShiuh-Pyng Shieh, D. J. Guan, Tzong-Chen Wu, Chun-I Fan, Chin-Laung Lei, Chung-Huang Yang, Lein Harn
PublisherNSYSU
Source SetsNSYSU Electronic Thesis and Dissertation Archive
LanguageEnglish
Detected LanguageEnglish
Typetext
Formatapplication/pdf
Sourcehttp://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0719111-174117
Rightsoff_campus_withheld, Copyright information available at source archive

Page generated in 0.0025 seconds