• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.85-88
• /
• 2008

본 논문에서는 집적 영상 (integral imaging) 방식과 픽셀 스크램블링 (pixel scrambling) 기술을 이용한 광 영상 암호화 (optical image encryption) 방법을 제안한다. 제안한 방법의 부호화 과정에서는 먼저 입력영상을 여러 개의 작은 사이즈의 블록으로 나누어 픽셀 스크램블링을 한 다음 집적 영상 기술을 이용하여 요소 영상(elemental image)을 생성하고, 이 영상의 안정성을 위하여 2차 픽셀 스크램블링을 수행하여 최종 암호화된 영상을 얻는다. 그리고 복호화 과정에서는 암호화된 영상에 광학적인 집적 영상 복원 기법과 역 픽셀 스크램블링 방법을 사용하여 원 영상을 복원한다. 제안하는 광 암호화 방법에 대해서 크로핑과 같은 데이터 손실 및 노이즈에 대한 컴퓨터 적으로 모의실험을 수행하여 강인성과 유용성을 보였다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.3
• /
• pp.187-192
• /
• 2012

This paper describes efficient H.264/AVC video scrambling methods for digital rights management. The proposed scrambling methods are to scramble level and suffix in entropy encoding and MVD in motion estimation of the H.264 video compression process. Other scrambling methods have been proposed but they degrade the compression efficiency or make it difficult to achieve real-time processing due to the large amount of computational efforts. Since the proposed scrambling methods resolve the drawbacks of other approaches, they do not cause image distortion and the original compression efficiency is maintained. We verified our scrambling methods and evaluated the performance by conducting several experiments with H.264 reference program. Finally, we implemented video player system using USB dongle in order to apply the proposed scrambling/descrambling methods to H.264 video compression.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06d
• /
• pp.128-130
• /
• 2011

디지털 미디어의 발전과 네트워크의 발전에 따라 영상 콘텐츠에 대한 사용이 늘어나고 있다. 이에 따라 저작물의 불법적 사용이 증가되고 이를 막기 위한 기법의 일환인 스크램블링 방법이 사용되고 있다. 스크램블링은 계산 비용과 에너지 소모를 줄이고 디지털 저작권 관리의 사용제어에 대한 요구사항을 만족시키기 위해 사용된다. 스크램블링은 일반적으로 동영상 압축의 변환 계수에 대한 헤더부분만을 암호화하거나 블록으로 나누고 변경과 회전을 통하여 난독화를 발생시킴으로 저작물을 대한 보호한다. 본 논문은 영상을 프레임 단위로 적출하여 영상 프레임이 가지는 색상정보 값에 난독화를 한 후 블럭 암호화 알고리즘을 적용한 스크램블링 기법을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.277-279
• /
• 2013

스크램블링(Scrambling)은 네트워크에서 영상을 전송할 때 보안을 위해 데이터를 특정한 키에 의해 암호화 하여 전송함으로써, 수신자만이 원본 영상으로 복원할 수 있도록 하는 기술이다. 스크램블링은 전송에서 TDES, AES 뿐만아닌 SEED, AIRA의 암호화 알고리즘을 사용한다. 이 경우 암복호화에 많은 시간이 소요되어 실시간 전송환경에서는 전송속도 저하에 따른 QoS 문제가 발생한다. 이와 같은 문제를 해결하기 위해 기존 연구에서는 속도가 빠른 해쉬 함수를 이용하여 스크램블링 암호화 하는 기법을 제안하였다. 하지만 원본 이미지의 일부가 노출될 경우 이후 원본프레임이 노출될 수 있는 문제점을 가지고 있다. 본 논문에서는 이러한 문제점을 방지하기 위해 다중 해쉬 키 프레임을 이용한 Multi Hash key Frame based Scrambling Encryption 알고리즘을 제안한다. 성능평가에서는 제안하는 스크램블링 기법에 대한 암복호화 비용과 성능을 측정하였으며, 기존기법과 비교하였을 때 원본 노출로 인한 대입공격 취약성 부분을 기존 해쉬 함수의 보안 안전성만큼 향상시켰다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.380-387
• /
• 2009

In this paper, optical image encryption using integral imaging and pixel-scrambling technologies is proposed. In the encryption process, we use pixel scrambling to change the order of subsections into which the cover image is divided, and the utilize the integral imaging scheme to obtain the elemental image from the scrambled image. In order to achieve higher security, we reuse pixel scrambling to the elemental image. In the decryption process, we employ optical integral imaging reconstruction technique and inverse pixel scrambling methode. Computer simulation results prove the feasibility of the proposed method and robustness against data loss and noise.

