• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.2
• /
• pp.417-429
• /
• 2019

WPA2-PSK uses a 4-way handshake protocol based on a shared secret to establish a secure session between a client and an AP. It has various security problems such as eavesdropping attacks and the secure session establishment process is inefficient because it requires multiple interactions between client and AP. The WPA3 standard has recently been proposed to solve the security problem of WPA2, but it is a small improvement using the same 4-way handshake methodology. OAuth 2.0 token authentication is widely used on the web, which can be used to keep an authenticated state of a client for a long time by using tokens issued to an authenticated client. In this paper, we apply the dual-token based randomized token authentication technology to the Wi-Fi security protocol to achieve an efficient Wi-Fi security protocol by dividing initial authentication and secure session establishment. Once a client is authenticated and equipped with dual tokens issued by AP, it can establish secure session using them quickly with one message exchange over a non-secure channel.

• International Journal of Contents
• /
• v.8 no.4
• /
• pp.1-6
• /
• 2012

Mutual Exclusion is one of the most studied topics in distributed systems where processes communicate by asynchronous message passing. It is often necessary for multiple processes at different sites to access a shared resource or data called a critical section (CS) in distributed systems. A number of algorithms have been proposed to solve the mutual exclusion problem in distributed systems. In this paper, we propose the new algorithm which is modified from Garg's algorithm[1] thus works properly in a fault-tolerant system. In our algorithm, after electing the token generator, the elected process generates a new token based on the information of the myreqlist which is kept by every process and the reqdone which is received during election. Consequently, proposed algorithm tolerates any number of process failures and also does even when only one process is alive.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6B
• /
• pp.588-603
• /
• 2003

In this paper, we propose an Aggregate Three Color Marker without per flow management which is required for an Edge router to improve End-to-End QoS of Assured Service in DiffServ. Proposed Aggregate Three Color Marker is used with the Adaptive RIO-DC scheme to achieve the minimum rate guarantee without per flow management. Assuming that the admission control for Assured Service has been performed, proposed Aggregate Three Color Marker measures incoming In-profile traffic rate at the output link of an edge router using a token-bucket with a token rate equal to the sum of contracted rates of admitted flows passing the edge router. If there are token losses from the token bucket, out-of-profile packets are promoted to Yellow packets within the aggregate traffic profile. And yellow packets are demoted to out-of-profile packets at the input link to an Edge router fer the purpose of fairness maintenance. In-profile packets and Yellow packets are processed identically at the RIO-DC buffer management scheme in our proposed method. Simulation results show that through using proposed Aggregate Three Color Marker with the Adaptive RIO-DC scheme, the minimum rate guarantee for Assured Service can be achieved without per flow management at multiple DiffServ domains.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.3
• /
• pp.357-366
• /
• 1994

The IEEE 802.4 token bus has been widely accepted as the standard for factory local area networks. The priority option of the 802.4 standard supports multiple classes of traffic by using a set of timers to control information exchange. The performance of the 802.4 priority mechanism in industrial real time control is examined. A timer assignment technique is presented for such applications. The timers are set to satisfy the worst case access delay requirements of real time control applications. Other applications that are not time constrainted can be supported simultaneously. In fact under certain conditions, such applications can also be guaranteed a minimum bandwidth allocation. Simulation results are used to evaluate the timer assignment and utililization.

• Journal of the Korea Convergence Society
• /
• v.10 no.7
• /
• pp.7-14
• /
• 2019

Users who use smartphone can using knowledge-based authentication, possession-based authentication, biometric-based authentication, and token-based authentication in order to access rights to systems requiring authentication. However, desktop computer users use method only ID and password, which are knowledge-based authentication factors, due to limitations of authentication devices, despite various authentication methods. In this paper, we designed and implemented a raspberry pi based authentication system that provides multiple authentication method of a user's desired type. The implementation system uses knowledge-based authentication, possessive-based authentication, biometric-based authentication, and token-based authentication. The proposed system can provide a security function that can be used by SMEs, which is difficult to hire a security officer due to the economic burden. The implemented system can be used not only for personal use but also for enterprise, and it can be applied to various fields such as finance and game.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.78-87
• /
• 2004

