• Journal of Information Processing Systems
• /
• 제17권2호
• /
• pp.253-270
• /
• 2021

In January 2013, the National Institute of Standards and Technology (NIST) announced the CAESAR (Competition for Authenticated Encryption: Security, Applicability, and Robustness) contest to identify authenticated ciphers that are suitable for a wide range of applications. A total of 57 submissions made it into the first round of the competition out of which 6 were announced as winners in March 2019. In the process of the competition, NIST realized that most of the authenticated ciphers submitted were not suitable for resource-constrained devices used as end nodes in the Internet-of-Things (IoT) platform. For that matter, the NIST Lightweight Cryptography Standardization Process was set up to identify authenticated encryption and hashing algorithms for IoT devices. The call for submissions was initiated in 2018 and in April 2019, 56 submissions made it into the first round of the competition. In August 2019, 32 out of the 56 submissions were selected for the second round which is due to end in the year 2021. This work surveys the 32 authenticated encryption schemes that made it into the second round of the NIST lightweight cryptography standardization process. The paper presents an easy-to-understand comparative overview of the recommended parameters, primitives, mode of operation, features, security parameter, and hardware/software performance of the 32 candidate algorithms. The paper goes further by discussing the challenges of the Lightweight Cryptography Standardization Process and provides some suitable recommendations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권3호
• /
• pp.1231-1245
• /
• 2015

People have transferred their business model from traditional commerce to e-commerce in recent decades. Both shopping and payment can be completed through the Internet and bring convenience to consumers and business opportunities to industry. These trade techniques are mostly set up based on the Secure Sockets Layer (SSL). SSL provides the security for transaction information and is easy to set up, which makes it is widely accepted by individuals. Although attackers cannot obtain the real content even when the transferred information is intercepted, still there is risk for online trade. For example, it is impossible to prevent credit card information from being stolen by virtual merchant. Therefore, we propose a new mechanism to solve such security problem. We make use of the disposable dynamic security code (DSC) to replace traditional card security code. So even attackers get DSC for that round of transaction, they cannot use it for the next time. Besides, we apply visual secret sharing techniques to transfer the DSC, so that interceptors cannot retrieve the real DSC even for one round of trade. This way, we can improve security of credit card transaction and reliability of online business. The experiments results validate the applicability and efficiency of the proposed mechanism.

• 융합신호처리학회논문지
• /
• 제24권2호
• /
• pp.112-118
• /
• 2023

IoT 기술은 인터넷과 사물이 연결되고, 사물 스스로가 데이터를 분석, 판단하여 실세계와 가상세계를 실시간으로 상호 연결하는 단계로 발전하고 있다. 이러한 IoT 기술은 센서, 액추에이터, 장치, 네트워크로 구성되어 다양한 분야에 적용되고 있으며, IoT 디바이스와 애플리케이션 수가 증가함에 따라 데이터 트래픽도 증가하고 있다. 본 논문에서는 IoT 환경에서의 IoT 디바이스와 브로커 간 성능 분석을 위해 IoT 디바이스에서 센서 데이터를 수집하고 MQTT 프로토콜을 통해 MQTT 브로커에 전달하는 시스템을 구현하였다. MQTT 기반 RTT 측정과 IoT 디바이스와 브로커 간 메시지 전송 시간을 측정하는 실험을 수행한 결과 패킷 손실은 발생하지 않았으며, 전파 지연이 RTT에 영향을 주는 것으로 실험을 통해 알 수 있었다.

• 인터넷정보학회논문지
• /
• 제1권2호
• /
• pp.38-48
• /
• 2000

최근 전자상거래의 규모는 점점 확대되어 나아가면서 가상공간에서의 상거래에 있어 여러 가지 문제점이 발생된다. 따라서 본 연구에서는 인터넷의 확산과 아울러 전자상거래에서 현행 제기되는 몇 가지 문제점들을 살펴보고. 주요 문제점들에 관한 국제적 동향과 우리나라의 대응방안을 고찰하고자 한다. 결국, 인터넷라운드의 대응 및 전자상거래 안정적인 성장을 위해서 정부가 주도적으로 규범화 작업등을 통하여 국제적인 수준으로 맞추어 나아가야 할 것이다.

• International Journal of Control, Automation, and Systems
• /
• 제5권3호
• /
• pp.317-323
• /
• 2007

Quality of Service (QoS) in the Internet depends on queuing and sophisticated scheduling in routers. In this paper, we address the issue of managing traffic flows with different priorities. In our reference model, incoming packets are first classified based on their priority, placed into different queues with different capacities, and then multiplexed onto one router link. The fuzzy nature of the information on Internet traffic makes this problem particularly suited to fuzzy methodologies. We propose a new solution that employs a fuzzy inference system to dynamically and efficiently schedule these priority queues. The fuzzy rules are derived to minimize the selected Lyapunov function. Simulation experiments show that the proposed fuzzy scheduling algorithm outperforms the popular Weighted Round Robin (WRR) queue scheduling mechanism.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.652-657
• /
• 2004

