Proposed Voting Scheme Research Articles

Decentralized quantum anonymous veto voting scheme based on measurement-device-independence

To remove any trusted third party from the voting scheme, a new primitive quantum secure multiparty exclusive OR protocol based on Measurement-Device-Independence (MDI) is presented by utilizing entanglement swapping of Bell states. Based on this primitive protocol of quantum secure multiparty protocol, a novel quantum anonymous veto voting scheme is constructed, which can meet complete security attributes. Especially, this scheme does not need any third party to count the votes, while all voters can tally the voting results by themselves. At the same time, blockchain is introduced for supervision, so that the voters can verify the validity of the voting content under extreme circumstances. The voting scheme takes Bell states as quantum resources and only performs Bell states identification based on the principle of MDI, so it is feasible to implement this scheme with the present quantum information processing technologies. Finally, the proposed voting scheme is simulated in IBM Qiskit, and the simulation results show that this scheme is correct and feasible.

For a few diversities more: A voting‐attack‐immune voting scheme for social question and answer websites

SummarySocial question and answer (Q&A) communities or websites, such as Quora, StackOverflow, become popular from the last decade. They provide collected answers in a crowdsourcing way by encouraging the interactive between users. The ranking of answers in such Q&A websites depends on many factors, such as received upvotes, downvotes, publishing time, and so on. When there exist malicious users, they can manipulate the ranking of answers by launching voting spamming attacks. In this article, we propose a metric, diversity of visibility, to characterize the balance between rankings of answers with conflicting opinions and propose a time‐diversitybased voting scheme to reach a high diversity of visibility, so as to minimize the impact of voting spamming attacks. We evaluate the proposed metric and voting scheme in the case study of a Chinese Q&A website, Zhihu, and show that the proposed voting scheme consistently shows a good balance of answers with conflicting opinions in both actual scenarios and synthetic scenarios.

An Accurate and Efficient Voting Scheme for a Maximally All-Inlier 3D Correspondence Set

We present a highly accurate and efficient, yet simple, two-stage voting scheme for distinguishing inlier 3D correspondences by densely assessing and ranking their local and global geometric consistencies. The strength of the proposed method stems from both the novel idea of post-validated voting set, as well as single-point superimposition transforms, which are computationally cheap and avoid rotational ambiguities. Using a well-known dataset consisting of various 3D models and numerous scenes that include different occlusion rates, the proposed scheme is evaluated against state-of-the-art 3D voting schemes, in terms of both the correspondence PR (precision-recall) AUC (area under curve), and the execution time. A total of 374 experiments were conducted for each method, which involved a combination of four models, 50 scenes, and two down-samplings. The proposed scheme outperforms the state-of-the-art 3D voting schemes in terms of both accuracy and speed. Quantitatively, the proposed scheme scores 97.0% ±12.9% on the PR AUC metric, averaged over all of the experiments, while the two state-of-the-art schemes score 74.2% ±22.2% and 78.3% ±26.4%. Furthermore, the proposed scheme requires only 24.1% ±6.0% of the time consumed by the fastest state-of-the-art scheme. The proposed voting scheme also demonstrates high robustness against occlusions and scarce inliers.

An instance voting approach to feature selection

In this work, we address the problem of supervised feature selection (FS) for high-dimensional datasets with a small number of instances. Here, we propose a novel heuristic FS approach, Conditional Priority Coverage Maximization (CPCM) which seeks to leverage the local information provided by the small set of instances. We define the vote assigned by an instance to a feature as the local relevance of the latter. Also, we show that the proposed voting scheme is asymptotically related to the Bayes’ decision rule for minimum risk classification. Next, we exploit the instance votes for feature selection by posing it as a set-covering problem — we seek to select a subset of features such that they can together cover the instances. This approach avoids the selection of redundant features, while selecting relevant ones. In addition, we formulate the stopping criterion to select a compact subset of features. Through experiments on synthetic and real datasets, we demonstrated that CPCM outperforms other graph based FS techniques and state-of-the-art FS approaches employing mutual information (MI). Further, we evaluated the stability of CPCM to minor variations in the training data and found it to be reasonably robust.

