• Title/Summary/Keyword: e-Voting

Search Result 68, Processing Time 0.021 seconds

A Study on Efficient ID-based Partially Blind Signature (효율적인 ID 기반 부분은닉서명에 관한 연구)

  • 김현주;오수현;원동호
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.13 no.6
    • /
    • pp.149-161
    • /
    • 2003
  • Partially blind signature scheme allows the signer to insert non-removable common information into his blind signature. Blind signatures providing with both users privacy and data authenticity are one of key parts of information systems, such anonymous electronic cash and electronic voting as typical examples. Partially blind signature, with which all expired e-cash but for still-alive can be removed from the banks database, copes well with the problem of unlimited growth of the banks' database in an electronic cash system. In this paper we propose an efficient ID-based partially blind signature scheme using the Weil-pairing on Gap Diffie-Hellman group. The security of our scheme relies on the hardness of Computational Diffie-Hellman Problem. The proposed scheme provides higher efficiency than existing partially blind signature schemes by using three-pass protocol between two participants, the signer and requesters also by reducing the computation load. Thus it can be efficiently used in wireless environment.

Increasing Accuracy of Classifying Useful Reviews by Removing Neutral Terms (중립도 기반 선택적 단어 제거를 통한 유용 리뷰 분류 정확도 향상 방안)

  • Lee, Minsik;Lee, Hong Joo
    • Journal of Intelligence and Information Systems
    • /
    • v.22 no.3
    • /
    • pp.129-142
    • /
    • 2016
  • Customer product reviews have become one of the important factors for purchase decision makings. Customers believe that reviews written by others who have already had an experience with the product offer more reliable information than that provided by sellers. However, there are too many products and reviews, the advantage of e-commerce can be overwhelmed by increasing search costs. Reading all of the reviews to find out the pros and cons of a certain product can be exhausting. To help users find the most useful information about products without much difficulty, e-commerce companies try to provide various ways for customers to write and rate product reviews. To assist potential customers, online stores have devised various ways to provide useful customer reviews. Different methods have been developed to classify and recommend useful reviews to customers, primarily using feedback provided by customers about the helpfulness of reviews. Most shopping websites provide customer reviews and offer the following information: the average preference of a product, the number of customers who have participated in preference voting, and preference distribution. Most information on the helpfulness of product reviews is collected through a voting system. Amazon.com asks customers whether a review on a certain product is helpful, and it places the most helpful favorable and the most helpful critical review at the top of the list of product reviews. Some companies also predict the usefulness of a review based on certain attributes including length, author(s), and the words used, publishing only reviews that are likely to be useful. Text mining approaches have been used for classifying useful reviews in advance. To apply a text mining approach based on all reviews for a product, we need to build a term-document matrix. We have to extract all words from reviews and build a matrix with the number of occurrences of a term in a review. Since there are many reviews, the size of term-document matrix is so large. It caused difficulties to apply text mining algorithms with the large term-document matrix. Thus, researchers need to delete some terms in terms of sparsity since sparse words have little effects on classifications or predictions. The purpose of this study is to suggest a better way of building term-document matrix by deleting useless terms for review classification. In this study, we propose neutrality index to select words to be deleted. Many words still appear in both classifications - useful and not useful - and these words have little or negative effects on classification performances. Thus, we defined these words as neutral terms and deleted neutral terms which are appeared in both classifications similarly. After deleting sparse words, we selected words to be deleted in terms of neutrality. We tested our approach with Amazon.com's review data from five different product categories: Cellphones & Accessories, Movies & TV program, Automotive, CDs & Vinyl, Clothing, Shoes & Jewelry. We used reviews which got greater than four votes by users and 60% of the ratio of useful votes among total votes is the threshold to classify useful and not-useful reviews. We randomly selected 1,500 useful reviews and 1,500 not-useful reviews for each product category. And then we applied Information Gain and Support Vector Machine algorithms to classify the reviews and compared the classification performances in terms of precision, recall, and F-measure. Though the performances vary according to product categories and data sets, deleting terms with sparsity and neutrality showed the best performances in terms of F-measure for the two classification algorithms. However, deleting terms with sparsity only showed the best performances in terms of Recall for Information Gain and using all terms showed the best performances in terms of precision for SVM. Thus, it needs to be careful for selecting term deleting methods and classification algorithms based on data sets.

