• International Journal of Advanced Culture Technology
• /
• v.10 no.2
• /
• pp.225-232
• /
• 2022

When we drive a vehicle in an IoT environment, there is a problem in that information of car users is collected without permission. The security measures used in the existing wired network environment cannot solve the security problem of cars running in the Internet of Things environment. Information should only be shared with entities that have been given permission to use it. In this paper, we intend to propose a method to prevent the illegal use of vehicle information. The method we propose is to use attribute-based encryption and dynamic threshold encryption. Real-time processing technology and cooperative technology are required to implement our proposed method. That's why we use fog computing's proxy servers to build smart gateways in cars. Proxy servers can collect information in real time and then process large amounts of computation. The performance of our proposed algorithm and system was verified by simulating it using NS2.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.34 no.2
• /
• pp.289-299
• /
• 2024

Blockchains are not efficient for real-time processing because the growing number of transactions and users delays many computations and network communications. This study proposes a cloud proxy server, so that legitimate users can use blockchain as well as reduce network latency. To proceed with a blockchain transaction, the blockchain copy server verifies all transaction-related data, but the cloud proxy server verifies legitimate users with a simple zero-knowledge proof algorithm, enabling efficient blockchain real-time processing. The cloud proxy server can support blockchain anonymity, security, and scalability that can verify legitimate users with the proposed zero-knowledge proof by receiving the registered key pair of the blockchain user. In the proposed research analysis, blockchain-based cloud proxy server reduces network latency compared to previous studies and key processing on cloud proxy servers reduces the cost of key computation compared to previous studies.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.313-320
• /
• 2005

The increasing popularity of multimedia streaming services introduces new challenges in content distribution. Especially, it is important to provide the QoS guarantees as they are increasingly expected to support the multimedia applications. Multimedia streams typically experience the high start-up delay due to the large protocol overhead, the delay, and the loss properties of the wireless networks. The service providers can improve the performance of multimedia streaming by caching the initial segment (prefix) of the popular streams at proxies near the requesting clients. The proxy can initiate transmission to the client while requesting the remainder of the stream from the server. In this paper, we propose the traffic based caching algorithm (TSLRU) to improve the performance of caching proxy. TSLRU classifies the traffic into three types, and improve the performance of caching proxy by reflecting the several elements such as traffic types, recency, frequency, object size when performing the replacement decision. In simulation, TSLRU performs better than the existing schemes in terms of byte hit rate, hit rate, startup latency, and throughput.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.52 no.3
• /
• pp.121-126
• /
• 2003

In this paper, we propose the haptic system for the real-time virtual environment-control, which controls the sense of sight, hearing and touch. In order to maintain the stable haptic system in this study, we apply the proxy force rendering algorithm and the real-time graphic deformation algorithm based on the FEM. The applied proxy algorithm makes the system possible to be more stable and prompt with a virtual object. Moreover, the haptic rendering algorithm is applied to work out a problem that the tactual transaction-period is different from the graphic transaction- period. The graphic deformation algorithm is developed in the real-time using the deformed FEM. To apply the FEM, a deformed material-model is produced and then the graphic deformation with this model is able to force. Consequently, the graphic rendering algorithm is deduced by the real-time calculation and simplification because the purpose of this system is to transact in the real time. Applying this system to the PC, we prove that it is possible to deform the graphics and transact the haptic. Finally we suggest the variable simulation program to show the efficiency of this system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1229-1240
• /
• 1998

In this paper, we provide a design of DAVIC VOD service system with proxy servers which perform caching of video streams. Proxy servers are placed between a service provider system and service consumer systems. They provide video services to consumers on behalf of the service provider, therefore they reduce the loads of service providers and network. The operation of a proxy server depends on whether the requested program is in its storage. If this is the case, the prosy servere takes all the controls, but if the proxy does not have the program, it forwards the service request the proxy server takes all the controls, but if the prosy does not have the program, it forwards the service request to a service provider. While the service provider system provides the program to the consumer, the proxy copies and caches the program. The proxy server executes cache replacement, if necessary. We show by simultion that the LFU is the most efficiency caching replacement algorithm among the typical algorithms such as LRU, LFU, FIFO.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.6
• /
• pp.57-64
• /
• 2010

