• 전기전자학회논문지
• /
• 제26권3호
• /
• pp.506-509
• /
• 2022

비밀 공유 기법에서는 비밀 정보가 사용자들에게 분산되어 저장되고, 특정 허가된 사용자의 부분 집합으로부터만 비밀이 재합성될 수 있어야 한다. 이를 위해서는 서로 다른 부호어들 사이의 정보가 종속되지 않아야 한다. 극소 부호는 선형 블록 부호의 일종으로서 이러한 비밀 정보들이 상호 종속되지 않게 분산하는 역할을 한다. 본 논문에서는 극소 부호의 새로운 확장 기법을 제시한다. 임의의 벡터와 극소 부호의 곱을 통해 새로운 길이와 해밍 무게를 가지는 새로운 극소 부호가 생성된다. 이를 통해 기존에 알려지지 않은 파라미터를 가지는 극소 부호들을 제공할 수 있다.

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

A data hiding scheme in HTML files is presented in this paper. Web pages are a very popular medium for broadcasting information and knowledge nowadays, and web pages are a good way to achieve the goal of secret message delivery because the different HTML coding codes will render the same screen in any of the popular browsers. The proposed method utilizes the HTML special space codes and sentence segmentation to conceal secret messages into a HTML file. The experimental results show that the stego HTML file generated by the proposed method is imperceptible. Also, the proposed method can conceal one more secret bit in every between-word location.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권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.

• 충청수학회지
• /
• 제33권1호
• /
• pp.43-56
• /
• 2020

Recently, linear codes constructed from defining sets have been studied widely and determined their complete weight enumerators and weight enumerators. In this paper, we obtain complete weight enumerators of linear codes and weight enumerators of linear codes. These codes have at most three weight linear codes. As application, we show that these codes can be used in secret sharing schemes and authentication codes.

• International journal of advanced smart convergence
• /
• 제5권1호
• /
• pp.23-29
• /
• 2016

The information is to be considered as important part of any network, the communication nodes within network can able to communicate and transmit information by the means of configured LAN/WAN, or/and using internet technology. Thus, vast enhancement has been made in- exchanging of information over transmission media, this should be beneficial in various disciplines of modern client/server applications but at other side, several massive vulnerabilities have been directly/in-directly associated with them. To resolve the security issues, a security mechanism is proposed which hide the sensitive information of images before transmitting to networks. Random size image samples have used and encrypted to protect them from unauthorized entities. The encryption mechanism manipulates the sample images, and corresponding secret codes are generated which help to protect the images from adversaries. To provide an indestructible security mechanism, cryptography algorithms are deployed and considered as best solutions to keep the secret information of images.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권11호
• /
• pp.4443-4462
• /
• 2020

This paper proposes a new framework of reversible data hiding scheme for absolute moment truncation coding (AMBTC) compressed images. AMBTC-based RDH can be applied to optical remote sensing (ORS) image transmission, which achieves target region preservation and image compression simultaneously. Existing methods can be concluded as two types. In type I schemes, stego codes mimic the original AMBTC format where no file bloat occurs, yet the carried secret data is limited. Type II schemes utilize predication errors to recode quantity levels of AMBTC codes which achieves significant increase in embedding capacity. However, such recoding causes bloat inside stego format, which is not appropriate in mentioned ORS transmission. The proposed method is a novel type I RDH method which prevents bloat inside AMBTC stego codes with significant improvement in embedding capacity. The AMBTC compressed trios are grouped into two categories according to a given threshold. In smooth trio, the modified low quantity level is constructed by concatenating Huffman codes and secret bits. The reversible contrast mapping (RCM) is performed to complex trios for data embedment. Experiments show that the proposed scheme provides highest payload compared with existing type I methods. Meanwhile, no expansion inside stego codes is caused.

• 대한수학회보
• /
• 제55권3호
• /
• pp.717-734
• /
• 2018

By choosing defining set properly, several classes of linear codes with a few weights over the finite field ${\mathbb{F}}_p$ are constructed for an odd prime p, and the complete weight enumerators of these classes of codes are determined.

• 정보보호학회지
• /
• 제2권3호
• /
• pp.42-57
• /
• 1992

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권10호
• /
• pp.5144-5160
• /
• 2019

Secret sharing is an effective way of protecting secret messages. However, the traditional secret sharing schemes are considered meaningless due to malicious people attention which might raise risks. To overcome the weakness, this paper presents an effective secret sharing scheme with the functionality of cheater identification, based on meaningful QR code. The secret message will be split and concealed in the padding region of cover QR codes with the assistance of Latin square and it can be completely restored when all the involved participants cooperate. The concealing strategy exploits the characteristic of Reed-Solomon (RS) code to ensure the strong robustness of generated QR code pseudo-shares. The meaningful QR code pseudo-shares help to reduce the curious of unrelated persons. Some experiments were done to evaluate the performance of proposed scheme. The results showed that the proposed scheme is feasible, efficient and secure compared to the other existing schemes. It also achieves a higher secret payload and maintains stronger robustness.

• Journal of Communications and Networks
• /
• 제11권6호
• /
• pp.538-543
• /
• 2009

A wiretap channel I is one of the channel models that was proved to achieve unconditional security. However, it has been an open problem in realizing such a channel model in a practical network environment. The paper is committed to solve the open problem by introducing a novel approach for building wiretap channel I in which the eavesdropper sees a binary symmetric channel (BSC) with error probability p while themain channel is error free. By taking advantage of the feedback and low density parity check (LDPC) codes, our scheme adds randomness to the feedback signals from the destination for keeping an eavesdropper ignorant; on the other hand, redundancy is added and encoded by the LDPC codes such that a legitimate receiver can correctly receive and decode the signals. With the proposed approach, unconditionallysecure communication can be achieved through interactive communications, in which the legitimate partner can realize the secret information transmission without a pre-shared secret key even if the eavesdropper has better channel from the beginning.