• 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.

• 전자공학회논문지 IE
• /
• v.47 no.4
• /
• pp.10-17
• /
• 2010

There is no general method to find out from signals of the channel outputs of ICA(Independent Component Analysis) which is what you want. Assuming speech signals contaminated with the sound from the muffler of a car, this paper presents the method which shows what you want, It is anticipated that speech signals will show larger correlation coefficients for speech signals than others. Batch, maximum and average method were proposed using 'ah', 'oh', 'woo' vowels whose signals were spoken by the same person who spoke the speech signals and using the same vowels whose signals are by another person. With the correlation coefficients which were calculated for each vowel, voting and summation methods were added. This paper shows what the best is among several methods tried.

• Journal of KIISE:Information Networking
• /
• v.30 no.6
• /
• pp.720-728
• /
• 2003

Blind signature is such a signature scheme that conceals the contents of signature itself and who is the user of the signature make user's anonymity possible. For this reason, they are used in security services such as electronic cashes and electronic votes in which the behavior of actor should not be exposed. In this paper we propose an ID-based blind signature scheme from Gap Diffie-Hellman group. Its security is based on the hardness of Computational Diffie-Hellman Problem. Proposed scheme efficiently improve against existing blind signature scheme by using two-pass protocol between two users and by reducing computation process. Therefore it can be used efficiently in wireless PKI environment.

• The Journal of the Korea Contents Association
• /
• v.21 no.1
• /
• pp.105-118
• /
• 2021

This study pays attention to the fact that the fake news is attracting attention because it causes various social problems. To find out these fake news' influence, the study conducted the experiment to examine that the fake news related to the electronic voting system affects on the news users' attitude of using the system, intention to participate in the election through the system and reliability of news services. The results have shown that the fake news framed with negative contents reduced users' attitude of using the system and intention of participation in the election. Especially, as a result of examining the difference in the fake news' influence according to each news services, in the case that users recognized that the news was fake after exposing to the general internet news, the attitude of using the system and the intention of participation in the election have reduced and recovered again. However, users who exposed to Naver, Facebook believed the negative content of the fake news more strongly. Through these results, this study empirically confirmed that the fake news has a tendency to exert influence on users' cognitive dimension and to reinforce awareness in a direction consistent with the initial exposure information.

• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.545-555
• /
• 2004

Proxy signature scheme allow a designated proxy person to sign a message on behalf of the original signer. Partially blind signature scheme allows the signer to insert non-removable common information into his blind signature. Proxy signature and partially blind signature are very important technologies in secure e-commerce. In this paper we propose new proxy signature scheme and ID-based partially blind signature scheme using bilinear pairing. further combining them, we propose a proxy partially blind signature scheme. The security of our schemes relies on the hardness of Computational Diffie-Hellman Problem. If we removing common information form propose ID-based partially blind signature scheme and proxy partially blind signature scheme, then they become variants of ID-based blind signature scheme and proxy blind signature scheme of Zhangs respectively.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.10
• /
• pp.502-510
• /
• 2007

Private Matching is a problem of computing the intersection of private datasets of two parties. One could envision the usage of private matching for Insurance fraud detection system, Do-not-fly list, medical databases, and many other applications. In 2004, Freedman et at. [1] introduced a probabilistic solution for this problem, and they extended it to malicious adversary model and multi-party computation. In this paper, we propose a new deterministic protocol for private matching with perfect correctness. We apply this technique to adversary models, achieving more reliable and higher speed computation.

• The Journal of the Korea Contents Association
• /
• v.9 no.10
• /
• pp.59-66
• /
• 2009

A strong designated verifier signature scheme is a special type of signature scheme which provides signer anonymity by enabling the specified recipient, called a designated verifier, to simulate a signature which is indistinguishable from the signer's signature. It has many applications such as software distribution or electronic voting. In this paper, we consider two important security properties of strong designated verifier signature scheme - source hiding and security against key-compromise attack. We show that the two properties cannot be achieved at the same time. Finally, we present a new ID-based strong designated verifier signature scheme which is secure against key-compromise attack.

• Journal of Information Technology Services
• /
• v.19 no.3
• /
• pp.101-115
• /
• 2020

Electronic voting is one of information technology service to handle a wide range of functions, including registration, certification, input and results of voting, using electronic technology, depending on the degree of automation. It helps voters exercise their voting rights not only for individual suffrage but also for major corporate decisions as shareholders by expressing their opinions regardless of geographical and time constraints. Such electronic voting helps open and expand voting participation, but on the contrary, it is possible to identify who voted and what kind of vote, such voting cannot guarantee confidentiality. Therefore, if blockchain technology is applied to electronic voting, it can increase the speed of processing and confidentiality by encrypting voting information. In this regard, the study aims to identify institutional issues on how electronic voting can be activated at a company's shareholders' meeting, and to find ways to overcome the limitations of existing electronic voting by utilizing the technical characteristics of blockchain. This study proposes a consortium-type blockchain-based electronic voting system to enhance the convenience and reliability of electronic voting for shareholders' meetings. In addition, this paper suggests how to enhance shareholders' profits through electronic voting at shareholders' meetings, as well as its policy measures and future improvements.

• Journal of KIISE:Software and Applications
• /
• v.29 no.3
• /
• pp.192-201
• /
• 2002

Automated text classification is considered as an important method to manage and process a huge amount of documents in digital forms that are widespread and continuously increasing. Recently, text classification has been addressed with machine learning technologies such as k-nearest neighbor, decision tree, support vector machine and neural networks. However, only few investigations in text classification are studied on real problems but on well-organized text corpus, and do not show their usefulness. This paper proposes and analyzes text classification methods for a real application, email document classification task. First, we propose a combining method of multiple neural networks that improves the performance through the combinations with maximum and neural networks. Second, we present another strategy of combining multiple machine learning classifiers. Voting, Borda count and neural networks improve the overall classification performance. Experimental results show the usefulness of the proposed methods for a real application domain, yielding more than 90% precision rates.

• Phonetics and Speech Sciences
• /
• v.14 no.4
• /
• pp.35-43
• /
• 2022

This paper studies how to improve the identification rate of laryngeal disability speech data by convolutional neural network (CNN) and machine learning ensemble learning methods. In general, the number of laryngeal dysfunction speech data is small, so even if identifiers are constructed by statistical methods, the phenomenon caused by overfitting depending on the training method can lead to a decrease the identification rate when exposed to external data. In this work, we try to combine results derived from CNN models and machine learning models with various accuracy in a multi-voting manner to ensure improved classification efficiency compared to the original trained models. The Pusan National University Hospital (PNUH) dataset was used to train and validate algorithms. The dataset contains normal voice and voice data of benign and malignant tumors. In the experiment, an attempt was made to distinguish between normal and benign tumors and malignant tumors. As a result of the experiment, the random forest method was found to be the best ensemble method and showed an identification rate of 85%.