Due to the limited storage space in video proxy server, it is often required to replace the old video data which is not serviced for long time with the newly requested video. This replacement causes the service delay and increase of network traffic. To circumvent this problem, we propose the an efficient replacement scheme in a video proxy server. In addition, we present a video data management technique for decreasing the number of replacement in video proxy server. For this purpose, we employ a memory in video proxy server. If the video segment which is loaded in memory is requested once again by a different user, this segment is resided in memory. The video in the memory is stored in the video proxy server depending on the consuming pattern by users. The simulation results show that the proposed algorithm performs better than other algorithms in terms of packet hit rate and number of packet replacement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4529-4548
• /
• 2016

DDoS attacks have had a devastating effect on the Internet, which can cause millions of dollars of damage within hours or even minutes. In this paper we propose a practical dynamic defense approach that overcomes the shortage of static defense mechanisms. Our approach employs a group of SDN-based proxy switches to relay data flow between users and servers. By substituting backup proxy switches for attacked ones and reassigning suspect users onto the new proxy switches, innocent users are isolated and saved from malicious attackers through a sequence of remapping process. In order to improve the speed of attacker segregation, we have designed and implemented an efficient greedy algorithm which has been demonstrated to have little influence on legitimate traffic. Simulations, which were then performed with the open source controller Ryu, show that our approach is effective in alleviating DDoS attacks and quarantining the attackers by numerable remapping process. The simulations also demonstrate that our dynamic defense imposes little effect on legitimate users, and the overhead introduced by remapping procedure is acceptable.

• Journal of KIISE
• /
• v.43 no.9
• /
• pp.1052-1059
• /
• 2016

A key role in cloud computing systems that is becoming an issue is implementing a database on untrusted cloud servers requiring the complexity of key management. This study proposes a key management system using Self Proxy Servers to minimize key executions and improve the performance of cloud services by generating Self-Creating Algorithms where the data owner is not directly concerned with related keys when a user sends an encrypted database a query. The Self Proxy Server supports active and autonomous key managements as a distributed server if any trouble should arise from a cloud key server and for an efficient cloud key management. Therefore, the key management system provides secure cloud services by supporting confidentiality of a cloud server database.

• Proceedings of the KIPE Conference
• /
• 2003.07a
• /
• pp.410-414
• /
• 2003

In this paper, the virtual-reality system is tried to developed, which controls not only the sense of sight and hearing but also the sense of touch, In order to develope the sense of touch in this study, the stable tactual transaction-system, based on summing up the basic algorithm and theory, is embodied. The hardware of this system consists of the 6DOF haptic interface, a controller and a driver In the case of the software, the proxy algorithm is applied for the force-transaction and the mopping algorithm is used for graphic transaction. In addition to this, the imaginary-device driver is utilized for controlling the system and manager-class is also included in this system to manage the position-change and the like. Consequently, the proxy algorithm Is applied, which makes the system possible to be more stable and prompt with and imaginary object. Moreover, the impulse-algorithm is applied to work out a problem which the tactual transaction-period is different from the graphic transaction-period.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.991-1000
• /
• 2004

This paper presents an application layer multicast tree constructing algorithm to minimize the average time delay from the sender to end-systems for the effective real-time media delivery. Simultaneously, the proposed algorithm takes into account the computing power and the network condition of each end-system as a control variable and thus avoids the undesirable case that loads are concentrated to only several end-systems. The multicast tree is constructed by clustering technique and modified Dijkstra's algorithm in two steps, i.e. tree among proxy-senders and tree in each cluster. By the experimental results, we show that the proposed algorithm can provide an effective solution.