• Journal of Platform Technology
• /
• v.12 no.3
• /
• pp.27-40
• /
• 2024

Collaborative programs are tools designed to support multiple people working together, enhancing collaboration and communication efficiency, improving productivity, and overcoming the constraints of time and place. In the endemic era, many companies and individuals prefer using collaborative programs. These programs often handle sensitive information, such as work content, documents, and user data, which can cause significant damage if leaked. Exploiting this, various attack scenarios have emerged, including malware attacks disguised as collaborative programs, exploiting vulnerabilities within these programs, and stealing internal tokens. To prevent such attacks, it is essential to analyze and respond to potential threats proactively. This paper focuses on Notion, a widely used collaborative program, to collect and analyze artifacts related to user information and activities in both PC and Android environments. Based on the collected data, we categorize critical information, discuss potential threats, and propose countermeasures.

• Journal of Service Research and Studies
• /
• v.13 no.1
• /
• pp.108-126
• /
• 2023

This study explored the sustainability of a blockchain-based cultural art performance video platform through the construction of Gyeonggi Art On, a new media art broadcasting station in Gyeonggi-do. In addition, the technical limitations of video content transaction using block chain, legal and institutional issues, and the protection of personal information and intellectual property rights were reviewed. As for the research method, participatory observation methods such as in-depth interviews with developers and operators and participation in meetings were conducted. The researcher participated in and observed the entire development process, including designing and developing blockchain nodes, smart contracts, APIs, UI/UX, and testing interworking between blockchain and content distribution services. Research Question 1: The results of the study on 'Which technology model is suitable for a blockchain-based performance video content distribution public platform?' are as follows. 1) The blockchain type suitable for the public platform for distribution of art performance video contents based on the blockchain is the private type that can be intervened only when the blockchain manager directly invites it. 2) In public platforms such as Gyeonggi ArtOn, among the copyright management model, which is an art based on NFT issuance, and the BC token and cloud-based content distribution model, the model that provides content to external demand organizations through API and uses K-token for fee settlement is suitable. 3) For public platform initial services such as Gyeonggi ArtOn, a closed blockchain that provides services only to users who have been granted the right to use content is suitable. Research question 2: What legal and institutional problems should be reviewed when operating a blockchain-based performance video distribution public platform? The results of the study are as follows. 1) Blockchain-based smart contracts have a party eligibility problem due to the nature of blockchain technology in which the identities of transaction parties may not be revealed. 2) When a security incident occurs in the block chain, it is difficult to recover the loss because it is unclear how to compensate or remedy the user's loss. 3) The concept of default cannot be applied to smart contracts, and even if the obligations under the smart contract have already been fulfilled, the possibility of incomplete performance must be reviewed.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.3
• /
• pp.10-17
• /
• 2012

In general, image-based 3D scenes can now be found in many popular vision systems, computer games and virtual reality tours. In this paper, we propose a method for creating 3D virtual scenes based on 2D image that is completely automatic and requires only a single scene as input data. The proposed method is similar to the creation of a pop-up illustration in a children's book. In particular, to estimate geometric structure information for 3D scene from a single outdoor image, we apply the tensor voting to an image segmentation. The tensor voting is used based on the fact that homogeneous region in an image is usually close together on a smooth region and therefore the tokens corresponding to centers of these regions have high saliency values. And then, our algorithm labels regions of the input image into coarse categories: "ground", "sky", and "vertical". These labels are then used to "cut and fold" the image into a pop-up model using a set of simple assumptions. The experimental results show that our method successfully segments coarse regions in many complex natural scene images and can create a 3D pop-up model to infer the structure information based on the segmented region information.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.5 s.347
• /
• pp.84-93
• /
• 2006

Ethernet-PON is an emerging access network technology that provides a low-cost method of deploying optical access lines between OLT and ONUs. It has a point-to-multipoint and multipoint-to-point architecture in downstream and upstream direction, respectively. Therefore, downstream packets are broadcast from an OLT toward all ONUs sithout collision. On the other hand, since alt ONUs share a common channel, the collision may be occurred for the upstream transmission. Therefore, earlier efforts on Ethernet-PON have been concentrated on an upstream MAC protocol to avoid collision. But it is needed to control downstream traffic in practical access network, where the network provider limits available bandwidth according to the number of users. In this paper, we propose a traffic control scheme for supporting the fairness of the downstream bandwidth. The objective of this algorithm is to guarantee the fairness of ONUs while maintaining good performance. In order to do this, we define the service probability that considers the past traffic information for downstream, the number of tokens and the relative size of negotiated bandwidth. We develop the simulation model for Ethernet-PON to evaluate the rate-limiting algorithm by using AWESIM. Some results are evaluated and analyzed in terms of defined fairness factor, delay and dropping rate under various scenario.

• The Journal of the Korea Contents Association
• /
• v.16 no.8
• /
• pp.90-96
• /
• 2016

The 3390 million people, around 83% of the adult population in Korea use smartphone. Although the safety problem of the certificate has been occurred continuously, most of these users use the certificate. These safety issues as a solution to 'The owner of a mobile phone using SMS authentication technology', 'Biometric authentication', etc are being proposed. but, a secure and reliable authentication scheme has not been proposed for replace the certificate yet. and there are many attacks to steal the certificate and private key. For these reasons, security experts recommend to store the certificate and private key on usb flash drive, security tokens, smartphone. but smartphones are easily infected malware, an attacker can steal certificate and private key by malicious code. If an attacker snatchs the certificate, the private key file, and the password for the private key password, he can always act as valid user. In this paper, we proposed a safe way to keep the private key on smartphone using smartphone's unique information and user password. If an attacker knows the user password, the certificate and the private key, he can not know the smart phone's unique information, so it is impossible to use the encrypted private key. Therefore smartphone user use IT service safely.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.7
• /
• pp.36-45
• /
• 1999

