• Journal of KIISE:Databases
• /
• v.34 no.2
• /
• pp.153-165
• /
• 2007

XML is widely used in various applications as the standard for representing and exchanging data on the Web. XML Schema is the standard schema for XML and an XML document generated based on the XML Schema is called 'Valid XML document'. The XML Schema validity should be guaranteed after the XML document is updated. In this paper, we design an efficient method that verifies XML Schema validity before update, and so eliminates unnecessary validations. Also, we propose validation algorithms for each update. In addition, we propose the mapping between XML data and XML Schema and a storage method for XML Schema in order to efficiently extract the schema information for the validation. Finally, we compare the performance of the validation according to the storage methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1042-1062
• /
• 2010

Cooperative spectrum sensing (CSS) is an effective technology for alleviating the unreliability of local spectrum sensing due to fading/shadowing effects. Unlike most existing solutions, this paper considers the use of CSS technology in decentralized networks where a fusion center is not available. In such a decentralized network, some attackers may sneak into the ranks of cooperative users. On the basis of recent advances in bio-inspired consensus algorithms, an attack-proof, decentralized CSS scheme is proposed in which all secondary users can maintain cooperative sensing by exchanging information locally instead of requiring centralized control or data fusion. Users no longer need any prior knowledge of the network. To counter three potential categories of spectrum sensing data falsification (SSDF) attacks, some anti-attack strategies are applied to the iterative process of information exchange. This enables most authentic users to exclude potentially malicious users from their neighborhood. As represented by simulation results, the proposed scheme can generally ensure that most authentic users reach a consensus within the given number of iterations, and it also demonstrates much better robustness against different SSDF attacks than several existing schemes.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.133-144
• /
• 2015

In this paper, we introduce a system and a set of algorithms for disseminating popular content to a large group of wireless clients spread over a wide area. This area is partitioned into multiple cells and there is a base station in each cell which is able to broadcast to the clients within its radio coverage. Dissemination of information in the proposed system is hybrid in nature: Each base station broadcasts a fraction of information in the form of random linear combinations of data blocks. Then the clients cooperate by exchanging packets to obtain their desired messages while they are moving arbitrarily over the area. In this paper, fundamental trade-offs between the average information delivery completion time at the clients and different parameters of the system such as bandwidth usage by the base stations, average energy consumption by the clients and the popularity of the spread information are studied. Moreover different heuristic algorithms are proposed to control and maintain a balance over these trade-offs. Also, the more complicated case of multiple sessions where each client is interested in an arbitrary subset of sessions is considered and two variants of the basic dissemination algorithm are proposed. The performance of all the proposed algorithms is evaluated via extensive numerical experiments.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.4
• /
• pp.389-398
• /
• 2002

As XML has been proposed a standard format for organizing and exchanging data in the internet, many applications on managing XML data have been developed. Especially, there are many studies for storing XML documents. It is important to evaluate the performance for efficient storage techniques. In this work, we suggest an efficient technique for storing XML documents using an object-relational database model. We verify the efficiency of a new storage technique through the performance evaluation on XML storage techniques. The contributions of this paper is that we suggest an efficient storage technique using an existing data management model and evaluate the performance for storage techniques for XML documents including an new storage technique.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.6 no.4
• /
• pp.3-38
• /
• 1996

The mobile station shall convolutionally encode the data transmitted on the reverse traffic channel and the access channel prior to interleaving. Code symbols output from the convolutional encoder are repeated before being interleaved except the 9600 bps data rate. All the symbols are then interleaved, 64-ary orthogonal modulation, direct-sequence spreading, quadrature spreading, baseband filtering and QPSK transmission. The sync, paging, and forward traffic channel except the pilot channel in the forward CDMA channel are convolutionally encoded, block interleaved, spread with Walsh function at a fixed chip rate of 1.2288 Mcps to provide orthogonal channelization among all code channels. Following the spreading operation, the I and Q impulses are applied to respective baseband filters. After that, these impulses shall be transmitted by QPSK. Authentication in the CDMA system is the process for confirming the identity of the mobile station by exchanging information between a mobile station and the base station. The authentication scheme is to generate a 18-bit hash code from the 152-bit message length appended with 24-bit or 40-bit padding. Several techniques are proposed for the authentication data computation in this paper. To protect sensitive subscriber information, it shall be required enciphering ceratin fields of selected traffic channel signaling messages. The message encryption can be accomplished in two ways, i.e., external encryption and internal encryption.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.5
• /
• pp.23-36
• /
• 2004

