• Title/Summary/Keyword: Electronic Election

Search Result 30, Processing Time 0.022 seconds

Estimation of Smart Election System data

  • Park, Hyun-Sook;Hong, You-Sik
    • International journal of advanced smart convergence
    • /
    • v.7 no.2
    • /
    • pp.67-72
    • /
    • 2018
  • On the internal based search, the big data inference, which is failed in the president's election in the United States of America in 2016, is failed, because the prediction method is used on the base of the searching numerical value of a candidate for the presidency. Also the Flu Trend service is opened by the Google in 2008. But the Google was embarrassed for the fame's failure for the killing flu prediction system in 2011 and the prediction of presidential election in 2016. In this paper, using the virtual vote algorithm for virtual election and data mining method, the election prediction algorithm is proposed and unpacked. And also the WEKA DB is unpacked. Especially in this paper, using the K means algorithm and XEDOS tools, the prediction of election results is unpacked efficiently. Also using the analysis of the WEKA DB, the smart election prediction system is proposed in this paper.

The Undeniable Digital Multi-Signature Scheme Suitable for User-Oriented Electronic Election (사용자 중심의 전자선거에 적합한 부인봉쇄 다중서명 기법)

  • Yun, Sung-Hyun
    • The Journal of Korean Association of Computer Education
    • /
    • v.8 no.4
    • /
    • pp.97-105
    • /
    • 2005
  • In this study, the undeniable digital multi-signature scheme based on the discrete logarithms is proposed. The proposed multi-signature scheme satisfies undeniability and is secure against active attacks such as fabrication and denial of multi-signature by signers. It is suitable for electronic election scheme in which several administrators are required. Especially in case of dispute among voters and administrators, the proposed scheme can resolve it due to the undeniable property. It can provide fair electronic election by minimizing the role of voting center, and can enable user-oriented electronic election.

  • PDF

The Biometric based Mobile ID and Its Application to Electronic Voting

  • Yun, Sung-Hyun;Lim, Heui-Seok
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.1
    • /
    • pp.166-183
    • /
    • 2013
  • It requires a lot of costs and manpower to manage an election. The electronic voting scheme can make the election system economic and trustful. The widespread use of smart phones causes mobile voting to be a major issue. The smart phone can be used as a mobile voting platform since it can carry out many services in addition to basic telephone service. To make mobile voting practical and trustful, we analyzed two subjects of study. Firstly, the way to make a biometric based mobile ID, which has legal binding forces. In mobile voting, user identification is accomplished on line since the voter should be able to vote wherever they go. The digital ID conducts a similar role to the need for a resident card. The user's identity is bound to the resident card legally. To bind the user's identity to the smart phone, we use USIM. Biometric recognition is also needed to authenticate the user, since the user cannot prove him or her on line face-to-face. The proposed mobile ID can be reissued by means of introducing a random secret value. Secondly, the mobile voting scheme is proposed where candidates can accept election results without doubt. The goal of an election is to select a leader among two or more candidates. Existing electronic voting schemes mainly focus on the study of ballot verification accomplished by voters. These approaches are not safe against collusion attacks where candidates and the election administration center are able to collude to fabricate election results. Therefore, a new type of voting and counting method is needed where candidates can directly take part in voting and counting stages. The biometric based multi-signature scheme is used to make the undeniable multi-signed ballot. The ballot cannot be verified without the help of all candidates. If candidates accept election results without a doubt, the fairness of the election is satisfied.

Election Protocol using Verifiable Interactive Oblivious Transfer and Blind Signature (내용 은닉서명과 VIOT를 적용한 전자선거 프로토콜)

  • Kim, Sang-Choon;Yi, Yong-Ju;Lee, Sang-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.2
    • /
    • pp.392-400
    • /
    • 2000
  • In this paper, we propose an electronic election protocol based on VIOT protocol which utilizes public key cryptographic system and blind signature method to meet the seccurity requirement in election systems. Our proposed electronic election protocol provide voter's privacy and non-repudiation functionality which detect any misdemeanors of voters or relevant personnels.

  • PDF

A Study on the Electronic Voting Scheme Suitable for Large Scale Election (대규모 선거에 적합한 전자 선거 기법에 관한 연구)

  • Yun, Seong-Hyeon;Kim, Tae-Yun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.2
    • /
    • pp.543-551
    • /
    • 1997
  • Many areas of human activities are computerized with the wide spread use of computers and communication networks.Electrinic voting is an important social activity in democtatic society.The realization of electronic democracy is based on the sectrity of edectronic voting scheme.Therefore, it is necessary to use the cryto-graphic technique for secure electronic voting scheme.Therefore, it is necessary to use the cryto-graghic technique for secure election.In this stusy, an dedctronic voting scheme sutiable for large election is proposed.In order to make practi-cal volting scheme, we assume that the voting authorization center is trustful and the chaum's anonymous com-munication channel[6] prepared before the election day.The center authorizes the ballot of eligible voter by using the ID based digital signature scheme in the registeation stage.During the voting stage, undeniable chal-lenge/ response prorocol is performed between the center and the boters to ensure that the intemediate voting results should not affect the entire.The proprsed scheme fully conforms to the requirments of large scale election such as privacy of the voters, fairness, unresuability, unforgeability and eligbility.

  • PDF

