• Journal of Internet of Things and Convergence
• /
• v.2 no.2
• /
• pp.37-49
• /
• 2016

An IP address is used as a host identifier and a locator to bind hosts and applications to their location in existing Internet. Several protocols are proposed to eliminate this binding. Most of these protocols use IPv6-based host identifiers to maintain compatibility with existing Internet, but these identifiers cannot be handled by standard IPv6 routers because such identifiers are unroutable. Therefore, host identifiers need to be usually converted to locators at hosts, and the standard IPv6 protocol should be modified to interoperate with these protocols. In this paper, we propose a network-based host identifier locator separating scheme in software-defined networking. The proposed scheme separates the underlying network into Host Identity and IP domains in order to directly forward unroutable identifiers. The Host Identity domain operates as an overlaid network over IP domain, and it makes the unroutable identifiers to be routable using distributed hash table based routing strategy. For the evaluation, we compared the proposed scheme with the previous scheme using signaling costs and packet delivery costs. The result shows that the proposed scheme is more suitable in the recent mobile-based environments.

• KIISE Transactions on Computing Practices
• /
• v.21 no.11
• /
• pp.681-688
• /
• 2015

The k nearest neighbor (k-NN) graph construction is an important operation with many web-related applications, including collaborative filtering, similarity search, and many others in data mining and machine learning. Despite its many elegant properties, the brute force k-NN graph construction method has a computational complexity of $O(n^2)$, which is prohibitive for large scale data sets. Thus, (Key, Value)-based distributed framework, MapReduce, is gaining increasingly widespread use in Locality Sensitive Hashing which is efficient for high-dimension and sparse data. Based on the two-stage strategy, we engage the locality sensitive hashing technique to divide users into small subsets, and then calculate similarity between pairs in the small subsets using a brute force method on MapReduce. Specifically, generating a candidate group stage is important since brute-force calculation is performed in the following step. However, existing methods do not prevent large candidate groups. In this paper, we proposed an efficient algorithm for approximate k-NN graph construction by regrouping candidate groups. Experimental results show that our approach is more effective than existing methods in terms of graph accuracy and scan rate.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.261-273
• /
• 2004

Advances in information and communication technologies have been creating new classes of applications in the area of databases. For example, in moving object databases, which track positions of a lot of objects, or stream databases, which process data streams from a lot of sensors, data Processed in such database systems are usually changed very rapidly and continuously. However, traditional database systems have a problem in processing these rapidly and continuously changing data because they suppose that a data item stored in the database remains constant until It is explicitly modified. The problem becomes more serious in the R-tree, which is a typical index structure for multidimensional data, because modifying data in the R-tree can generate cascading node splits or merges. To process frequent updates more efficiently, we propose a novel update technique for the R-tree, which we call the leaf-update technique. If a new value of a data item lies within the leaf MBR that the data item belongs, the leaf-update technique changes the leaf node only, not whole of the tree. Using this leaf-update manner and the leaf-access hash table for direct access to leaf nodes, the proposed technique can reduce update cost greatly. In addition, the leaf-update technique can be adopted in diverse variants of the R-tree and various applications that use the R-tree since it is based on the R-tree and it guarantees the correctness of the R-tree. In this paper, we prove the effectiveness of the leaf-update techniques theoretically and present experimental results that show that our technique outperforms traditional one.

• The KIPS Transactions:PartA
• /
• v.13A no.4 s.101
• /
• pp.343-350
• /
• 2006

In this paper, wireless internet proxy server clusters are used for the wireless internet because their caching, distillation, and clustering functions are helpful to overcome the limitations and needs of the wireless internet. A wireless Internet proxy server cluster needs a systematic scalability, simple communication structure, cooperative caching, and serving Hot Spot requests. In our former research, we proposed the CD-A structure which can be scalable in a systematic way and has a simple communication structure but it has no cooperative caching. A hash based load balancing can be used to solve the problem, but it can not deal with Hot Spot request problem. In this paper, we proposed a shared storage based wireless internet proxy server cluster which has a systematic scalability, simple communication structure, cooperative caching, and serving Hot Spot requests. The proposed method shares one cache directory and it has advantages: advantages of the existing CD-A structure, cooperative caching, and serving Hot Spot requests. We performed experiments using 16 PCs and experimental results show high performance improvement of the proposed system compared to the existing systems in Hot Spot requests.

• Journal of KIISE
• /
• v.42 no.9
• /
• pp.1175-1184
• /
• 2015

Recently, there has been an explosive increase in the volume of multimedia data that is available as a result of the development of multimedia technologies. More and more data is becoming available on a variety of web sites, and it has become increasingly cost prohibitive to have a single data server store and process multimedia files locally. Therefore, many service providers have been likely to outsource data to cloud storage to reduce costs. Such behavior raises one serious concern: how can data users be authenticated in a secure and efficient way? The most widely used password-based authentication methods suffer from numerous disadvantages in terms of security. Multi-factor authentication protocols based on a variety of communication channels, such as SMS, biometric, or hardware tokens, may improve security but inevitably reduce usability. To this end, we present a data block-based authentication scheme that is secure and guarantees usability in such a manner where users do nothing more than enter a password. In addition, the proposed scheme can be effectively used to revoke user rights. To the best of our knowledge, our scheme is the first data block-based authentication scheme for outsourced data that is proven to be secure without degradation in usability. An experiment was conducted using the Amazon EC2 cloud service, and the results show that the proposed scheme guarantees a nearly constant time for user authentication.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.2
• /
• pp.377-391
• /
• 2019

