CT-ISG: The Privacy and Verifiability of Practical Voting Systems

CT-ISG：实用投票系统的隐私性和可验证性

• 批准号: 0831149
• 负责人: Poorvi Vora
• 金额: --
• 依托单位: George Washington University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2008
• 资助国家: 美国
• 起止时间: 2008-09-01 至 2011-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0831149&HistoricalAwards=false
• 关键词: CT; ISG; Privacy; Verifiability; Practical

Abstract:This research project studies the privacy and integrity properties of recently-proposed voting systems which aim to prove tally-correctness to voters and election observers. Privacy and verifiability are key characteristics of voting systems, and their importance cannot be overstated. The research focuses on two types of systems: (1) ones that use randomized partial audits of mixnet-like components and reveal information to computationally bounded adversaries, and (2) ones that do not use cryptography in the construction of ballots. The research approach builds on an information-theoretic model of voting to measure privacy loss and to study the fundamental limits of privacy and verifiability. The research has practical value for voting system designers and election officials. In addition, this project has a significant outreach component, including the development of course material for high school education in cryptography and voting systems.

摘要：本研究项目研究了最近提出的投票系统的隐私性和完整性属性，旨在向选民和选举观察员证明计数正确性。隐私和可验证性是投票系统的关键特征，它们的重要性怎么强调都不过分。该研究集中在两种类型的系统上：(1)使用类似mixnet组件的随机部分审计并向计算有限的对手透露信息的系统，以及(2)在选票构造中不使用加密技术的系统。该研究方法建立在投票信息理论模型的基础上，以衡量隐私损失，并研究隐私和可验证性的基本限制。本研究对投票系统设计者和选举官员具有实用价值。此外，该项目还有一个重要的外展组成部分，包括开发密码学和投票系统的高中教育课程材料。