• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.2
• /
• pp.21-30
• /
• 2000

If there exists a model that calculates the proper candidate position whenever the game of Go is in progress, it can be used for setting up the prototype of the candidate generation algorithm without using case-based reasoning. In this paper, we analyze Go through combinatorial game theory and on the basis of probability matrix (PM) showing the difference of the territory of the black and the white. We design and implement a candidate generation system(CGS) to find the candidates at a situation in Go. CGS designed in this paper can compute Influence power, safety, probability value(PV), and PM and then generate candidate positions for a present scene, once a stone is played at a scene. The basic strategy generates five candidates for the Present scene, and then chooses one with the highest PV. CGS generates the candidate which emphasizes more defence tactics than attack ones. In the opening game of computer Go, we can know that CGS which has no pattern is somewhat superior to NEMESIS which has the Joseki pattern.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.9
• /
• pp.21-29
• /
• 2020

In this paper, we propose quantitative evaluation method that enable security comparison between Security Container Runtimes. security container runtime technologies have been developed to address security issues such as Container escape caused by containers sharing the host kernel. However, most literature provides only a analysis of the security of container technologies using rough metrics such as the number of available system calls, making it difficult to compare the secureness of container runtimes quantitatively. While the proposed model uses a new method of combining the degree of exposure of host system calls with various external vulnerability metrics. With the proposed technique, we measure and compare the security of runC (Docker default Runtime) and two representative Security Container Runtimes, gVisor, and Kata container.

• Journal of Digital Convergence
• /
• v.18 no.6
• /
• pp.279-285
• /
• 2020

In the era of the Fourth Industrial Revolution, there are many sensors around. People and things are connected to these sensors to the internet. Numerous connected sensors produce the latest data in seconds, and these data are stacked with big data of unimaginable size. Because personal information can be contained in any place of data produced, device and system protection are needed. Digital twins are virtual models that accurately reflect the status information of physical assets and systems that utilize them. The characteristic of digital twin is that digital twin itself has temporal and structural identity enough to represent the object of reality. In the virtual environment the reproduced reality, it continuously simulates and it virtuals of the point of time or the future, the replica can be created. Therefore, this study cited factors threatening personal information in the era of the Fourth Industrial Revolution. And proposed using digital twin technology that can simulate in real-time to overcome the risk of personal information hacking.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.55-63
• /
• 2016

SOA(service oriented architecture) based ESB(enterprise service bus) model is widely adopted in many companies for the safe processing of enormous data and the integration of business system. The existing web service technologies for the construction of SOA, however, show unsatisfactory in practical applications though the standardization of web service security technologies is in progress due to their limitations in safe exchange of data. Internal end users using a large business system based on such environment are composed of the variety of organizations and roles. Companies might receive more serious damage from insider threat than that from external one when internal end users get unauthorized information beyond the limits of their authority for private profit and bad purposes. In this paper, we propose a security architecture capable of identifying and coping with the security threats of web service technologies arouse from internal end users.

• Journal of Korea Game Society
• /
• v.6 no.2
• /
• pp.13-22
• /
• 2006

As the development of games continues, the intelligence of NPC is becoming more and more important. Nowadays, the NPCs of MMORPGS are not only capable of simple actions like moving and attacking players, but also utilizing variety of skills and tactics as human-players do. This study suggests a method that grants characters used in RPG(Role-Playing Game) an ability of training and adaptation using Neural network and Genetic Algorithm. In this study, a simple game-play model is constructed to test how suggested intellect characters could train and adapt themselves to game rules and tactics. In the game-play model, three types of characters(Tanker, Dealer, Healer) are used. Intellect character group constructed by NN and GA, and trained by combats against enemy character group constructed by FSM. As the result of test, the proposed intellect characters group acquire an appropriate combat tactics by themselves according to their abilities and those of enemies, and adapt change of game rule.

• Korean Journal of Social Welfare
• /
• v.64 no.1
• /
• pp.53-77
• /
• 2012

The Easterlin Paradox is widely accepted as a pioneer of happiness study in social science disciplines including Economics, Psychology, and Sociology. Moreover, it should be noted, the paradox has abundant implications on many social issues such as 'economic growth or social equity', 'basic income' and so forth. It is in this regard that this paper purports to understand debates around the paradox. For this purpose, the chapter two examines the theoretical perspectives of the Easterlin Paradox, and accordingly the chapter three examines the Easterlin Paradox debates since the early 1990s. In the context of the Easterlin paradox debates, the chapter four scrutinizes the debates around satiation point in income-happiness nexus and duly concludes with some social welfare implications.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.6
• /
• pp.348-353
• /
• 2010

A threshold decryption scheme is a multi-party public key cryptosystem that allows any sufficiently large subset of participants to decrypt a ciphertext, but disallows the decryption otherwise. When performing a threshold decryption, a third party is often involved to guarantee fairness among the participants. To maintain the security of the protocol as high as possible, it is desirable to lower the level of trust and the amount of information given to the third party. In this paper, we present a threshold decryption scheme which allows the anonymity of the participants as well as the fairness by employing a semi-trusted third party (STTP) which follows the protocol properly with the exception that it keeps a record of all its intermediate computations. Our solution preserves the security and fairness of the previous scheme and reveals no information about the identities of the participants and the plaintext even though an attacker is allowed to access the storage of the STTP.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.2
• /
• pp.369-383
• /
• 2018

User authentication using PIN input or lock pattern is widely used as a user authentication method of smartphones. However, it is vulnerable to shoulder surfing attacks and because of low complexity of PIN and lock pattern, it has low security. To complement these problems, keystroke dynamics have been used as an authentication method for complex authentication and researches on this have been in progress. However, many studies have used imposter data in classifier training and validation. When keystroke dynamics authentications are actually applied in reality, it is realistic to use only legitimate user data for training, and using other people's data as imposter training data may result in problems such as leakage of authentication data and invasion of privacy. In response, in this paper, we experiment and obtain the optimal ratio of the thresholds for distance based classification. By suggesting the optimal ratio, we try to contribute to the real applications of keystroke authentications.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.469-480
• /
• 2008

The recently proposed RFID(Radio Frequency Identification) authentication protocol based on a hash function can be divided into two types according to the type of information used for authentication between a reader and a tag: either a value fixed or one updated dynamically in a tag memory. In this paper, we classify the protocols into a static ID-based and a dynamic-ID based protocol and then analyze their respective strengths and weaknesses. Also, we define a new security model including forward/backward traceability, synchronization, forgery attacks. Based on the model, we analyze the previous protocols and propose a new dynamic-ID based RFID mutual authentication protocol. Our protocol provide enhanced RFID user privacy compared to previous protocols and identify a tag efficiently in terms of the operation quantity of a tag and database.

• KIISE Transactions on Computing Practices
• /
• v.23 no.6
• /
• pp.343-349
• /
• 2017

Combat modeling and simulation (M&S) of large-scale computer generated forces (CGFs) enables the development of even the most sophisticated strategy of combat warfare and the efficient facilitation of a comprehensive simulation of the upcoming battle. The DEVS-POMDP framework is proposed where the DEVS framework describing the explicit behavior rules in military doctrines, and POMDP model describing the autonomous behavior of the CGFs are hierarchically combined to capture the complexity of realistic world combat modeling and simulation. However, it has previously been well documented that computing the optimal policy of a POMDP model is computationally demanding. In this paper, we show that not only can the performance of CGFs be improved by an efficient POMDP tree search algorithm but CGFs are also able to conveniently learn the behavior model of the enemy through case studies in the scenario of counterfire warfare and the scenario of a mechanized infantry brigade's offensive operations.