• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.107-109
• /
• 2022

This paper proposes a new security system to detect cyber-attacks based on message authentication in a in-vehicle network. In the in-vehicle network, when a sending node transmits messages in a broadcast manner, it only uses a message identifier, rather than a node's identifier. It leads to a problem not identifying the source. In the proposed system, the sending node generates a message authentication code (MAC) using a cryptographic hash function to the control data and transmits it with the control data. When generating the MAC for each message, a multidimensional chaotic map is applied to increase the randomness of the result. The receiving node compares its MAC generated from the control data in the received message with the MAC of the received message to detect whether the message transmitted from the sending node is forged or not. We evaluate the performance of the proposed system by using CANoe and CAPL (Communication Access Programming Language). Our system shows a 100% of detection rate against cyber-attacks injected.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2348-2365
• /
• 2018

QR codes as public patent are widely used to acquire the information in various fields. However, it faces security problem when delivering the privacy message by QR code. To overcome this weakness, we propose a secret hiding scheme by improving exploiting modification direction to protect the private message in QR code. The secret messages will be converted into octal digit stream and concealed to the cover QR code by overwriting the cover QR code public message bits. And the private messages can be faithfully decoded using the extraction function. In our secret hiding scheme, the QR code public message still can be fully decoded publicly from the marked QR codes via any standard QR Code reader, which helps to reduce attackers' curiosity. Experiments show that the proposed scheme is feasible, with high secret payload, high security protection level, and resistant to common image post-processing attacks.

• International Commerce and Information Review
• /
• v.12 no.4
• /
• pp.405-427
• /
• 2010

This legal study is to compare the Electronic Transactions Act in Thailand(hereinafter 'ETA') with mainly other countries electronic transactions acts, such as UNCITRAL MLEC, UECIC, VETA, UCITA and Korea' Electronic Transactions Act The ETA is consisted of 6 chapters which included preamble and definitions. Each chapter's main point as follows. Preamble is related to the name, time of legal effect, scope and definitions. Chapter 1 is not only general principles of electronic transactions, required restriction in addition to specify the limit of application, documentation, evidential weight in reference to the data message, but also the conditions of offer and acceptance through data message, time and place of dispatch and receipt of data message, certification between origination and addressee. According to media-neutrality and the effectiveness security requirement of data message under the information system, legal certification is related to the exchange's declaration of intention, define about origination-addressee of data message. Chapter 2 is composed to provide expressly about the effectiveness security in electronic signature. Those contents are to compare the MLEC, UECIC and Electronic Transactions Act in Korea. Chapter 3 is related to legal definitions that present legal requirement about service relating electronic transaction which contents accept domestic law, the adequate requirement as eligibility, satisfied matter, self-reliance ratio of finance and other detail standard Chapter 4 is deal with the transaction which are public sector and those application requirements. And also this chapter are composed regulations about direct-indirect purpose of Thailand domestic electronic government.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4B
• /
• pp.278-287
• /
• 2012

In this paper, we propose an allocation scheme for variable message packings to increase efficiency of military operation using Link-16 which is well-known for tactical data link by delivering imagery information rapidly. We propose a variable message packing scheme using COC waveform to support variable data rate under some coverage limitation. Variety of message packing makes Link-16 vary transmission rate appropriately for tactical environment. We also propose a allocation scheme to assign message packing to time slot properly. Finally we verify the performance and superiority of proposed ideas by simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.1003-1019
• /
• 2019

Threshold ring signature scheme enables any t entities from N ring members to spontaneously generate a publicly verifiable t-out-of-N signature anonymously. The verifier is convinced that the signature is indeed generated by at least t users from the claimed group, but he cannot tell them apart. Threshold ring signatures are significant for ad-hoc groups such as mobile ad-hoc networks. Based on the lattice-based ring signature proposed by Melchor et al. at AFRICRYPT'13, this work presents a lattice-based threshold ring signature scheme, employing the technique of message block sharing proposed by Choi and Kim. Besides, in order to avoid the system parameter setup problems, we proposed a message processing technique called "pad-then-permute", to pre-process the message before blocking the message, thus making the threshold ring signature scheme more flexible. Our threshold ring signature scheme has several advantages: inherits the quantum immunity from the lattice structure; has considerably short signature and almost no signature size increase with the threshold value; provable to be correct, efficient, indistinguishable source hiding, and unforgeable.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.4
• /
• pp.453-465
• /
• 1995

RPC(Remote Procedure Call) has been studied for programmer to easily write distributed program of little bit higher efficiency and reliability. In this study, fault-tolerant remote procedure call for hardware failures is proposed. Fault-tolerance is supplied by replicated procedures with node group, so called chain, and copies along chains are linearly ordered. Calls for procedure are sent to primary copy along chains, and other copies are propagated internally. If failures happen, first copy in faultless chain returns the result to the caller, Especially, in this study processing of redundant call message and result message, while using limited ack message, are avoided. This method supplies efficient and reliable fault-tolerance compared with existing remote procedure call.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.5
• /
• pp.1089-1094
• /
• 2003

Recently, Software development method supported CBD is applied with many concern and is researched with part of application and composition based-on architecture effectively use it. Effectively, C2 architecture has been concern with the point of component composition method based-on message driven for supported GUI. But, In case of classified sequence in component and method call method in server component, component must be modified to apply it. Thus, In this paper, Message handling part with a part of C2 architecture change is locate in the message neither component not connector. So, Although method call method it can be composit and operate component for support Plug-and-Play without modification. Also, it's possible the more flexible message handling with parallel composition of component between message without classified sequence.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5B
• /
• pp.257-269
• /
• 2007

This paper proposes a novel method to perform a quantitative analysis of message complexity and applies this method in comparing the message complexity among the mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs). To obtain the upper bound of the message complexity of the protocols, the O-notation of a MANET group of N nodes has been applied. The message complexity of the single node joining case in Strong DAD, Weak DAD with proactive routing protocols (WDP), Weak DAD with on-demand routing protocols (WDO), and MANETconf has been derived as n(mO(N)+O(t)), n(O(N)+O(t)), n(O(N)+2O(t)), and nO((t+1)N)+O(N)+O(2) respectively. In order to verify the bounds, analytical simulations that quantify the message complexity of the address autoconfiguration process based on the different coflict probabilities are conducted.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.2
• /
• pp.257-262
• /
• 2001

A new WDM-based protocol for scheduling a variable-length message is proposed in this paper Two control channels, reservation slot and control slot, are used to coordinate transmission and diminish the collisions of packet to minimize the across delay. When an idle control slot is available, control packet is transmitted on that slot and message is transferred. And the node continues to transmit its control packet through the corresponding slot every cycle, until the message is completely transmitted. If any control slot is not available, the node schedules the transmission time of message in earliest available time using reservation slots. The proposed scheduling algorithm shows better performance and lower access delay.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.4
• /
• pp.86-94
• /
• 2012

VANETs can provide traffic warring service to help drivers drive safely based on the information of the traffic condition. The driver can drive safely through the warning service information provided by the VANET and know the traffic condition exactly more than through only the sight of driver. In this paper we suggest a new mechanism of updating the table to broadcast the message more rapidly based on the table driven method as the way of sending the emergency message in the VANETs. When updating the table, nodes sends only based on the message transmission success rate. In the result of simulation we could find that the suggested mechanism would reduce the delay time of the emergency message broadcast compared to the existing mechanism.