Providing receipt-freeness in mixnet-based voting protocols

Cited 50 time in webofscience Cited 0 time in scopus
  • Hit : 371
  • Download : 0
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 randomiza-tion 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.
Publisher
SPRINGER-VERLAG BERLIN
Issue Date
2004
Language
English
Article Type
Article; Proceedings Paper
Keywords

SCHEME; WORK

Citation

INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2003 BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE, v.2971, pp.245 - 258

ISSN
0302-9743
URI
http://hdl.handle.net/10203/85291
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 50 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0