Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Lebre, A. Zúquete, Rui Joaquim, Paulo Ferreira (2004)
INTERNET VOTING: IMPROVING RESISTANCE TO MALICIOUS SERVERS IN REVS
R. Rivest, A. Shamir, L. Adleman (1978)
A method for obtaining digital signatures and public-key cryptosystemsCommun. ACM, 21
D. Chaum (1983)
Blind Signature System
L. Cranor, R. Cytron (1997)
Sensus: a security-conscious electronic polling system for the InternetProceedings of the Thirtieth Hawaii International Conference on System Sciences, 3
A. Fujioka, T. Okamoto, K. Ohta (1992)
A Practical Secret Voting Scheme for Large Scale Elections
(2005)
A fault tolerant voting system for the internet. Master's thesis
(1999)
Multiple Administrators for Electronic Voting. Bs.C thesis
J. DeLaurentis (1984)
A Further Weakness in the Common Modulus Protocol for the RSA CryptoalgorithmCryptologia, 8
G. Simmons (1983)
A "Weak" Privacy Protocol using the RSA Crypto AlgorithmCryptologia, 7
(2005)
A fault tolerant voting system for the internet. Master’s thesis, IST / UTL
(1997)
Secure Electronic Voting Using the World
Rui Joaquim, A. Zúquete, Paulo Ferreira (2003)
REVS – A ROBUST ELECTRONIC VOTING SYSTEM
(1984)
Blind signature system”, Advances in Cryptology – CRYPTO ’83
Brandon Durette (1999)
Multiple Administrators for Electronic Voting
(1997)
Secure electronic voting using the Worldwide web
(1997)
Secure Electronic Voting Using the World Wide Web. Master's thesis, MIT
(2001)
Handbo ok of Applied Cryptography
(2004)
Internet voting: improving resistance to malicious servers”, paper presented at the IADIS International Conference Applied Computing
(2005)
A fault tolerant voting system for the internet
H. Krawczyk, M. Bellare, R. Canetti (1997)
HMAC: Keyed-Hashing for Message AuthenticationRFC, 2104
Purpose – This paper aims to provide a solution for allowing an arbitrary number of weights and weight values to be used in an electronic voting system. Design/methodology/approach – Robust Electronic Voting System (REVS) was chosen, a voting system designed to support internet voting processes, as the start point for studying the introduction of vote weights. Findings – The work resulted in an internet voting system supporting vote weights, based on REVS. Research limitations/implications – In the solution presented, there is still a problem regarding anonymity, for the case of a single voter with a particular weighted vote. This is a fundamental problem, since it also exists in paper‐based elections. Practical implications – This version of REVS has the same properties as the original REVS, apart from the anonymity issue above. Apart from this the process of registering voters got more complicated, since now it includes an extra action for binding a weight. Originality/value – To the best of the authors' knowledge, this modified version of REVS is the first electronic voting system supporting vote weights. Another novelty of this work is the modulus sharing optimization used for the RSA key pairs of each entity.
Internet Research – Emerald Publishing
Published: Oct 1, 2006
Keywords: Electronic equipment and components; Electrical measurement
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.