This paper presents deterministic, worst-case analysis of a queueing system whose multiple homogeneous input streams are regulated by the associated leaky buckets and the queueing system that has a single stream regulated by the jumping-window. Queueing delay averaged over all items is used for performance measure, and the worst-case input traffic and the worst-case performance are identified for both queueing systems. For the former queueing system, the analysis explores different phase relations among leaky-bucket token generations. This paper observes how the phase differences among the leaky buckets affect the worst-case queueing performance. Then, this paper relates the worst-case performance of the former queueing system with that of the latter (the single stream case, as in the aggregate streams from many users, whose item arrivals are regulated by one jumping-window). It is shown that the worst-case performance of the latter is identical to that of the former in which all leaky buckets have the same phase and have particular leaky bucket parameters.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.471-482
• /
• 2021

Several code-division multiple access (CDMA)-based interconnect schemes have been recently proposed as alternatives to the conventional time-division multiplexing bus in multicore systems-on-chip. CDMA systems with a dynamic assignment of spreading codewords are particularly attractive because of their potential for higher bandwidth efficiency compared with the systems in which the codewords are statically assigned to processing elements. In this paper, we propose a novel distributed arbitration scheme for dynamic CDMA-bus-based systems, which solves the complexity and scalability issues associated with commonly used centralized arbitration schemes. The proposed arbitration unit is decomposed into multiple simple arbitration elements, which are connected in a ring. The arbitration ring implements a token-passing algorithm, which both resolves destination conflicts and assigns the codewords to processing elements. Simulation results show that the throughput reduction in an optimally configured dynamic CDMA bus due to arbitration-related overheads does not exceed 5%.

• KIPS Transactions on Software and Data Engineering
• /
• v.12 no.9
• /
• pp.419-430
• /
• 2023

Currently, NFTs have no dominant application except for the proof of ownership for digital content, and it also have small liquidity problem, which makes their price difficult to predict. Real estate usually has very high barriers to investment due to its high pricing. Real estate can be converted into NFTs and also divided into small value fungible tokens (FTs), and it can increase the the volume of the investor community due to more liquidity and better accessibility. In this document, we implement and design a system that allows ordinary users can invest on high priced real estate utilizing Black Litterman (BL) model-based Portfolio investment interface. To this end, we target a set of real estates pegged as collateral and issue NFT for the collateral using blockchain. We use oracle to get the current real estate information and to monitor varying real estate prices. After tokenizing real estate into NFTs, we divide the NFTs into easily accessible price FTs, thereby, we can lower prices and provide large liquidity with price volatility limited. In addition, we also implemented BL based asset portfolio interface for effective portfolio composition for investing in multiple of real estates with small investments. Using BL model, investors can fix the asset portfolio. We implemented the whole system using Solidity smart contracts on Flask web framework with public data portals as oracle interfaces.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2834-2851
• /
• 1997

In this paper, a design and implementation of VHDL compiler front-end, aims at supporting the full-set of VHDL '87 & '93 LRM and carring out the preprocessing of VHDL-to-C, is described. The VHDL compiler front-end includes 1)the symbol tree of analyzed data to represent the hierarchy, the scope and visibility, the overloading and homograph, the concurrent multiple stacks in VHDL, 2)the data structure and supportig routies to deal with the objects, the type and subtype, the attribute and operation in VHDL, 3)the analysis of the concurrent/sequential statements, the behavior/structural descriptions, of semantic token and the propagation of symbol & type to improve the registration and retrieval procedure of analyzed data. In the experiments with Validation Suite, the VHDL compiler front-end could support the full-set specification of VHDL LRM '87 & '93; and in the experiments to asses the performance of symantic token for the VHDL hierachy/visibility/concurrency/semantic checking, the improvement of about 20-30% could be achieved.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.249-257
• /
• 2003

Ring networks are very commonly exploited among local area and metropolitan area networks (LAN/MAN), whereas cells or small fixed-size packets are widely used in synchronized ring networks. In this paper, we present an analytical method for evaluating the delay-throughput performance of a MAC protocol with multiple self-tokens in a slotted ring network under uniform traffic. In our analysis, we introduce the stationary probability, which indicates the number of packets in a node. Also, it is assumed that each node has a sufficiently large amount of self-tokens, and a slotted ring has the symmetry. The analytical results with respect to delay-throughput performance have similar values to computer simulated ones. Furthermore, in order to achieve fair access under non-uniform traffic, we propose an adaptive MAC protocol, where the number of self-tokens in a node dynamically varies, based on the number of packets transmitted within a specified period. In the proposed protocol, when the number of packets transmitted by a node within a specified period is larger than a specified threshold, the node decreases the number of self-tokens in a per-node distributed method. That results in creating free slots in the ring, thus all nodes can obtain an equal opportunity to transmit into the ring. Performance results obtained by computer simulation show that our proposed protocol can maintain throughput fairness under non-uniform traffic.