As the real-time multimedia applications through Internet increase, the bandwidth available to TCP connections is oppressed by the UDP traffic, result in the performance of overall system is extremely deteriorated. Therefore, developing a new transmission protocol is necessary. The TCP-friendly algorithm is an example meeting this necessity. The TCP-friendly (TFRC) is an UDP-based protocol that controls the transmission rate based on the available round transmission time (RTT) and the packet loss rate (PLR). In the data transmission processing, transmission rate is determined based on the conditions of the previous transmission period. If the one-step ahead predicted values of the control factors are available, the performance will be improved significantly. This paper proposes a prediction model of transmission rate control factors that will be used for the transmission rate control, which improves the performance of the networks. The model developed through this research is predicting one-step ahead variables of RTT and PLR. A multiplayer perceptron neural network is used as the prediction model and Levenberg-Marquardt algorithm is used for the training. The values of RTT and PLR were collected using TFRC protocol in the real system. The obtained prediction model is validated using new data set and the results show that the obtained model predicts the factors accurately.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권11호
• /
• pp.2052-2067
• /
• 2011

Complementary trees are two spanning trees rooted at the sink node satisfying that any source node's two paths to the sink node on the two trees are node-disjoint. Complementary trees routing strategy is a special node-disjoint multi-path routing approach. Several complementary trees routing algorithms have been proposed, in which path discovery methods based on depth first search (DFS) or Dijkstra's algorithm are used to find a path for augmentation in each round of path augmentation step. In this paper, a novel path discovery method based on multi-tree-growing (MTG) is presented for the first time to our knowledge. Based on this path discovery method, a complementary trees routing algorithm is developed with objectives of low average path length on both spanning trees and low complexity. Measures are employed in our complementary trees routing algorithm to add a path with nodes near to the sink node in each round of path augmentation step. The simulation results demonstrate that our complementary trees routing algorithm can achieve low average path length on both spanning trees with low running time, suitable for wireless sensor networks in industrial scenarios.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권1호
• /
• pp.79-95
• /
• 2016

In order to improve the Quality-of-Service (QoS) of latency sensitive applications in next-generation cellular networks, multi-path is adopted to transmit packet stream in real-time to achieve high-quality video transmission in heterogeneous wireless networks. However, multi-path also introduces two important challenges: out-of-order issue and reordering delay. In this paper, we propose a new architecture based on Software Defined Network (SDN) for flow aggregation and flow splitting, and then design a Multiple Access Radio Scheduling (MARS) scheme based on relative Round-Trip Time (RTT) measurement. The QoS metrics including end-to-end delay, throughput and the packet out-of-order problem at the receiver have been investigated using the extensive simulation experiments. The performance results show that this SDN architecture coupled with the proposed MARS scheme can reduce the end-to-end delay and the reordering delay time caused by packet out-of-order as well as achieve a better throughput than the existing SMOS and Round-Robin algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권7호
• /
• pp.1624-1637
• /
• 2013

In RFID systems, one important issue is how to effectively address tag collision, which occurs when multiple tags reply simultaneously to a reader, so that all the tags are correctly identified. However, most existing anti-collision protocols assume isotropic collisions where a reader cannot detect any of the tags from the collided signals. In practice, this assumption turns out to be too pessimistic since the capture effect may take place, in which the reader considers the strongest signal as a successful transmission and the others as interference. In this case, the reader disregards the other collided tags, and in turn, fails to read the tag(s) with weaker signal(s). In this paper, we propose a capture effect-aware anti-collision protocol, called Multi-Round Collision Tree (MRCT) protocol, which efficiently identifies the tags in real RFID environments. MRCT deals with the capture effect as well as channel error by employing a multi-round based identification algorithm. We also analyze the performance of MRCT in terms of the number of slots required for identifying all tags. The simulation results show that MRCT significantly outperforms the existing protocol especially in a practical environment where the capture effect occurs.

• 한국인터넷방송통신학회논문지
• /
• 제21권2호
• /
• pp.1-6
• /
• 2021

본 논문에서는 C# 언어를 이용하여 CCTV 영상보안 시스템의 효율적인 구현을 제안한다. 제안한 방법에서는 AES 알고리듬의 각 라운드 과정에서 요구되는 지연시간의 최소화를 위한 합성체 기반의 S-Box를 설계하고, 이를 기반으로 한 영상보안 시스템을 GF(((22)2)2) 상에서 구현한다. 또한, 메모리 공간의 최소화를 위해서 각 라운드 변환 및 키 스케쥴링 과정에서 필요한 S-Box를 공동으로 사용하도록 설계한다. 성능평가를 통하여 기존의 방법 보다 제안한 방법이 보다 효율적임을 확인하였다. 제안한 CCTV 영상보안 시스템은 Visual Studio 2010을 사용하여 C# 언어로 구현하였다.