Recently, system studies using tokens and block chains for authentication, access control, etc in IoT environment have been going on at home and abroad. However, existing token-based systems are not suitable for IoT environments in terms of security, reliability, and scalability because they have centralized characteristics. In addition, the system using the block chain has to overload the IoT device because it has to repeatedly perform the calculation of the hash et to hold the block chain and store all the blocks. In this paper, we intend to manage the access rights through tokens for proper access control in the IoT. In addition, we apply the Tangle to configure the P2P distributed ledger network environment to solve the problem of the centralized structure and to manage the token. The authentication process and the access right grant process are performed to issue a token and share a transaction for issuing the token so that all the nodes can verify the validity of the token. And we intent to reduce the access control process by reducing the repeated authentication process and the access authorization process by reusing the already issued token.

• Journal of Korean Society of Archives and Records Management
• /
• v.19 no.3
• /
• pp.155-178
• /
• 2019

The study aims to analyze the characteristics and problems of raw image file formats, evaluate its suitability for the management of digital photographic records, and suggest the introduction method to utilize such format in public institutions. Raw image file formats feature reversibility and flexibility. However, most of them are proprietary file formats that depend on the digital camera manufacturer. The DNG format, which was developed to standardize raw image file formats, has received positive reviews from overseas public agencies. However, the DNG format is not fully recognized as a standard; hence, it is appropriate to use it tentatively until the standard raw format appears. On the other hand, the converted digital photo file format is not recognized as an original with legal authenticity. Therefore, in the short term, DNG files created by format conversion and original raw files should be encapsulated and preserved. Furthermore, it is necessary to redefine the baseline of the hash value and file size to recognize the legal authenticity only with DNG files in the long term.

• Journal of Industrial Convergence
• /
• v.20 no.3
• /
• pp.33-40
• /
• 2022

Recently, IoT-linked services have been used in various environments, and IoT and artificial intelligence technologies are being fused. However, since technologies that process IoT data stably are not fully supported, research is needed for this. In this paper, we propose a processing technique that can optimize IoT data after generating embedded vectors based on machine learning for IoT data. In the proposed technique, for processing efficiency, embedded vectorization is performed based on QR such as index of IoT data, collection location (binary values of X and Y axis coordinates), group index, type, and type. In addition, data generated by various IoT devices are integrated and managed so that load balancing can be performed in the IoT data collection process to asymmetrically link IoT data. The proposed technique processes IoT data to be orthogonalized based on hash so that IoT data can be asymmetrically grouped. In addition, interference between IoT data may be minimized because it is periodically generated and grouped according to IoT data types and characteristics. Future research plans to compare and evaluate proposed techniques in various environments that provide IoT services.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.3
• /
• pp.513-525
• /
• 2022

The immutability of blockchain is core elements of security of blockchain and guarantee data integrity. However, the characteristic that the data recoreded once in the blockchain cannot be modified has place for abuse by a specific user. In fact improper contents that is inappropriate to be recorded on the blockchain, such as harmful data and user personal data, is exposed on Bitcoin. As a way to manage improper content existing in the blockchain, there is a redactable blockchain using chameleon hash proposed for the first time by Ateniese. The redactable blockchain meet the right to be forgotten of GDPR by allowing data modification and deletion. Recently, Research on personal data management is being conducted in a redactable blockchain. Research by Jia et al. proposed a model that enables users to manage their personal data in the redactable blockchain. However, semi trusted regulators, which are blockchain participation nodes, have powerful authority in the blockchain, such as modification rights and deprivation of transaction rights for all blocks, which may cause side effects. In this paper, to weaken the authority of regulators in Y. Jia et al., we propose a method of authority subject altering and authority sharing, and propose a redactable blockchain-based authority change and access control system model based on applicable scenarios.

• Journal of Appropriate Technology
• /
• v.6 no.2
• /
• pp.190-199
• /
• 2020

The purpose of this study is to develop and implement the Appropriate Technology Science School program (ATSS) for youth operated by the Europe-Korea Conference on Science & Technology (EKC) since 2016. The development process consisted of pre-online management meetings, online and offline tutor training, operation of ATSS for youth, and satisfaction surveys. As a result of the development, the management team selected the mission-solving theme of "Transforming village using blockchain technology" through a pre-online meeting. The contents were reorganized according to the level of the participating tutees, and various learning activities such as co-building activities, games, and plays were newly introduced and developed first, and the programs developed through tutor training were demonstrated and improved. A total of 38 tutees and tutors from 6 countries participated in the 2018 ATSS. As a result, participants showed positive satisfaction overall. Tutees showed interest in dome co-building activities and hash function calculation activities, and tutors showed interest in lectures and monopoly games related to blockchain technology. The development and of the 2018 ATSS will contribute to the improvement of expertise in the operation of the EKC ATSS in the future to the management team. It will be an opportunity for tutors to experience that high-tech science and technology have a good impact on appropriate technology for the third world and community society. In addition, Tutees will be provided with an opportunity to indirectly experience the local situation and community society through a role play on the impact of blockchain technology on African villages.