• Journal of Sensor Science and Technology
• /
• v.29 no.2
• /
• pp.75-81
• /
• 2020

We introduce a new visible light communication (VLC) method in which three-level return-to-zero (RZ) modulation is used for flicker-free transmission. In the VLC transmitter, the three-level RZ modulation ensures that the average optical power is constant; thus, a flicker-free light-emitting diode (LED) light is achieved. In the VLC receiver, a resistor-capacitor high-pass filter is used for generating spike signals, which are used for data recovery while eliminating the 120 Hz optical noise from adjacent lighting lamps. In transmission experiments, we applied this method for wireless transmission of an air quality sensor message using the visible light of an LED array. This configuration is useful for the construction of indoor wireless sensor networks for air pollution monitoring using LED lights.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.824-827
• /
• 2003

With a rapid development of Information Telecommunication technique, network communication environment has been greatly improved. People come to feel more convinient to purchase products through Internet. Accordingly, various kinds of electronic payment systems have been developed and used. In this paper, we propose an algorithm which not only can associate the broker system with an electronic cash user, but also regenerate all amount of money previously paid using technique such as Meta-Message recovery and a RSA Blind Signature based on discrete logarithm problem.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.917-920
• /
• 2002

PKI(Public Key Infrastructure)의 발달과 함께 전자서명의 필요성 또한 대두되고 있다. 전자서명이 무선 PKI환경에서도 사용되기 위해서는 최소한의 서명 생성 검증 시간과 적은 저장 공간, 적은 대역폭의 사용 등의 조건을 만족해야 한다. 본 논문에서는 서명 생성 검증 시간을 줄여주기 위해서 타원곡선 상의 연산을 이용하고, 대역폭의 감소를 위해서 서명의 크기를 최소화해서 보내줄 수 있는 복원형 전자서명에 대해서 알아볼 것이다.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.4 no.3
• /
• pp.103-111
• /
• 2009

Software update has been regarded as one of fundamental functions in wireless sensor networks. It can disseminate a delta-image between a current software image operating on a sensor node and its new image in order to reduce an update image(transmission data) size, resultantly saving energy. In addition, code-banking capability of micro-controllers can decrease the update image size. In order to maximize the efficiency of the software update, the proposed scheme exploits both the delta-image and the code-banking at the same time. Besides, it additionally delivers a recovery delta-image to properly handle abnormal conditions, such as message corruptions and unexpected power-off during the update.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.4
• /
• pp.456-463
• /
• 1999

chaum[10]이 제시한 은닉 서명은 서명자의 신분과 메시지 내용에 대해 어떠한 관련정보도 유출하지 않기 때문에 익명성을 필요로 하는 전자 화폐 시스템에 사용되고 있다. 그러나 완전한 익명성은 화폐 인출에서의 연관성을 은닉하고 화폐에 대한 이중 사용이 가능하기 때문에 악용될 수 있다. 따라서 필요로 하는 경우 특정 신회 센터가 메시지에 대해 공개 검증할수 있는 과정이 제공되어야한다. 본 연구에서는 메시지 복원 기능을 제공하는 개선된 공정 은닉 서명 기법을 제시한다. Horster 기반 메타 -Elgamal 기법[12]을 분석하여 메시지 복원 기능을 제공하는 은닉 서명 모델을 고찰한다. 또한 감지 불가 전송 방식의 특성을 사용하여 신뢰 센터에 의한 공정 검증 및 확인 기능을 제공하는 공정 은닉 서명 방식을 제안한다. 본 연구에서 제시하는 기법은 다중 서명 기법으로 발전시킬수 있으며 다양한 전자 화폐 시스템에 적용가능하다.

• Convergence Security Journal
• /
• v.18 no.2
• /
• pp.25-32
• /
• 2018

As the use of smartphones become more common, the communication via instant messenger becomes natural. However, it is important to secure the relevant information promptly since the chat room between participants can be used as a space for a criminal conspiracy, and crime-related contents can be stored and deleted easily on smartphones. Therefore, this study aims to identify the available data and to use it as proof by comparing and analyzing the instant messengers with high usage rate.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.05a
• /
• pp.82-83
• /
• 2022

Ad-hoc On-demand Distance Vector (AODV), is one of well-designed routing protocols in mobile ad hoc networks. It supports the functionality of node mobility modules through multiple control messages to create and maintain paths for data transfer. Even though a number of studies have been conducted to achieve rapid discovery of paths across the network, but few have focused on impact of control messages. This paper proposes a method to adjust the transmission time of messages used in path recovery according to their individual characteristics. Simulation results show the improved performance of the proposed algorithm rather than traditional AODV routing protocol.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.3
• /
• pp.397-403
• /
• 2020

With the convenience of real-time conversation, multimedia file and contact sharing services, most people use instant messenger, and its usage time is increasing. Because the messengers contain a lot of user behavior information data, in the digital forensic investigation, they can be very useful evidence to identify user behavior. However, some of useful data can be difficult to acquire or recognize because they are encrypted or deleted. Thus, in order to use the messenger data as evidence, the study of message decryption process and message recovery is essential. In this paper, we analyze the database encryption process of the instant messenger, MalangMalang Talkafe, and propose the method to decrypt it. In addition, we propose the methods to identify the deleted messages and recover from the volatile memory area.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.4
• /
• pp.169-176
• /
• 2019

Wireless sensor networks are used to monitor and control areas in a variety of military and civilian areas such as battlefield surveillance, intrusion detection, disaster recovery, biological detection, and environmental monitoring. Since the sensor nodes are randomly placed in the area of interest, separation of the sensor network area may occur due to environmental obstacles or a sensor may not exist in some areas. Also, in the situation where the sensor node is placed in a non-relocatable place, some node may exhaust energy or physical hole of the sensor node may cause coverage hole. Coverage holes can affect the performance of the entire sensor network, such as reducing data reliability, changing network topologies, disconnecting data links, and degrading transmission load. It is possible to solve the problem that occurs in the coverage hole by finding a coverage hole in the sensor network and further arranging a new sensor node in the detected coverage hole. The existing coverage hole detection technique is based on the location of the sensor node, but it is inefficient to mount the GPS on the sensor node having limited resources, and performing other location information processing causes a lot of message transmission overhead. In this paper, we propose an Adjacent Matrix-based Hole Coverage Discovery(AMHCD) scheme based on connectivity of neighboring nodes. The method searches for whether the connectivity of the neighboring nodes constitutes a closed shape based on the adjacent matrix, and determines whether the node is an internal node or a boundary node. Therefore, the message overhead for the location information strokes does not occur and can be applied irrespective of the position information error.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.4
• /
• pp.43-50
• /
• 2010

Vehicle-to-Vehicle (V2V) is a special type of vehicle ad-hoc network (VANET), and known as a solution to provide communication among vehicles and reduce vehicle accidents. Geographical routing protocols as Greedy Perimeter Sateless Routing (GPSR) are very suitable for the V2V communication due to special characters of highway and device for vehicles. However, the GPSR has problem that appears local maximum by some stale neighbor nodes in the greedy mode of the GPSR. It can lose transmission data in recovery mode, even if the problem is can be solved by the recovery mode of the GPSR. We therefore propose a Greedy Perimeter Reliable Routing (GPRR), can provide more reliable data transmission, to resolve the GPSR problem in the V2V environment. Simulation results using ns-2 shown that the GPRR reveals much better performance than the GPSR by remarkably reducing the local maximum rate in the greedy mode.