By Topic

Incoercible secure electronic voting scheme based on chaffing and winnowing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kiong, N.C. ; Sch. of Comput. Sci., Univ. Sci. Malaysia, Penang, Malaysia ; Samsudin, A.

This paper investigates the feasibility of Rivest's chaffing and winnowing (C&W) paradigm in providing incoercibility into electronic voting (e-voting) scheme. We begin with analysis the previous attempts to introduce incoercibility into e-voting scheme and then present the basic idea behind the C&W. We show that by using C&W, we could achieve incoercibility without sacrificing other security requirements or relying on some forms of physical assumption. Our scheme is secure against both passive and active coercers if the adversaries could not prescribe the random value of the number theory in used.

Published in:

Communications, 2003. APCC 2003. The 9th Asia-Pacific Conference on  (Volume:2 )

Date of Conference:

21-24 Sept. 2003