Related papers: Information-Theoretic Secure and Private Voting Sy…
Voting theory has become increasingly integrated with computational social choice and multiagent systems. Computational complexity has been extensively used as a shield against manipulation of voting systems, however for several voting…
High voter turnout in elections and referendums is very desirable in order to ensure a robust democracy. Secure electronic voting is a vision for the future of elections and referendums. Such a system can counteract factors that hinder…
This work shows how a secure Internet can be implemented through a fast key distribution system that uses physical noise to protect the transmitted information. Starting from a shared random sequence $K_0$ between two (or more) users,…
We study quantum differential privacy (QDP) by defining a notion of the order of informativeness between pairs of quantum states. In particular, we show that if the hypothesis testing divergence of one pair dominates over that of the other…
Some of the secret sharing schemes having unique quantum features like parallelism and entanglement are supposed to be relatively secure. Different schemes proposed by various researchers over the years have features which could be specific…
Elections and opinion polls often have many candidates, with the aim to either rank the candidates or identify a small set of winners according to voters' preferences. In practice, voters do not provide a full ranking; instead, each voter…
We propose a quantum secret sharing scheme between $m$-party and $n$-party using three conjugate bases, i.e. six states. A sequence of single photons, each of which is prepared in one of the six states, is used directly to encode classical…
Since 2004, different research was handling the challenges in the centralized voting systems, e-voting protocols and recently the decentralized voting. So electronic voting puts forward some difficulties regarding the voter anonymity, the…
Preservation of privacy has been a serious concern with the increasing use of IoT-assisted smart systems and their ubiquitous smart sensors. To solve the issue, the smart systems are being trained to depend more on aggregated data instead…
We propose public-key cryptosystems with public key a system of polynomial equations, algebraic or differential, and private key a single polynomial or a small-size ideal. We set up probabilistic encryption, signature, and signcryption…
We present a private information retrieval (PIR) scheme that allows a user to retrieve a single message from an arbitrary number of databases by colluding with other users while hiding the desired message index. This scheme is of particular…
We survey the design of elections that are resilient to attempted interference by third parties. For example, suppose votes have been cast in an election between two candidates, and then each vote is randomly changed with a small…
Differential privacy offers formal quantitative guarantees for algorithms over datasets, but it assumes attackers that know and can influence all but one record in the database. This assumption often vastly overapproximates the attackers'…
Electronic voting is a very useful but challenging internet-based protocol that despite many theoretical approaches and various implementations with different degrees of success, remains a contentious topic due to issues in reliability and…
This article presents a novel intruder model for automated reasoning about anonymity (vote-privacy) and secrecy properties of voting systems. We adapt the lazy spy for this purpose, as it avoids the eagerness of pre-computation of…
We consider distributed elections, where there is a center and $k$ sites. In such distributed elections, each voter has preferences over some set of candidates, and each voter is assigned to exactly one site such that each site is aware…
Faith in the US electoral system is at risk. This issue stems from trust or lack thereof. Poor leaders ranted and attempted to sew discord in the democratic process and even tried to influence election results. Historically, the US has…
This paper presents a recursive computational multi-secret sharing technique that hides k-2 secrets of size b each into n shares of a single secret S of size b, such that any k of the n shares suffice to recreate the secret S as well as all…
Internet voting will probably be one of the most significant achievements of the future information society. It will have an enormous impact on the election process making it fast, reliable and inexpensive. Nonetheless, so far remote voting…
We present a distributed average consensus protocol that preserves the privacy of agents' inputs. Unlike the differential privacy mechanisms, the presented protocol does not affect the accuracy of the output. It is shown that the protocol…