A proposed voting scheme to reduce the sensitivity of the Markov method

The Markov method is one of many successful ranking methods that uses Markov chains to obtain its ratings and rankings of alternatives. It has been shown, however, that the method is sensitive to upsets, particularly in the tail of its ranking. The method also exhibits faulty behaviour when it has a periodic Markov chain. This study proposes a modification to the voting scheme of the Markov method that will alleviate the sensitivity to upsets and remove the issue of periodicity in the Markov chain. To examine the sensitivity, we first provide an example and see how both voting schemes react to an upset. Next, we generalise both voting schemes and examine a ratio of rating increments to understand why the tailing effect occurs, and how we can subside its effect.

A proposed voting scheme to reduce the sensitivity of the Markov method

A proposed voting scheme to reduce the sensitivity of the Markov method

An Efficient Electronic Voting System in a Cloud Computing Environment

In this paper we present an electronic voting system based on Homomorphic encryption to ensure privacy, confidentiality and integrity in the voting. Our proposal offers all the advantages of the additively homomorphic encryption cryptosystems. The proposed voting scheme is suitable for multi-candidate elections as well as for elections in which contains neutral votes.

A Novel Approach to Scene Classification using K-Means Clustering

challenging problem of computer vision is scene classification. An efficient method for classifying natural scenes from the Oliva - Torralba dataset is proposed. The method is based on K-Means clustering algorithm followed by a novel two phase voting method for classification which is the main contribution of this paper. Two distinct feature sets have been used. The first feature set is used for grouping perceptually similar images into two clusters based on K- Means algorithm. The second feature set is selected based on observed visual attributes of images in these two clusters. Classification is achieved by a novel voting method which firstly assigns test image to the most similar cluster. Each cluster contains images from four categories. Therefore to assign test image to correct category within an assigned cluster, candidate voters from the assigned cluster are selected. The category of majority candidate voters decides the class of test image. The efficiency of the proposed voting scheme is that 83.4% test images are correctly classified. Silhouette index, purity, variance, F-measure and Rand's metric are used for cluster validation.

A hybrid approach to vector-based homomorphic tallying remote voting

Vector-based homomorphic tallying remote voting schemes provide an efficient protocol for vote tallying, but they require voters to prove in zero-knowledge that the ballots they cast have been properly generated. This is usually achieved by means of the so-called zero-knowledge range proofs, which should be verified by the polling station before tallying. In this paper, we present an end-to-end verifiable hybrid proposal in which ballots are proven to be correct by making use of a zero-knowledge proof of mixing but still using a homomorphic tallying for gathering the election results. Our proposal offers all the advantages of the homomorphic tallying paradigm, while it avoids the elevated computational cost of range proofs. As a result, ballot verification performance is improved in comparison with the equivalent homomorphic systems. The proposed voting scheme is suitable for multi-candidate elections as well as for elections in which the votes have different weights.

개선된 보팅 정책을 적용한 허프 변환 하드웨어 구조

The Hough transform for line detection is widely used in many machine vision applications due to its robustness against data loss and distortion. However, it is not appropriate for real-time embedded vision systems, because it has inefficient computation structure and demands a large number of memory accesses. Thus, this paper proposes an improved voting scheme of the Hough transform, and then applies this scheme to a Hough transform hardware architecture so that it can provide real-time performance with less hardware resource. The proposed voting scheme reduces computation overhead of the voting procedure using correlation between adjacent pixels, and improves computational efficiency by increasing reusability of vote values. The proposed hardware architecture, which adopts this improved scheme, maximizes its throughput by computing and storing vote values for many adjacent pixels in parallel. This parallelization for throughput improvement is accomplished with little hardware overhead compared with sequential computation.

Multi-authority Electronic Voting Scheme Based on Elliptic Curves