In order to control the flow of traffics in ATM networks and optimize the usage of network resources, an efficient control mechanism is necessary to cope with congestion and prevent the degradation of network performance caused by congestion. In this paper, Buffered Leaky Bucket which applies the same control scheme to a variety of traffics requiring the different QoS(Quality of Service) and Neural Networks lead to the effective buffer utilization and QoS enhancement in aspects of cell loss rate and mean transfer delay. And the cell scheduling algorithms such as DWRR and DWEDF for multiplexing the incoming traffics are enhanced to get the better fair delay. The network congestion information from cell scheduler is used to control the predicted traffic loss rate of Neural Leaky Bucket, and token generation rate and buffer threshold are changed by the predicted values. The prediction of traffic loss rate by neural networks can enhance efficiency in controlling the cell loss rate and cell transfer delay of next incoming cells and also be applied for other traffic controlling schemes. Computer simulation results performed for random cell generation and traffic prediction show that QoSs of the various kinds of traffcis are increased.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.18 no.4
• /
• pp.171-180
• /
• 2004

CDP(handoff Call Dropping Probability) and CBP(new Call Blocking Probability) have been used as two important call level QoS parameters in cellular mobile communications. But, many methods to reduce CDP without considering CBP have been studied, and hand-off call priority scheme has been introduced. But the use of hand-off call priority scheme increases CBP and decreases channel utilization rate depending on the number of reserved channel for priority. In this paper, we propose a CAC(Call Admission Control) algorithm with overflow and preemption to solve the problem caused by considering CDP and CBP in calculation of the number of channel reserved. The problem is the increase of CDP as the traffic load increases. In our CAC algorithm, hand-off call is permitted to use(overflow) unreserved and unused channel if there is no reserved and unused channel, and new call is permitted to use(preemption) the channel overflowed by hand-off call if there is no unreserved and unused channel. This mechanism of calculation of the number of reserved channel and CAC algorithm is expected to increase channel utilization rate, and can be applied to media-based QoS provision in cellular mobile communications.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.2
• /
• pp.283-294
• /
• 1996

To operate the automatic devices of manufacturing process more effectively and to solve the needs of the resource sharing, network technology is applied to the unit control devices located in common manufacturing zone and operated by connecting them. This paper introduces deign and test operation of cell system for the management of multivendor PLC by applying to wall paper process based on the manufacturing standardization of CIM. The analysis of designed multivendor PLC group is performed by selecting the parameters such as variation of data packet size and node number of PLC ladder logic program and variation by analyzing the corresponding variation values of token rotation time and waiting time for the system operation. For the method of the analysis,the equation is considering the overhead such as indicated packet service time and transmission safety margin for PLC network connection in M/G/1 queue model,and it is applied to the cell system and PLC group manage-ment for operation .Through the experiment,it is found that the realtime processing is possible with expanded and better result than the resuit obtained by Jayasumana.Browaka with PLC scan time considered,response lower limit of 10-20 msec. data packet size not more than 50 bytes.and the number of nodes less than 40.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.613-627
• /
• 2004

In this paper, we propose an Aggregate Fairness Maker (ARM) required for an Edge router to improve fairness of throughput among the flows of Assured Service in DiffServ with different round trip time (RTT) and we propose a user flow Three Color Marker (uf-TCM) as a flow marker that marks packets from the flow as green, yellow, or red. A yellow packet is the packet that consumes loss token in uf-TCM as well as that is demoted green packet in AM due to disobey the aggregate traffic profile. The proposed AFH promotes yellow packet to green packet or demotes green packet to yellow packet through the fair method without per-flow management, and it improves the feirness of throughput among the flows as well as link utilization. A yellow packet and a red packet have the same drop precedence at Core Router in our scheme. So we can use the RIO buffer management scheme. We evaluated the performance of our proposed AFM and the REDP Marker that was proposed to improve fairness without per-flow management. Simulation results show that, compared with the REDP marker, proposed AFM can improve performance of throughput fairness among the flows with different RTT and link utilization under the over-provisioning, exact-provisioning, and under-provisioning network environments at Multiple DiffServ domains as well as at Single DiffServ domain.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.453-462
• /
• 2009

Studies on software plagiarism detection, prevention and judgement have become widespread due to the growing of interest and importance for the protection and authentication of software intellectual property. Many previous studies focused on comparing all pairs of submitted codes by using attribute counting, token pattern, program parse tree, and similarity measuring algorithm. It is important to provide a clear-cut model for distinguishing plagiarism and collaboration. This paper proposes a source code clustering algorithm using a probability model on extreme value distribution. First, we propose an asymmetric distance measure pdist($P_a$, $P_b$) to measure the similarity of $P_a$ and $P_b$ Then, we construct the Plagiarism Direction Graph (PDG) for a given program set using pdist($P_a$, $P_b$) as edge weights. And, we transform the PDG into a Gumbel Distance Graph (GDG) model, since we found that the pdist($P_a$, $P_b$) score distribution is similar to a well-known Gumbel distribution. Second, we newly define pseudo-plagiarism which is a sort of virtual plagiarism forced by a very strong functional requirement in the specification. We conducted experiments with 18 groups of programs (more than 700 source codes) collected from the ICPC (International Collegiate Programming Contest) and KOI (Korean Olympiad for Informatics) programming contests. The experiments showed that most plagiarized codes could be detected with high sensitivity and that our algorithm successfully separated real plagiarism from pseudo plagiarism.