A Folksonomy Ranking Framework: A Semantic Graph-based Approach (폭소노미 사이트를 위한 랭킹 프레임워크 설계: 시맨틱 그래프기반 접근)

  • Park, Hyun-Jung;Rho, Sang-Kyu
    • Asia pacific journal of information systems
    • /
    • v.21 no.2
    • /
    • pp.89-116
    • /
    • 2011
  • In collaborative tagging systems such as Delicious.com and Flickr.com, users assign keywords or tags to their uploaded resources, such as bookmarks and pictures, for their future use or sharing purposes. The collection of resources and tags generated by a user is called a personomy, and the collection of all personomies constitutes the folksonomy. The most significant need of the folksonomy users Is to efficiently find useful resources or experts on specific topics. An excellent ranking algorithm would assign higher ranking to more useful resources or experts. What resources are considered useful In a folksonomic system? Does a standard superior to frequency or freshness exist? The resource recommended by more users with mere expertise should be worthy of attention. This ranking paradigm can be implemented through a graph-based ranking algorithm. Two well-known representatives of such a paradigm are Page Rank by Google and HITS(Hypertext Induced Topic Selection) by Kleinberg. Both Page Rank and HITS assign a higher evaluation score to pages linked to more higher-scored pages. HITS differs from PageRank in that it utilizes two kinds of scores: authority and hub scores. The ranking objects of these pages are limited to Web pages, whereas the ranking objects of a folksonomic system are somewhat heterogeneous(i.e., users, resources, and tags). Therefore, uniform application of the voting notion of PageRank and HITS based on the links to a folksonomy would be unreasonable, In a folksonomic system, each link corresponding to a property can have an opposite direction, depending on whether the property is an active or a passive voice. The current research stems from the Idea that a graph-based ranking algorithm could be applied to the folksonomic system using the concept of mutual Interactions between entitles, rather than the voting notion of PageRank or HITS. The concept of mutual interactions, proposed for ranking the Semantic Web resources, enables the calculation of importance scores of various resources unaffected by link directions. The weights of a property representing the mutual interaction between classes are assigned depending on the relative significance of the property to the resource importance of each class. This class-oriented approach is based on the fact that, in the Semantic Web, there are many heterogeneous classes; thus, applying a different appraisal standard for each class is more reasonable. This is similar to the evaluation method of humans, where different items are assigned specific weights, which are then summed up to determine the weighted average. We can check for missing properties more easily with this approach than with other predicate-oriented approaches. A user of a tagging system usually assigns more than one tags to the same resource, and there can be more than one tags with the same subjectivity and objectivity. In the case that many users assign similar tags to the same resource, grading the users differently depending on the assignment order becomes necessary. This idea comes from the studies in psychology wherein expertise involves the ability to select the most relevant information for achieving a goal. An expert should be someone who not only has a large collection of documents annotated with a particular tag, but also tends to add documents of high quality to his/her collections. Such documents are identified by the number, as well as the expertise, of users who have the same documents in their collections. In other words, there is a relationship of mutual reinforcement between the expertise of a user and the quality of a document. In addition, there is a need to rank entities related more closely to a certain entity. Considering the property of social media that ensures the popularity of a topic is temporary, recent data should have more weight than old data. We propose a comprehensive folksonomy ranking framework in which all these considerations are dealt with and that can be easily customized to each folksonomy site for ranking purposes. To examine the validity of our ranking algorithm and show the mechanism of adjusting property, time, and expertise weights, we first use a dataset designed for analyzing the effect of each ranking factor independently. We then show the ranking results of a real folksonomy site, with the ranking factors combined. Because the ground truth of a given dataset is not known when it comes to ranking, we inject simulated data whose ranking results can be predicted into the real dataset and compare the ranking results of our algorithm with that of a previous HITS-based algorithm. Our semantic ranking algorithm based on the concept of mutual interaction seems to be preferable to the HITS-based algorithm as a flexible folksonomy ranking framework. Some concrete points of difference are as follows. First, with the time concept applied to the property weights, our algorithm shows superior performance in lowering the scores of older data and raising the scores of newer data. Second, applying the time concept to the expertise weights, as well as to the property weights, our algorithm controls the conflicting influence of expertise weights and enhances overall consistency of time-valued ranking. The expertise weights of the previous study can act as an obstacle to the time-valued ranking because the number of followers increases as time goes on. Third, many new properties and classes can be included in our framework. The previous HITS-based algorithm, based on the voting notion, loses ground in the situation where the domain consists of more than two classes, or where other important properties, such as "sent through twitter" or "registered as a friend," are added to the domain. Forth, there is a big difference in the calculation time and memory use between the two kinds of algorithms. While the matrix multiplication of two matrices, has to be executed twice for the previous HITS-based algorithm, this is unnecessary with our algorithm. In our ranking framework, various folksonomy ranking policies can be expressed with the ranking factors combined and our approach can work, even if the folksonomy site is not implemented with Semantic Web languages. Above all, the time weight proposed in this paper will be applicable to various domains, including social media, where time value is considered important.