In this paper, a new multi authority electronic voting scheme based on elliptic curves is proposed. According to the proposed scheme, each voter casts the vote as a point on the elliptic curve and the final tally is computed with the assistance of multiple authorities. A trusted center is involved in the scheme to distribute the shared secret key among the authorities and the Shamir (t, n) threshold scheme is used for key distribution. The proposed scheme also meets the essential requirements of e-voting system. Ultimately, the proposed voting scheme fortifies the security properties of the electronic voting procedure, since the secrecy of the particularized vote is preserved by ElGamal cryptosystem and Elliptic curve discrete logarithm problem.

Single authority electronic voting based on elliptic curves

In this paper, a new single authority electronic voting scheme is proposed, based on elliptic curves. According to the proposed scheme, each voter casts the vote as a point on the elliptic curve and the final tally is computed with the assistance of a single trusted authority. The proposed scheme also meets the essential requirements of e-voting system. Ultimately, the proposed voting scheme fortifies the security properties of the electronic voting procedure, since the secrecy of the particularized vote is preserved by Elgamal cryptosystem and Elliptic curve discrete logarithm problem.

Application of wrapper approach and composite classifier to the stock trend prediction

The research on the stock market prediction has been more popular in recent years. Numerous researchers tried to predict the immediate future stock prices or indices based on technical indices with various mathematical models and machine learning techniques such as artificial neural networks (ANN), support vector machines (SVM) and ARIMA models. Although some researches in the literature exhibit satisfactory prediction achievement when the average percentage error and root mean square error are used as the performance metrics, the prediction accuracy of whether stock market goes or down is seldom analyzed. This paper employs wrapper approach to select the optimal feature subset from original feature set composed of 23 technical indices and then uses voting scheme that combines different classification algorithms to predict the trend in Korea and Taiwan stock markets. Experimental result shows that wrapper approach can achieve better performance than the commonly used feature filters, such as χ 2-Statistic, Information gain, ReliefF, Symmetrical uncertainty and CFS. Moreover, the proposed voting scheme outperforms single classifier such as SVM, kth nearest neighbor, back-propagation neural network, decision tree, and logistic regression.

Monocular Right-Angle Building Hypothesis Generation in Regularized Urban Areas by Pose Clustering

By decomposing the building extraction problem into three sequential steps (selection, indexing and correspondence), the complexity of monocular extraction from aerial imagery can be reduced. This paper focuses on the first step, selection, during which an image subset likely to contain a single building is extracted. Pose clustering can be one way to achieve this. Based on vote accumulation, pose clustering offers the advantages of reduced complexity and a false alarm rate prediction capability. This paper describes a voting scheme for right-angle flat-roof buildings, from which image space building location hypotheses may be efficiently generated for regularized urban areas. The proposed scheme incorporates weights, constraints and uncertainties that should be implemented due to the nature of aerial imagery. Additionally, based on an occupancy model, a random vote accumulation and threshold analysis of the proposed voting scheme is presented. The main limitation of the proposed scheme is the need for a scaled building model prior to the hypothesis generation phase. Results from simulated and real imagery show that the building detection percentages as well as the quality percentage are well within range, even without a verification process.

A secure and available electronic voting service for a large-scale distributed system

We present a secure and available electronic voting service suitable for a large-scale distributed system such as the Internet. The proposed service is based on replication and tolerates both benign and fully arbitrary failures. If enough servers are correct, service availability and security are ensured despite the presence of faulty servers and malicious voters. A voter that is affected by a crash failure can vote after recovery. The proposed service satisfies common voting requirements including voter eligibility and privacy, and tally accuracy. In addition, the service satisfies a further important requirement, namely tally verifiability without any intervention of voters. Anyone, including an external observer, can easily be convinced that the voting outcome is fairly computed from the ballots that were correctly cast. It follows that the proposed voting scheme strengthens the security properties of the electronic voting procedure, and simplifies the interaction of voters with the electronic voting system.

Electronic voting in a large‐scale distributed system

