Secure e-Voting for Preferential Elections | Zendy

Riza Aditya | Zendy; Colin Boyd | Zendy; Ed Dawson | Zendy; Kapali Viswanathan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Secure e-Voting for Preferential Elections

Author(s) -

Riza Aditya,

Colin Boyd,

Ed Dawson,

Kapali Viswanathan

Publication year - 2003

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

DOI - 10.1007/10929179_44

Subject(s) - voting , transparency (behavior) , electronic voting , computer security , ranked voting system , computer science , internet privacy , political science , law , politics

Electronic voting (e-voting) systems can greatly enhance the efficiency, and potentially, the transparency of national elections. However, the security of such systems is an area of on-going research. The literature for secure e-voting is predominantly concerned with 1-out-of-m voting strategies, where m is the number of candidates running for the elections. This paper presents a case study of cryptologic protocols for secure e-voting systems that use preferential voting strategies.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research