Pretty Good Democracy for a variety of voting schemes

Subscribers:
351,000
Published on ● Video Link: https://www.youtube.com/watch?v=6T8apeVDwO0



Duration: 1:03:16
163 views
2


Code voting seeks to address the issues of privacy and integrity for Remote Internet Voting. It sidesteps many of the inherent vulnerabilities of the Internet and client platforms but it does not provide end-to-end verification that votes are counted as cast. In this paper, we propose a simple technique to enhance the verifiability of code voting by ensuring that the Vote Server can only access the acknowledgement codes if the vote code is correctly registered by a threshold set of Trustees. The mechanism adds an extra level of verifiability in registering and counting the vote. Voter-verification is simple and direct: the voters need only check that the acknowledgement code returned to them agrees with the value on their code sheet. To ensure receipt-freeness we propose the use of a single acknowledgement code per code sheet, rather than individual acknowledgement codes for each candidate as with usual code voting. I will first present Pretty Good Democracy for voting schemes in which the voter selects a single candidate, then show how it can be extended to more expressive voting schemes such as Borda, approval voting and STV. (Joint work with Peter Ryan, University of Luxembourg, and James Heather, University of Surrey.)




Other Videos By Microsoft Research


2016-08-16Injective Tensor Norms: Hardness and Reductions
2016-08-16Monitoring Untrusted Modern Applications with Collective Record and Replay
2016-08-16Practical Boogie (on the example of VCC)
2016-08-16Coherent Depth in Stereo Vision
2016-08-16Multi-microphone Dereverberation and Intelligibility Estimation in Speech Processing
2016-08-16From Personalized Retinal Image Mapping to Large Scale Parallel Image Processing
2016-08-16Coding4Fun XAPfest!
2016-08-16Your Abstractions are Worth Powerless! Non-Volatile Storage and Computation on Embedded Devices
2016-08-16Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
2016-08-16Interpreting the Community: Information Practices and/for Deviance
2016-08-16Pretty Good Democracy for a variety of voting schemes
2016-08-16Learning Valuation Functions
2016-08-16Applying Semantic Analyses to Content-based Recommendation and Document Clustering
2016-08-16Fusing Mobile, Sensor, and Social Computing in the Cloud To Enable Context-Aware Applications
2016-08-16The Past, Present, and Future of Video Telephony
2016-08-16Multi-People Tracking through Global Optimization
2016-08-16Bridging Shannon and Hamming: Codes for Computationally Simple Channels
2016-08-16Using Program Verification Tools in Teaching
2016-08-16Crowdsourcing for Statistical Machine Translation
2016-08-16Computational Science Research in Latin America
2016-08-16The Laplacian Paradigm: Emerging Algorithms for Massive Graphs



Tags:
microsoft research