AbstractIn this paper, we propose a practical and secure electronic voting scheme suitable for large‐scale distributed systems such as the Internet. As in most of the voting systems in the literature, the proposed voting scheme allows only eligible voters to vote once, protects the voters' privacy, and ensures the accuracy of the tally. In addition, the proposed scheme satisfies further important criteria, namely, it tolerates abstention and does not require voters to control whether their votes have been correctly processed. If a subset of voters does not vote, the elections cannot be disrupted. Furthermore, anyone, including an external observer, can easily be convinced that the election is fair, that is, that the published final tally is fairly computed from the ballots that were correctly cast. It follows that the proposed voting scheme strengthens the security properties of the electronic voting procedure, simplifies the interaction of voters with the electronic voting system, and contributes to increased voter confidence in the degree of security of the electronic voting procedure. © 2001 John Wiley & Sons, Inc.

The APSA and Minority Representation

The concept of representation has been much discussed and debated in the literature of political science. My intent here is not to review or evaluate the different meanings or implications that have been given to this concept but instead to focus on specific voting schemes which would allow the expression of minority (as well as majority) viewpoints in an elected voting body in rough proportion to their numbers of supporters in a larger electorate. As a procedural question, we shall look at representation in terms of the operation of voting rules which allow the preferences of a group to be translated into the election of representatives who would becapableof expressing the group's preferences in an elected body. Whether these representatives, upon election,shouldfaithfully attempt to reflect the views of their supporters (the “delegate model”), or instead exercise their own independent judgments on matters before the body (the “free agent model”), is a normative question which will not be considered in this analysis.I shall begin the analysis by postulating two abstract requirements that a voting scheme of proportional representation should meet. I shall then suggest a particular voting scheme which meets these requirements, analyze the logical interrelatedness of the requirements, and finally show the application of the proposed voting scheme to the election of officers and Council members of the American Political Science Association (APSA), using the results of the 1969 APSA election for purposes of illustration. The effects which the size of an elected body has on the strategies available to groups seeking representation on it will be analyzed and illustrated in the Appendix.

The APSA and Minority Representation

The concept of representation has been much discussed and debated in the literature of political science. My intent here is not to review or evaluate the different meanings or implications that have been given to this concept but instead to focus on specific voting schemes which would allow the expression of minority (as well as majority) viewpoints in an elected voting body in rough proportion to their numbers of supporters in a larger electorate. As a procedural question, we shall look at representation in terms of the operation of voting rules which allow the preferences of a group to be translated into the election of representatives who would be capable of expressing the group's preferences in an elected body. Whether these representatives, upon election, should faithfully attempt to reflect the views of their supporters (the “delegate model”), or instead exercise their own independent judgments on matters before the body (the “free agent model”), is a normative question which will not be considered in this analysis.I shall begin the analysis by postulating two abstract requirements that a voting scheme of proportional representation should meet. I shall then suggest a particular voting scheme which meets these requirements, analyze the logical interrelatedness of the requirements, and finally show the application of the proposed voting scheme to the election of officers and Council members of the American Political Science Association (APSA), using the results of the 1969 APSA election for purposes of illustration. The effects which the size of an elected body has on the strategies available to groups seeking representation on it will be analyzed and illustrated in the Appendix.

The APSA and Minority Representation

The concept of representation has been much discussed and debated in the literature of political science. My intent here is not to review or evaluate the different meanings or implications that have been given to this concept but instead to focus on specific voting schemes which would allow the expression of minority (as well as majority) viewpoints in an elected voting body in rough proportion to their numbers of supporters in a larger electorate. As a procedural question, we shall look at representation in terms of the operation of voting rules which allow the preferences of a group to be translated into the election of representatives who would be capable of expressing the group's preferences in an elected body. Whether these representatives, upon election, should faithfully attempt to reflect the views of their supporters (the “delegate model”), or instead exercise their own independent judgments on matters before the body (the “free agent model”), is a normative question which will not be considered in this analysis.I shall begin the analysis by postulating two abstract requirements that a voting scheme of proportional representation should meet. I shall then suggest a particular voting scheme which meets these requirements, analyze the logical interrelatedness of the requirements, and finally show the application of the proposed voting scheme to the election of officers and Council members of the American Political Science Association (APSA), using the results of the 1969 APSA election for purposes of illustration. The effects which the size of an elected body has on the strategies available to groups seeking representation on it will be analyzed and illustrated in the Appendix.