Block Chain Application Technology to Improve Reliability of Real Estate Market (부동산 시장의 신뢰성 향상을 위한 블록체인 응용 기술)

  • Oh, Seoyoung;Lee, Changhoon
    • The Journal of Society for e-Business Studies
    • /
    • v.22 no.1
    • /
    • pp.51-64
    • /
    • 2017
  • After Bitcoin was proposed by Satoshi Nakamoto in 2009, studies have been carried out to apply the Block Chain technology in various environment, which was applied as a distributed transaction of Bitcoin. Smart contracts, voting and proof of ownership of digital contents are typical applications of Block Chain. They used the feature that it is impossible to modify or delete once recorded facts. They also applied to prove relevant facts and to provide data integrity. The applied cases are mainly made in an environment where the data should or could be open to the public, and they have been proposed as solutions to solve the problems occurred in relations. This fact has led to the attention that Block Chain can be applied as a good alternative in similar circumstances. In this study, real estate market service was selected to expand the application range of Block Chain. Although there are about 250 applications and web services in total, the satisfaction is not high due to false offerings. Thus we propose a countermeasure against the problem by applying the Block Chain to the real estate market service, and investigate the research direction of the Block Chain in the future market.

Application and Policy Direction of Blockchain in Logistics and Distribution Industry (물류 및 유통산업의 블록체인 활용과 정책 방향)

  • Kim, Ki-Heung;Shim, Jae-Hyun
    • The Journal of Industrial Distribution & Business
    • /
    • v.9 no.6
    • /
    • pp.77-85
    • /
    • 2018
  • Purpose - The purpose of this study is to subdivide trade transaction-centered structure in a logistics/distribution industry system to apply blockchain, to establish and resolve with which types of technology, and to provide policy direction of government institution and technology to apply blockchain in this kind of industry. Research design, data, and methodology - This study was conducted with previous researches centered on cases applied in various industry sectors on the basis of blockchain technology. Results - General fields of blockchain application include digital contents distribution, IoT platform, e-Commerce, real-estate transaction, decentralized app. development(storage), certification service, smart contract, P2P network infrastructure, publication/storage of public documents, smart voting, money exchange, payment/settlement, banking security platform, actual asset storage, stock transaction and crowd funding. Blockchain is being applied in various fields home and abroad and its application cases can be explained in the banking industry, public sector, e-Commerce, medical industry, distribution and supply chain management, copyright protection. As examined in the blockchain application cases, it is expected to establish blockchain that can secure safety through distributed ledger in trade transaction because blockchain is established and applied in various sectors of industries home and abroad. Parties concerned of trade transaction can secure visibility even in interrupted specific section when they provide it as a base for distributed ledger application in trade and establish trade transaction model by applying blockchain. In case of interrupted specific section by using distributed ledger, blockchain model of trade transaction needs to be formed to make it possible for parties concerned involved in trade transaction to secure visibility and real-time tracking. Additionally, management should be possible from the time of contract until payment, freight transfer to buyers through land, air and maritime transportation. Conclusions - In order to boost blockchain-based logistics/distribution industry, the government, institutionally, needs to back up adding legal plan of shipping, logistics and distribution, reviewing standardization of electronic switching system and coming up with blockchain-based industrial road maps. In addition, the government, technologically, has to support R&D for integration with other high technology, standardization of distribution industry's blockchain technology and manpower training to expand technology development.

