Cryptographic Counters and Applications to Electronic Voting
Cryptographic Counters and Applications to Electronic Voting
复制标题
加密计数器及其在电子投票中的应用
DOI：
--
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
R. Ostrovsky
中科院分区：
文献类型：
--
作者：
Jonathan Katz;Steven Myers;R. Ostrovsky
我们形式化的加密计数器的概念，它允许一组参与者增加和减少一个加密表示（隐藏）数值私人和鲁棒。计数器的值只能由受信任的权威机构（或权威机构组，可能包括参与者本身）确定，参与者无法确定有关其他方执行的递增/递减操作的任何信息。
这种计数器的先前有效实现依赖于全同态加密方案;这是一个相对较强的要求，并非所有加密方案都能满足。我们提供了一种替代方法，从加法群Z2上的任何加密方案同态开始（即，1-位异或）。作为我们的主要结果，我们显示了一个一般的和有效的减少从任何这样的加密方案的一般密码计数器。我们的主要减少不使用额外的假设，是有效的，并给出了一个新的实现一般计数器。其结果也可以被看作是一个有效的构造一般的n位密码计数器从任何1位计数器，它具有额外的属性，计数器可以安全地添加。
作为我们的建设的适用性的一个例子，我们提出了一个密码计数器的基础上的二次剩余假设，并使用它来构建一个有效的投票方案，满足普遍的可验证性，隐私性和鲁棒性。
We formalize the notion of a cryptographic counter, which allows a group of participants to increment and decrement a cryptographic representation of a (hidden) numerical value privately and robustly. The value of the counter can only be determined by a trusted authority (or group of authorities, which may include participants themselves), and participants cannot determine any information about the increment/decrement operations performed by other parties.
Previous efficient implementations of such counters have relied on fully-homomorphic encryption schemes; this is a relatively strong requirement which not all encryption schemes satisfy. We provide an alternate approach, starting with any encryption scheme homomorphic over the additive group Z2 (i.e., 1-bit xor). As our main result, we show a general and efficient reduction from any such encryption scheme to a general cryptographic counter. Our main reduction does not use additional assumptions, is efficient, and gives a novel implementation of a general counter. The result can also be viewed as an efficient construction of a general n-bit cryptographic counter from any 1-bit counter which has the additional property that counters can be added securely.
As an example of the applicability of our construction, we present a cryptographic counter based on the quadratic residuosity assumption and use it to construct an efficient voting scheme which satisfies universal verifiability, privacy, and robustness.