• The Journal of the Korea Contents Association
• /
• v.8 no.10
• /
• pp.37-44
• /
• 2008

This paper presented a solution to encryption and decryption problem suffering data transmission error for encrypted message transmission. Block cypher algorithms experience avalanche effect that a single bit error in an encrypted message brings substantial error bits after decryption. The proposed fault tolerant scheme addresses this error avalanche effect exploiting a multi-dimensional data array shuffling process and an error correction code. The shuffling process is to simplify the error correction. The shuffling disperses error bits to many data arrays so that each n-bit data block may comprises only one error bit. Thereby, the error correction scheme can easily restore the one bit error in an n-bit data block. This scheme can be extended on larger data blocks.

• Journal of Korea Multimedia Society
• /
• v.18 no.7
• /
• pp.818-826
• /
• 2015

With the rapid interest in Geographic Information System (GIS) contents, a large volume of valuable GIS dataset has been distributed illegally by pirates, hackers, or unauthorized users. Therefore the problem focus on how to protect the copyright of GIS vector map data for storage and transmission. But GIS vector map data is very large and current data encryption techniques often encrypt all components of data. That means we have encrypted large amount of data lead to the long encrypting time and high complexity computation. This paper presents the selective encryption scheme using hybrid transform for GIS vector map data protection to store, transmit or distribute to authorized users. In proposed scheme, polylines and polygons in vector map are targets of selective encryption. We select the significant objects in polyline/polygon layer, and then they are encrypted by the key sets generated by using Chaotic map before changing them in DWT, DFT domain. Experimental results verified the proposed algorithm effectively and error in decryption is approximately zero.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.294-295
• /
• 2011

The fundamental problem of selective protection scheme for encoded bitstreams is to find an efficient algorithm to select the set of frames required to be encrypted that can maximize protection effect with the minimum amount of protected data is required. In this paper, we propose an optimal selective protection scheme for SVC bitstreams by protecting the best combination of frames for selective protection in the sense that the amount of data required for protection is minimized and the resulting visual quality degradation is maximized. The selection of the frames to be encrypted is done by first expressing R-Q (protection rate - visual quality) relationship with Lagragian cost model. The experimental results show that, compared to protecting SVC bitstreams layer by layer, the proposed scheme gives superior performance in terms of protection effectiveness due to its better selection of frames for protection given protection bit budgets.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.4
• /
• pp.803-819
• /
• 2009

In classical encryption schemes, data is encrypted under a single key that is associated with a user or group. In Ciphertext-Policy Attribute-Based Encryption(CP-ABE) keys are associated with attributes of users, given to them by a central trusted authority, and data is encrypted under a logical formula over these attributes. We extend this idea to the case where an arbitrary number of independent parties can be present to maintain attributes and their corresponding secret keys. We present a scheme for multi-authority CP-ABE, propose the first two constructions that fully implement the scheme, and prove their security against chosen plaintext attacks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.12
• /
• pp.4508-4530
• /
• 2021

Today distributed data storage service are being widely used. However lack of proper means of security makes the user data vulnerable. In this work, we propose a Randomized Block Size (RBS) model for secure data storage in distributed environments. The model work with multifold block sizes encrypted with the Chinese Remainder Theorem-based RSA (C-RSA) technique for end-to-end security of multimedia data. The proposed RBS model has a key generation phase (KGP) for constructing asymmetric keys, and a rand generation phase (RGP) for applying optimal asymmetric encryption padding (OAEP) to the original message. The experimental results obtained with text and image files show that the post encryption file size is not much affected, and data is efficiently encrypted while storing at the distributed storage server (DSS). The parameters such as ciphertext size, encryption time, and throughput have been considered for performance evaluation, whereas statistical analysis like similarity measurement, correlation coefficient, histogram, and entropy analysis uses to check image pixels deviation. The number of pixels change rate (NPCR) and unified averaged changed intensity (UACI) were used to check the strength of the proposed encryption technique. The proposed model is robust with high resilience against eavesdropping, insider attack, and chosen-plaintext attack.

• Proceedings of the Optical Society of Korea Conference
• /
• 1996.09a
• /
• pp.106-106
• /
• 1996

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.1
• /
• pp.281-298
• /
• 2020

Fog computing has become a popular concept in the application of internet of things (IoT). With the superiority in better service providing, the edge cloud has become an attractive solution to IoT networks. The data outsourcing scheme of IoT devices demands privacy protection as well as computation verification since the lightweight devices not only outsource their data but also their computation. Existing solutions mainly deal with the operations over encrypted data, but cannot support the computation verification in the same time. In this paper, we propose a data outsourcing scheme based on an encrypted database system with linear computation as well as efficient query ability, and enhance the interlayer program in the original system with homomorphic message authenticators so that the system could perform computational verifying. The tools we use to construct our scheme have been proven secure and valid. With our scheme, the system could check if the cloud provides the correct service as the system asks. The experiment also shows that our scheme could be as effective as the original version, and the extra load in time is neglectable.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.7
• /
• pp.499-506
• /
• 2003

In this paper, we propose the shift and noise tolerance method using a virtual phase image and a joint transform correlator (JTC) architecture that can alleviate the need for an accurate optical axis alignment. An encrypted image is obtained by the Fourier transform of the product of a phase- encoded virtual image to camouflage the original one and a random phase image. Therefore, even if unauthorized users analyze the encrypted image, we can prevent the possibility of counterfeiting from unauthorized people using virtual image which dose not contain any information from the original image. We demonstrate the robustness to noise, to data loss and to shift of the encrypted image using a JTC in the proposed description technique.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.6
• /
• pp.1259-1266
• /
• 2013

Nowadays, the databases are getting larger and larger. As the company has difficulty in managing the database, they want to outsource the database to the cloud system. In this case the database security is more important because their database is managed by the cloud service provider. Among database security techniques, the encryption method is a well-certified and established technology for protecting sensitive data. However, once encrypted, the data can no longer be easily queried. The performance of the database depends on how to encrypt the sensitive data, and on the approach for searching, and the retrieval efficiency that is implemented. In this paper we propose the new suitable mechanism to encrypt the database and lookup process on the encrypted database under control of the cloud service provider. This database encryption algorithm uses the bloom filter with the variable keyword based index. Finally, we demonstrate that the proposed algorithm should be useful for database encryption related research and application activities.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.296-305
• /
• 2000

In this paper, we propose the method of embedding the encrypted digital watermark in quantization coefficient when we encode the image data in the process of JPEC. The proposed method is as following. After a DCT coefficient of each block is quantized, we arrange the quantization coefficient as on dimension with a zigzag scan and replace each block. By applying even-odd feature of frequency of the encrypted watermark to a quantization coefficient of some fixed domain of replaced each block and embedding it, we obtain the compressed image data by encoding after placing it in the order prior to replacement. The advantages of the proposed method here are as follows: We can embed many information keeping a secret as much as possible by using the algorithm of block replacement. We can control the amount of embedding of each use, as we embed the encrypted information by selecting some fixed domain of a quantization coefficient, we can fix the embedding data regardless of the image and the value of quantization. We verified the results by experiments and analyzed the efficiency of them in comparison with the former study.