• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.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 the Korea Institute of Information Security & Cryptology
• /
• v.20 no.6
• /
• pp.147-155
• /
• 2010

It has been widely addressed that static analysis techniques can play important role in identifying potential security vulnerability reside in source code. This paper proposes the design and application of security metrics that use both vulnerability information extracted from the static analysis, and significant factors of information that software handles. The security metrics are useful for both developers and evaluators in that the metrics help them identity source code vulnerability in early stage of development. By effectively utilizing the security metrics, evaluators can check the level of source code security, and confirm the final code depending on the characteristics of the source code and the security level of information required.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.3
• /
• pp.87-96
• /
• 2014

Hackers try to achieve their purpose in a variety of ways, such as operating own website and hacking a website. Hackers seize a large amount of private information after they have made a zombie PC by using malicious code to upload the website and it would be used another hacking. Almost detection technique is the use Snort rule. When unknown code and the patterns in IDS/IPS devices are matching on network, it detects unknown code as malicious code. However, if unknown code is not matching, unknown code would be normal and it would attack system. Hackers try to find patterns and make shellcode to avoid patterns. So, new method is needed to detect that kinds of shellcode. In this paper, we proposed a noble method to detect the shellcode by using Shannon's information entropy.

• Journal of the Korea Convergence Society
• /
• v.12 no.3
• /
• pp.53-59
• /
• 2021

When using Medical Information Retrieval services, a typical retrieval method is to use the Anatomic Therapyutic Chemical Classification (ATC) code. Traditional ATC code-based medical information retrieval is very useful for single ingredient product retrieval with single ingredient. However, in the case of complex, retrieval errors often occur. The cause of this problem is that ATC code-based retrieval proceeds by pattern matching ATC code.In this work, we design the mapping scheme based on ATC code by analyzing the requirement scenarios for retrieval based on main ingredient in ATC code-based retrieval. the mapping scheme based on ATC is a schema that stores the ATC code of the complex and all the ATC code of the single agent included in the complex. ATC code-based retrieval using this schema retrieves a complex as ingredient of a single ingredient product, thus having higher accuracy than existing methods. the mapping scheme based on ATC is expected to increase the efficiency of doctors' prescription of patients and increase the accuracy of drug safety use services.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.2
• /
• pp.1-10
• /
• 2015

As programs get more complicated and they are developed by various hands, the possibility that there are program bugs in the code has been increasing. And developers usually run unit tests to find these problems in the code. Besides, the developers are at the pain of getting stability of the code when they have to modify a code very often for clients requirements. In the methodlogy of TDD(Test Driven Development), developers write a unit test code first, and then write a program code for passing the unit test. The unit test must include the boundary condition test the reason why the possibility of occurring the bugs is very high. When failed to pass the test because of the value of a function is incorrect, not existed, out of the range or not matched etc, the program code will return the error code or occur the exception. In the document, the system is designed and implemented in order to insert the generated code automatically or suggest it to the developer, when the boundary condition test is failed. In conclusion, it is possible that the developer will get the code stability by searching the code and checking the code to be omitted automatically through this system.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.3
• /
• pp.356-363
• /
• 2000

Java programming language is designed to run effectively on internet and distributed network environments. However, because it has a deficit to be executed by the interpreter method on each platform, to execute Java programs efficiently the code generation system which transforms Bytecode into SPARC code as target machine code must be developed. In this paper, we implement a code generation system which translates Bytecode into SPARC code using the retargetable code generating techniques. For the sake of code expander, we wrote a Bytecode table describing a rule of SPARC code generation from Bytecode, and implemented the information extractor transforming Bytecode to suitable form during expanding of source code from class file. The information extractor determines constant pool entry of each Bytecode instruction operand and then the code expander translates the Bytecode into SPARC code accoring to the Bytecode table. Also, the retargetable code generation system can be systematically reconfigured to generate code for a variety of distinct target computers.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.9
• /
• pp.1227-1233
• /
• 2021

QR Code has been used in various forms such as simple business cards and URLs. Recently, the influence of Corona 19 Fundemik has led to the use of QR Codes to track travel routes through visits and entry / exit records, and QR Code usage has skyrocketed. In this way, most people have come to use it in the masses and are constantly under threat. In the case of QR Code, you do not know what you are doing until you execute it. Therefore, if you undoubtedly execute a QR Code with a malicious URL inserted, you will be directly exposed to security threats. Therefore, this paper provides a cloud-based malware QR Code detection system that can make a normal connection only when there is no abnormality after determining whether it is a malicious QR Code when scanning the QR Code.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.3
• /
• pp.122-130
• /
• 2009

The paper presents an algorithm which uses code vectors to represent comer geometry information for searching the similar images from a database. The comers have been extracted by finding the intersections of the detected lines found using Hough transform. Taking the comer as the center coordinate, the angles of the intersecting lines are determined and are represented using code vectors. A code book has been used to code each comer geometry information and indexes to the code book are generated. For similarity measurement, the histogram of the code book indexes is used. This result in a significant small size feature matrix compared to the algorithms using color features. Experimental results show that use of code vectors is computationally efficient in similarity measurement and the comers being noise invariant produce good results in noisy environments.

• Journal of information and communication convergence engineering
• /
• v.5 no.3
• /
• pp.181-184
• /
• 2007

In this paper, a CSSMA/AI MAC protocol in packet CDMA network is presented. The main features of this protocol are the code status sensing and reservation for reducing the packet collision. The base station broadcasts the code status on a frame-by-frame basis just before the beginning of each preamble transmission, and the mobile station transmits a preamble for reserving a code based on the received code status. After having transmitted the preamble, the mobile station listens to the downlink of the selected code and waits the base station reply. If this reply indicates that the code has been correctly acquired, it continues the packet transmission for the rest of the frame. If there are other packets waiting for transmission, the base station broadcasts the status of the code as reserved, and the mobile station transmits a packet on a reserved code for the successive frames.

• The KIPS Transactions:PartD
• /
• v.9D no.1
• /
• pp.161-166
• /
• 2002

The existing method in PN code acquisition process have a problem in PN code acquisition time because PN code searching is accomplished in one epoch. In this paper, we propose algorithm that can reduce PN code acquisition time because PN code searching is accomplished in each other two epoches. The designed ASIC chip using proposed algorithm confirmed that the area (the number of gates) increase more than existing method in PN code acquisition, but the performance of PN code acquisition is better than existing method.