DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Byoungcheon | - |
dc.contributor.author | Boyd, Colin | - |
dc.contributor.author | Dawson, Ed | - |
dc.contributor.author | Kim, Kwangjo | - |
dc.date.accessioned | 2011-05-04T02:50:58Z | - |
dc.date.available | 2011-05-04T02:50:58Z | - |
dc.date.issued | 2011-05-04 | - |
dc.identifier.uri | http://hdl.handle.net/10203/23504 | - |
dc.description.abstract | It had been thought that it is difficult to provide receipt-freeness in mixnet-based electronic voting schemes. Any kind of user chosen randomness can be used to construct a receipt, since a user can prove to a buyer how he had encrypted the ballot. In this paper we propose a simple and efficient method to incorporate receipt-freeness in mixnet-based electronic voting schemes by using the well known re-encryption technique and designated verifier re-encryption proof (DVRP). In our scheme a voter has to prepare his encrypted ballot through a randomization service provided by a tamper resistant randomizer (TRR), in such a way that he finally loses his knowledge on randomness. This method can be used in most mixnet-based electronic voting scheme to provide receipt-freeness. | en |
dc.description.sponsorship | We acknowledge the support of the Australian government through ARC Linkage- International fellowship scheme 2003, Grant No: LX0346868. | en |
dc.language.iso | en_US | en |
dc.subject | Voting | en |
dc.subject | Randomization | en |
dc.subject | Cryptography | en |
dc.subject | Encryption | en |
dc.subject | Electronic government | en |
dc.subject | Safety | en |
dc.title | Providing Receipt-freeness in Mixnet-based Voting Protocols | en |
dc.type | Book | en |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.