The possibility of South Korea to become a member state of APSCO: an analysis from Legal and political perspectives (韓國加入亞太空間合作組織的可能性 : 基于法律与政策的分析)

  • Nie, Mingyan
    • The Korean Journal of Air & Space Law and Policy
    • /
    • v.31 no.2
    • /
    • pp.237-269
    • /
    • 2016
  • Asia-Pacific Space Cooperation Organization (APSCO) is the only intergovernmental space cooperation organization in Asia. Since its establishment to date, eight countries have signed the convention and become member states. South Korea participated actively in the preparatory phase of creating the organization, and one conference organized by AP-MCSTA which is the predecessor of APSCO was held in South Korea. However, after the APSCO Convention was opened for signature in 2005 to date, South Korea does not ratify the Convention and become a member. The rapid development of space commercialization and privatization, as well as the fastest growing commercial space market in Asia, provides opportunities for Asian countries to cooperate with each other in relevant space fields. And to participate in the existing cooperation framework (e.g., the APSCO) by the Asian space countries (e.g., South Korea) could be a proper choice. Even if the essential cooperation in particular space fields is challenging, joint space programs among different Asian countries for dealing with the common events can be initiated at the first steps. Since APSCO has learned the successful legal arrangements from ESA, the legal measures established by its Convention are believed to be qualified to ensure the achievement of benefits of different member states. For example, the regulation of the "fair return" principle confirms that the return of interests from the relevant programs is in proportion to the member's investment in the programs. Moreover, the distinguish of basic and optional activities intends to authorize the freedom of the members to choose programs to participate. And for the voting procedure, the acceptance of the "consensus" by the Council is in favor of protecting the member's interest when making decisions. However, political factors that are potential to block the participation of South Korea in APSCO are difficult to be ignored. A recent event is an announcement of deploying THAAD by South Korea, which causes tension between South Korea and China. The cooperation between these two states in space activities will be influenced. A long-standing barrier is that China acts as a non-member of the main international export control mechanism, i.e., the MTCR. The U.S takes this fact as the main reason to prevent South Korea to cooperate with China in developing space programs. Although the political factors that will block the participation of South Korea in APSCO are not easy to removed shortly, legal measures can be taken to reduce the political influence. More specifically, APSCO is recommended to ensure the achievement of commercial interests of different cooperation programs by regulating precisely the implementation of the "fair return" principle. Furthermore, APSCO is also suggested to contribute to managing the common regional events by sharing satellite data. And it is anticipated that these measures can effectively response the requirements of the rapid development of space commercialization and the increasing common needs of Asia, thereby to provide a platform for the further cooperation. In addition, in order to directly reduce the political influence, two legal measures are necessary to be taken: Firstly, to clarify the rights and responsibilities of the host state (i.e., China) as providing assistance, coordination and services to the management of the Organization to release the worries of the other member states that the host state will control the Organization's activities. And secondly, to illustrate that the cooperation in APSCO is for the non-military purpose (a narrow sense of "peaceful purpose") to reduce the political concerns. Regional cooperation in Asia regarding space affairs is considered to be a general trend in the future, so if the participation of South Korea in APSCO can be finally proved to be feasible, there will be an opportunity to discuss the creation of a comprehensive institutionalized framework for space cooperation in Asia.

How Populist are South Korean Voters? Antecedents and Consequences of Individual-level Populism (한국 유권자의 포퓰리즘 성향이 정치행태에 미치는 영향)

  • Ha, Shang E.
    • Korean Journal of Legislative Studies
    • /
    • v.24 no.1
    • /
    • pp.135-170
    • /
    • 2018
  • The recent success of populist parties and candidates in the US and European countries leads to a massive amount of empirical research on populism, a deviant form of representative democracy. Much ink has been spilled to define populism and to identify the causes of its rise and continued success in democratic political system. However, little is known about populist attitudes of individual voters. Using a large-scale online survey fielded in the context of the South Korean presidential election in 2017, this study examines (1) what determines populist attitudes of South Korean voters and (2) how populist attitudes are associated with evaluations of political parties, candidates, and political issues. Statistical analysis reveals that people high on populism are more likely to support an underdog left-wing political party and its presidential candidate, and are less likely to support policies implemented or proposed under the auspices of the Park Geun-hye administration. These findings do not necessarily suggest the inherent affinity between populism and left-wing ideology; rather, it implies populist attitudes happened to appear in 2017, in reactions to lack of confidence in the previous government.

Finding Influential Users in the SNS Using Interaction Concept : Focusing on the Blogosphere with Continuous Referencing Relationships (상호작용성에 의한 SNS 영향유저 선정에 관한 연구 : 연속적인 참조관계가 있는 블로고스피어를 중심으로)

  • Park, Hyunjung;Rho, Sangkyu
    • The Journal of Society for e-Business Studies
    • /
    • v.17 no.4
    • /
    • pp.69-93
    • /
    • 2012
  • Various influence-related relationships in Social Network Services (SNS) among users, posts, and user-and-post, can be expressed using links. The current research evaluates the influence of specific users or posts by analyzing the link structure of relevant social network graphs to identify influential users. We applied the concept of mutual interactions proposed for ranking semantic web resources, rather than the voting notion of Page Rank or HITS, to blogosphere, one of the early SNS. Through many experiments with network models, where the performance and validity of each alternative approach can be analyzed, we showed the applicability and strengths of our approach. The weight tuning processes for the links of these network models enabled us to control the experiment errors form the link weight differences and compare the implementation easiness of alternatives. An additional example of how to enter the content scores of commercial or spam posts into the graph-based method is suggested on a small network model as well. This research, as a starting point of the study on identifying influential users in SNS, is distinctive from the previous researches in the following points. First, various influence-related properties that are deemed important but are disregarded, such as scraping, commenting, subscribing to RSS feeds, and trusting friends, can be considered simultaneously. Second, the framework reflects the general phenomenon where objects interacting with more influential objects increase their influence. Third, regarding the extent to which a bloggers causes other bloggers to act after him or her as the most important factor of influence, we treated sequential referencing relationships with a viewpoint from that of PageRank or HITS (Hypertext Induced Topic Selection).