acm-header
Sign In

Communications of the ACM

ACM TechNews

­sing Game Theory to Predict Cyberattacks on Elections and Voting Machines


View as: Print Mobile App Share:
Vorobeychik says efforts to tamper with votes probably will target voting machines.

Vanderbilt University professor Yevgeniy Vorobeychik says an algorithm based on game theory can be used to protect against efforts to tamper with election results.

Credit: mywot.com

An algorithm based on game theory can be used to protect against efforts to tamper with election results, according to Vanderbilt University professor Yevgeniy Vorobeychik.

He says people committing election fraud will want to evade detection, so their interference will likely target voting machines in such a way that the outcomes are close to a tie, eliminating their district's influence on the total vote count.

The algorithm Vorobeychik developed generates a random list of districts likely to be targeted, and enables auditors to check for discrepancies in vote totals.

Although doing that process by hand would be labor-intensive and could permit fraudsters to determine the selection system, the algorithm makes the process completely unpredictable.

Vorobeychik plans to release a version of the software to public agencies for use in polling places during elections or for use in audits after voting ends.

From Research News @ Vanderbilt
View Full Article

 

Abstracts Copyright © 2017 Information Inc., Bethesda, Maryland, USA


 

No entries found

Sign In for Full Access
» Forgot Password? » Create an ACM Web Account