• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1510-1532
• /
• 2017

In smart grid, privacy implications to individuals and their families are an important issue because of the fine-grained usage data collection. Wireless communications are utilized by many utility companies to obtain information. Network coding is exploited in smart grids, to enhance network performance in terms of throughput, delay, robustness, and energy consumption. However, random linear network coding introduces a new challenge for privacy preserving due to the encoding of data and updating of coefficients in forwarder nodes. We propose a distributed privacy preserving scheme for random linear network coding in smart grid that considers the converged flows character of the smart grid and exploits a homomorphic encryption function to decrease the complexities in the forwarder node. It offers a data confidentiality privacy preserving feature, which can efficiently thwart traffic analysis. The data of the packet is encrypted and the tag of the packet is encrypted by a homomorphic encryption function. The forwarder node random linearly codes the encrypted data and directly processes the cryptotext tags based on the homomorphism feature. Extensive security analysis and performance evaluations demonstrate the validity and efficiency of the proposed scheme.

• Convergence Security Journal
• /
• v.14 no.2
• /
• pp.51-56
• /
• 2014

Be expressed in network-centric warfare, mainly battlefield environment of the future. The purpose of the system for the war of the future, is to recognize the enemy before the enemy, and rapid decision-making, to hit accurately. For this reason, it is during the construction of the integrated system of C4ISR+PGM. In such an integrated system, it is necessary to further enhance the security aspects of the information. In particular, strengthening of security leads to a decrease of efficiency. Therefore, security and efficiency should be considered together. In this study, we provide a homomorphic encryption system that can be safely managed information environment on the battlefield of the future. The proposed method uses encryption technology of homomorphic that can be the arithmetic operations on encrypted state. It has changed from the state of the encryption. Therefore, the attacker can not know a decent information.

• Convergence Security Journal
• /
• v.15 no.4
• /
• pp.91-97
• /
• 2015

General companies consider saving the information after enciphering as law. However, if the actual information is saved as enciphered, the decoding process must be conducted when the information is searched or edited in the ser ver. Therefore, process delay time occurs and is less efficient. This kind of work gives burden to the server, so the companies or managers handling the server do not save the information after enciphering. In this paper, the Networ k constructs and realizes an efficient security data management system that ensures safety and haste in operating u sing the homomorphic encryption technology, which collects information and decides quickly, and enables editing the encryption without a decoding process. To ensure the security of the embodied system, the existing encryption algo rithm can be used. Search method to use the keyword search. Additionally, by using a trapdoor, the keyword is not expose and it is changed whenever it is searched, and the formation of the keyword does not get exposed.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.1
• /
• pp.54-60
• /
• 1996

In most pattern recognition and image understanding applications, images are degraded by noise and other distortions. Therefore, it is more relevant to decide how similar two objects are rather than to decide whether the two are exactly the same. In this paper, we propose a method for recognizing degraded symbols using a distance measure between two graphs representing the symbols. a symbol is represented as a graph consisting of nodes and edges based on the run graph concept. The graph is then transformed into a reference model graph with production rule containing the embedding transform. The symbols are recognized by using the distance measure which is estimated by using the number of production rules used and the structural homomorphism between a transformed graph and a model graph. the proposed approach is applies to the recognition of non-note musical symbols and the result are given.

• Journal of the Korean Mathematical Society
• /
• v.58 no.3
• /
• pp.643-702
• /
• 2021

Fix ℤ/2 is the prime field of two elements and write 𝒜₂ for the mod 2 Steenrod algebra. Denote by GL_d := GL(d, ℤ/2) the general linear group of rank d over ℤ/2 and by ${\mathfrak{P}}_d$ the polynomial algebra ℤ/2[x₁, x₂, …, x_d] as a connected unstable 𝒜₂-module on d generators of degree one. We study the Peterson "hit problem" of finding the minimal set of 𝒜₂-generators for ${\mathfrak{P}}_d$. Equivalently, we need to determine a basis for the ℤ/2-vector space $$Q{\mathfrak{P}}_d:={\mathbb{Z}}/2{\otimes}_{\mathcal{A}_2}\;{\mathfrak{P}}_d{\sim_=}{\mathfrak{P}}_d/{\mathcal{A}}^+_2{\mathfrak{P}}_d$$ in each degree n ≥ 1. Note that this space is a representation of GL_d over ℤ/2. The problem for d = 5 is not yet completely solved, and unknown in general. In this work, we give an explicit solution to the hit problem of five variables in the generic degree n = r(2^t - 1) + 2^ts with r = d = 5, s = 8 and t an arbitrary non-negative integer. An application of this study to the cases t = 0 and t = 1 shows that the Singer algebraic transfer of rank 5 is an isomorphism in the bidegrees (5, 5 + (13.2⁰ - 5)) and (5, 5 + (13.2¹ - 5)). Moreover, the result when t ≥ 2 was also discussed. Here, the Singer transfer of rank d is a ℤ/2-algebra homomorphism from GL_d-coinvariants of certain subspaces of $Q{\mathfrak{P}}_d$ to the cohomology groups of the Steenrod algebra, $Ext^{d,d+*}_{\mathcal{A}_2}$ (ℤ/2, ℤ/2). It is one of the useful tools for studying these mysterious Ext groups.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.441-451
• /
• 2005

HTML is mostly stored in native file systems instead of specialized repositories such as a database. Like HTML, XML, the standard for the exchange and the representation of data in the Internet, is mostly resident on native file systems. However. since XML data is irregular and verbose, the disk space and the network bandwidth are wasted compared to those of regularly structured data. To overcome this inefficiency of XML data, the research on the compression of XML data has been conducted. Among recently proposed XML compression techniques, some techniques do not support querying compressed data, while other techniques which support querying compressed data blindly encode data values using predefined encoding methods without considering the types of data values which necessitates partial decompression for processing range queries. As a result, the query performance on compressed XML data is degraded. Thus, this research proposes an XML compression technique which supports direct and efficient evaluations of queries on compressed XML data. This XML compression technique adopts an encoding method, called dictionary encoding, to encode each tag of XML data and applies proper encoding methods for encoding data values according to the inferred types of data values. Also, through the implementation and the performance evaluation of the XML compression technique proposed in this research, it is shown that the implemented XML compressor efficiently compresses real-life XML data lets and achieves significant improvements on query performance for compressed XML data.