This paper presents a password based authentication and key exchange protocol which can be used for both authenticating users and exchanging session keys for a subsequent secure communication over an untrusted network. Our idea is to increase a randomness of the password verification data, i.e., we split the password, and then amplify the split passwords in the high entropy-structured password verification data. And in order to prevent the verifier-compromised attack, we construct our system such that the password verification data is encrypted with the verifier's key and the private key of verifier used to encrypt it is stored in a secure place like a smart cards. Also we propose the distributed password authentication scheme utilizing many authentication servers in order to prevent the server-compromised attack occurred when only one server is used. Furthermore, the security analysis on the proposed protocol has been presented as a conclusion.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.8
• /
• pp.169-176
• /
• 2022

With the continuous development of technologies related to 5G, artificial intelligence, and autonomous vehicle systems, standards and services for V2X and C-ITS environments are being studied a lot. BSM (basic safety message) was adopted as a standard for exchanging data between vehicles based on data collected and generated by vehicle systems in a V2V environment. In this paper, we propose a framework that can safely store BSM messages and effectively check the stored messages using Event-Sourcing and CQRS patterns. The proposed framework can securely store and manage BSM messages using hash functions. And it has the advantage of being able to check the stored BSM data in real time based on the time series and to reproduce the state.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2021.05a
• /
• pp.321-322
• /
• 2021

This study is to develop a non-contact construction project management solution that can reduce cost and construction period through on-site information sharing, minimizing contact with others by COVID19, and improving the productivity of the construction industry. Decisions, checklists, and execution rates of construction costs can be checked with smart devices through sharing on-site photos and videos, exchanging opinions. Details and checklist data stored on cloud servers of sites that apply non-face-to-face construction project management solutions will be used as data for analyzing amounts and construction periods depending on the size of the construction. Real-time field information sharing will reduce expected problems and waste factors, expand communication channels with users to prevent or minimize construction disputes and claims, and contribute to the expansion and growth of new research industry markets in construction technology.

• Korean Journal of Computational Design and Engineering
• /
• v.22 no.2
• /
• pp.150-161
• /
• 2017

Effective data exchange among the diverse stakeholders participating in a process plant project is an important issue. ISO 15926 is an international standard to support sharing and integrating of process plant data. iRINGTools is an ISO 15926-based tool used to exchange plant data. To exchange plant data using iRINGTools, the mapping between the data model of a commercial system and ISO 15926 should be preceded. To accomplish this, types and properties of equipment and materials used for plant design should be predefined and these data should be represented as user-defined reference data complying with ISO 15926. Besides, the user-defined reference data should be serviced by a reference data server such that iRINGTools searches reference data from the server and utilizes the data for the model mapping. In this paper, we present a method to construct a reference data server and use it for the model mapping in iRINGTools. The proposed method is verified through experiments of exchanging specifications data of equipment and materials using iRINGTools.

• Korean Journal of Geomatics
• /
• v.2 no.1
• /
• pp.75-82
• /
• 2002

The information system fields of spatial applications have rapidly grown during the last decade in Korea. Spatial data has been produced for a variety of systems without common standards until national GIS Committee defined the data exchange formats among spatial databases in the middle of 1990's. It aimed at promoting data sharing between the different systems in similar application fields. However, a considerable number of databases built prior to the introduction of the standards are not yet standard compliant but still play the roles of the main producers/consumers in the data collection field such as early developed huge AM/FM systems maintained by governmental organizations. The strong autonomy of these databases keeps their own data models, formats and descriptions from being standardized, which leads the sharing to a more difficult stage. Sharing is another way of data acquisition with least efforts and time away from direct collection. A data clearinghouse is the core module which directs users to the relevant data resources. The contents of datasets should be described with predefined metadata standards for precise indexing. Moreover, a number of technical problems have to be resolved for the common use of data between heterogeneous spatial database systems. However, the technical issues can be covered by the present information technologies. The difficulties persist in the political/institutional issues. Institutional issues are derived from the diverse sources such as political background, governmental policies, related laws and/or regulations. The paper will firstly make an analysis of current situation in terms of Korean policies, laws and regulations, secondly abstract the institutional issues from the situation analysis, lastly present guidelines for promoting spatial data sharing in Korea.