Mobile Electronic Voting System for Improving of Election Process Student Representatives (학생임원 선출 방법의 개선을 위한 모바일 전자투표 시스템)

  • Oh, Pill-Woo;Shin, Soo-Bum;Kim, Myeong-Ryeol
    • Journal of The Korean Association of Information Education
    • /
    • v.10 no.1
    • /
    • pp.119-127
    • /
    • 2006
  • This paper is designed to search the new alternatives to supplement the inconvenience of the traditional written ballot method which is executed every early semester to select the class board at the school. It is prepared on the based the results of the design and implement of the wired/wireless inter-working mobile electronic voting system where the students can participate in the real-time class board selection and the decision-making utilizing the mobile phones, PDA and PC they commonly have. It is time when we should consider introducing the electronic voting system, to minimize the students' inconvenience and the subsequent missing class, having to wait in the long line in the designated place to select the class board at every election season. This system enables the students to participate wherever they are other than the common place as well. Further, this research will provide the opportunity to think over the new school election culture in line with the age of Ubiquitous, as well as the useful means in the field to promote the active participation of the parents and students in the students' self-administration, decision-making necessary at the schools.

  • PDF

The Mobile Voting Scheme Providing Voting Fairness Assured by Candidates (후보자들에 의한 선거의 공정성을 제공하는 모바일 투표 기법)

  • Yun, Sung-Hyun
    • Journal of Digital Convergence
    • /
    • v.10 no.2
    • /
    • pp.161-169
    • /
    • 2012
  • It requires a lot of costs and manpower to manage the election system. The electronic voting scheme is needed to make the election system to be economic and fair. Especially, wide spread use of smart phones and wireless networks makes the mobile voting is of major concern. In mobile voting scheme, a smart phone user can vote regardless of the places. In this paper, the mobile voting scheme is proposed where candidates can guarantee fairness of the election system. We analyze mobile voting requirements and create the mobile ID which has legal binding forces and PKI based digital signature keys. In the proposed scheme, a voter's ballot is signed by all candidates using undeniable multi-signature scheme. During the counting stage, the multi-signature on the ballot is not verified without help of all candidates.

Efficient Approach for Maximizing Lifespan in Wireless Sensor Networks by Using Mobile Sinks

  • Nguyen, Hoc Thai;Nguyen, Linh Van;Le, Hai Xuan
    • ETRI Journal
    • /
    • v.39 no.3
    • /
    • pp.353-363
    • /
    • 2017
  • Recently, sink mobility has been shown to be highly beneficial in improving network lifetime in wireless sensor networks (WSNs). Numerous studies have exploited mobile sinks (MSs) to collect sensed data in order to improve energy efficiency and reduce WSN operational costs. However, there have been few studies on the effectiveness of MS operation on WSN closed operating cycles. Therefore, it is important to investigate how data is collected and how to plan the trajectory of the MS in order to gather data in time, reduce energy consumption, and improve WSN network lifetime. In this study, we combine two methods, the cluster-head election algorithm and the MS trajectory optimization algorithm, to propose the optimal MS movement strategy. This study aims to provide a closed operating cycle for WSNs, by which the energy consumption and running time of a WSN is minimized during the cluster election and data gathering periods. Furthermore, our flexible MS movement scenarios achieve both a long network lifetime and an optimal MS schedule. The simulation results demonstrate that our proposed algorithm achieves better performance than other well-known algorithms.

A Study on Electronic Voting Protocol using Bit-Commitment (Bit-Commitment를 이용한 전자투표 프로토콜에 관한 연구)

  • 김대엽;임종인
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.11 no.5
    • /
    • pp.53-62
    • /
    • 2001
  • Fast diffusion of personal computer and network, and developed security technology are augmenting specific gravity of convenient and safe electronic voting system supplementing much problems of existent off-line vote form. But in spite of enlargement of these weight, much limitations are extravagant. Specially, problem that secure voter\`s anonymousness and accuracy of poll can be important urea that judge if electronic voting system can be applied actually. Also, problems such as buying and selling of vote remain to subject that must solve yet. In this paper, we introduce items that is considered to design the safe electronic voting system, and present limitation of electronic polling system announced in [1]. And we propose improvement way. Improved protocol keeping advantages that is presented in [1], designed to keep away voter\`s anonymousness defamation by conspiracy of Election Administration Committee and Totaling Committee, and block unlawful election intervention as original.

Energy Aware Landmark Election and Routing Protocol for Grid-based Wireless Sensor Network (그리드 기반 무선센서네트워크에서 에너지 인지형 Landmark 선정 및 라우팅 프로토콜)

  • Sanwar Hosen, A.S.M.;Cho, Gi-Hwan
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.11a
    • /
    • pp.177-180
    • /
    • 2011
  • In practice, it is well known that geographical and/or location based routing is highly effective for wireless sensor network. Here, electing some landmarks on the network and forwarding data based on the landmark is one of the good approaches for a vast sensing field with holes. In the most previous works, landmarks are elected without considering the residual energy on each sensor. In this paper, we propose an Energy aware Landmark Election and Routing (ELER) protocol to establish a stable routing paths and reduce the total power consumption. The proposed protocol makes use of each sensor's energy level on electing the landmarks, which would be utilized to route a packet towards the target region using greedy forwarding method. Our simulation results illustrate that the proposed scheme can significantly reduce the power dissipation and effectively lengthen the lifetime of the network.