• Journal of Korea Multimedia Society
• /
• v.10 no.11
• /
• pp.1417-1426
• /
• 2007

As one of schemes to protect multimedia content. it is the selective encryption scheme to encrypt partially multimedia content. Compared AES(advanced encryption standard) of traditional encryption, the selective encryption scheme provides low security but is applicable to applications of multimedia content not to require high secrecy. In this paper, we improve the image scrambling scheme proposed by Van De Ville which scrambles an image without bandwidth expansion using DPSS(discrete prolate spheroidal sequence) to make it more secure based on Shujun's research which verifies the secrecy of Van De Ville's scheme. The proposed method utilizes an orthonormalized random matrix instead of Hadamard matrix for secret matrix and to add it for providing high secrecy against statistical attack or known-plaintext attack using some statistical property or estimate of secret matrix from a scrambled image. The experimental results show that the proposed method is more secure than the existing scheme. In addition, we show that the proposed method can be applied to access control or copy control of watermarking application.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1994.11a
• /
• pp.193-202
• /
• 1994

In this paper, we investigate possible scrambling methods for the JPEG(Joint Photographic Export Group) still image compression standard. In particular, we compare the conventional line rotation and line permutation methods to the DCT block scrambling in terms of the number of bits to be increased and the easiness of buffer control. Computer simulation results show that the DCT block scrambling method is suitable for both data security and buffer control in one-chip JPEG applications.

• Journal of Korea Multimedia Society
• /
• v.13 no.4
• /
• pp.575-581
• /
• 2010

With widespread use of the Internet and improvements in streaming media and compression technology, digital music, video, and image can be distributed instantaneously across the Internet to end-users. However, most conventional Digital Right Management are often not secure and not fast enough to process the vast amount of data generated by the multimedia applications to meet the real-time constraints. The SVC offers temporal, spatial, and SNR scalability to varying network bandwidth and different application needs. Meanwhile, for many multimedia services, security is an important component to restrict unauthorized content access and distribution. This suggests the need for new cryptography system implementations that can operate at SVC. In this paper, we propose a new scrambling encryption for reserving the characteristic of scalability in MPEG4-SVC. In the base layer, the proposed algorithm is applied and performed the selective scambling. And it encrypts various MVS and intra-mode scrambling in the enhancement layer. In the decryption, it decrypts each encrypted layers by using another encrypted keys. Throughout the experimental results, the proposed algorithms have low complexity in encryption and the robustness of communication errors.

• Journal of Korea Multimedia Society
• /
• v.10 no.1
• /
• pp.58-65
• /
• 2007

This dissertation proposes digital video protection algorithm lot moving image based on MPEG. Shuffling-based encryption algorithms using a fixed random shuffling table are quite simple and effective but vulnerable to the chosen plaintext attack. To overcome this problem, it is necessary to change the key used for generation of the shuffling table. However, this may pose a significant burden on the security key management system. A better approach is to generate the shuffling table based on the local feature of an image. In order to withstand the chosen plaintext attack, at first, we propose a interleaving algorithm that is adaptive to the local feature of an image. Secondly, using the multiple shuffling method which is combined interleaving with existing random shuffling method, we encrypted the DPCM processed 8*8 blocks. Experimental results showed that the proposed algorithm needs only 10% time of SEED encryption algorithm and moreover there is no overhead bit. In video sequence encryption, multiple random shuffling algorithms are used to encrypt the DC and AC coefficients of intra frame, and motion vector encryption and macroblock shuffling are used to encrypt the intra-coded macroblock in predicted frame.

• Journal of Korea Multimedia Society
• /
• v.14 no.3
• /
• pp.403-413
• /
• 2011

In this paper, we proposed a digital image watermarking technique using scrambled binary phase computer generated hologram in the discrete cosine transform(DCT) domain. For the embedding process of watermark. Using simulated annealing algorithm, we would generate a binary phase computer generated hologram(BPCGH) which can reconstruct hidden image perfectly instead of hidden image and encrypt it through the scramble operation. We multiply the encrypted watermark by the weight function and embed it into the DC coefficients in the DCT domain of host image and an inverse DCT is performed. For the extracting process of watermark, we compare the DC coefficients of watermarked image and original host image in the DCT domain and dividing it by the weight function and decrypt it using descramble operation. And we recover the hidden image by inverse Fourier transforming the decrypted watermark. Finally, we compute the correlation between the original hidden image and recovered hidden image to determine if a watermark exits in the host image. The proposed watermarking technique use the hologram information of hidden image which consist of binary values and scramble encryption technique so it is very secure and robust to the various external attacks such as compression, noises and cropping. We confirmed the advantages of the proposed watermarking technique through the computer simulations.