• Title/Summary/Keyword: scalable protection

Search Result 36, Processing Time 0.03 seconds

Video Watermarking Scheme for Scalable Video Coding using ROI

  • Yoon, Ji-Sun;Kwon, Seong-Geun;Lee, Suk-Hwan;Song, Yoon-Chul;Kim, Min-Hwan;Kwon, Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.6
    • /
    • pp.796-806
    • /
    • 2008
  • This paper presents a blind video watermarking algorithm that has the robustness against spatial, temporal, and SNR scalability and transcoding for the copyright protection of video contents in heterogeneous multimedia service. The proposed process of watermark embedding and detecting is accomplished on base layer for considering spatial scalability. The watermark consists of the string and the ordering number of string for considering temporal scalability. Thus, each of frames has the bitstream of one character and a ordering number of its character. To robust against FGS, the proposed algorithm quantizes low and middle frequency coefficients in ROI region of each of frames and embeds its watermark bitstream into the specific bits of the quantized coefficients. Experimental results verified that the proposed algorithm satisfies the invisibility of watermark and also has the robustness against spatial scalability, temporal scalability and FGS.

  • PDF

A Fast and Scalable Inter-Domain MPLS Protection Mechanism

  • Huang, Chang-Cheng;Messier, Donald
    • Journal of Communications and Networks
    • /
    • v.6 no.1
    • /
    • pp.60-67
    • /
    • 2004
  • With the fast growth of Internet and a new widespread interest in optical networks, the unparalleled potential of Multi-Protocol Label Switching (MPLS) is leading to further research and development efforts. One of those areas of research is Path Protection Mechanism. It is widely accepted that layer three protection and recovery mechanisms are too slow for today’s reliability requirements. Failure recovery latencies ranging from several seconds to minutes, for layer three routing protocols, have been widely reported. For this reason, a recovery mechanism at the MPLS layer capable of recovering from failed paths in 10’s of milliseconds has been sought. In light of this, several MPLS based protection mechanisms have been proposed, such as end-to-end path protection and local repair mechanism. Those mechanisms are designed for intra-domain recoveries and little or no attention has been given to the case of non-homogenous independent inter-domains. This paper presents a novel solution for the setup and maintenance of independent protection mechanisms within individual domains and merged at the domain boundaries. This innovative solution offers significant advantages including fast recovery across multiple nonhomogeneous domains and high scalability. Detailed setup and operation procedures are described. Finally, simulation results using OPNET are presented showing recovery times of a few milliseconds.

Conditional Access Control for Encrypted SVC Bitstream (암호화된 SVC 비트스트림에서 조건적 접근제어 방법)

  • Won Yong-Geun;Bae Tae-Meon;Ro Yong-Man
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.16 no.3
    • /
    • pp.87-99
    • /
    • 2006
  • In this paper, we propose a method of conditional access control for encrypted SVC(scalable video coding) bitstream. The main purpose of the proposition is to provide a SVC suitable encryption algorithm and a efficient method for conditional access control using encrypted SVC bitstream. We analyzed requirements for conditional access control of a SVC bitstream. And based on the analysis, we proposed encryption algorithm suitable for SVC bitstream and a method of conditional access control of the encryped bitstream. The proposed conditional access control for encrypted SVC bitstream is performed by bitsream extraction and selective decryption. We verified the usefulness of the proposed method through experiments.

Protection of MPEG-2 Multicast Streaming in an IP Set-Top Box Environment

  • Hwang, Seong-Oun;Kim, Jeong-Hyon;Nam, Do-Won;Yoon, Ki-Song
    • ETRI Journal
    • /
    • v.27 no.5
    • /
    • pp.595-607
    • /
    • 2005
  • The widespread use of the Internet has led to the problem of intellectual property and copyright infringement. Digital rights management (DRM) technologies have been developed to protect digital content items. Digital content can be classified into static content (for example, text or media files) and dynamic content (for example, VOD or multicast streams). This paper deals with the protection of a multicast stream on set-top boxes connected to an IP network. In this paper, we examine the following design and architectural issues to be considered when applying DRM functions to multicast streaming service environments: transparent streaming service and large-scale user environments. To address the transparency issue, we introduce a 'selective encryption scheme'. To address the second issue, a 'key packet insertion scheme' and 'hierarchical key management scheme' are introduced. Based on the above design and architecture, we developed a prototype of a multicasting DRM system. The analysis of our implementation shows that it supports transparent and scalable DRM multicasting service in a large-scale user environment.

  • PDF

A Security Protection Framework for Cloud Computing

  • Zhu, Wenzheng;Lee, Changhoon
    • Journal of Information Processing Systems
    • /
    • v.12 no.3
    • /
    • pp.538-547
    • /
    • 2016
  • Cloud computing is a new style of computing in which dynamically scalable and reconfigurable resources are provided as a service over the internet. The MapReduce framework is currently the most dominant programming model in cloud computing. It is necessary to protect the integrity of MapReduce data processing services. Malicious workers, who can be divided into collusive workers and non-collusive workers, try to generate bad results in order to attack the cloud computing. So, figuring out how to efficiently detect the malicious workers has been very important, as existing solutions are not effective enough in defeating malicious behavior. In this paper, we propose a security protection framework to detect the malicious workers and ensure computation integrity in the map phase of MapReduce. Our simulation results show that our proposed security protection framework can efficiently detect both collusive and non-collusive workers and guarantee high computation accuracy.

Development of Overload Prevention Algorithm for the Crane Safety (크레인 안전을 위한 과부하 방지 알고리즘 개발)

  • Lee, Sang Young
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.2
    • /
    • pp.11-19
    • /
    • 2012
  • Crane systems have been widely used for transportation in building sites, ports, nuclear wastehandling operation and so on. As a typical underactuated system, an overhead crane has such merits as high flexibility and less energy consumption. And it's getting more types of cranes, universally applicable algorithms should be developed. That is the design and development of scalable algorithms are required. Developed algorithms can be used for the controller and crane overload protection that meets the requirements of the algorithm are presented. These algorithms force the state to warn the operator and stops the operation of equipment. In this paper, crane overload conditions that can cause damage to alert the operator, and to limit the operation of equipment overload protection algorithm is presented.

Packet Loss Protection Method of Scalable Video considering Perceptual Saliency (시각 특성을 고려한 스케일러블 비디오의 패킷 손실 최적화 기법)

  • Lee, Hyunho;Lee, Kwanghyun;Lee, Sanghoon
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2011.07a
    • /
    • pp.563-564
    • /
    • 2011
  • 본 논문에서 우리는 unequal loss protection(ULP) 알고리즘을 기반으로 패킷이 손실될 수 있는 망 환경에서 인지적으로 재구성된 영상의 왜곡을 최소화하는 방법을 제안한다. 알고리즘에는 2가지의 주요 요인이 있다. 첫째, 인간 시각 체계의 균일하지 않은 분포의 함수로 압축된 영상에 가중치를 준다. 둘째, 패킷은 오류 전파가 일어나지 않도록 하면서 각각의 group of picture(GOP)내에서 시간적인 중요성이 할당된다. 프레임의 인지적인 중요성과 GOP의 계층적인 중요성을 동시에 고려하여, 제안하는 ULP알고리즘은 인간 시각적으로 가장 중요한 지역의 크기를 식별하여 효율적인 forword error correction(FEC) 알고리즘을 수행한다.

  • PDF

Scrambling Technology using Scalable Encryption in SVC (SVC에서 스케일러블 암호화를 이용한 스크램블링 기술)

  • Kwon, Goo-Rak
    • 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.

Design of A Generic and Scalable DRM Scheme using HC-256 Stream Cipher (HC-256 스트림 암호화를 이용한 범용성 및 확장성을 가진 DRM 기법 설계)

  • Park, Jun-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.9B
    • /
    • pp.923-930
    • /
    • 2009
  • Digital Rights Management(DRM) is a term that refers technologies for imposing limitations on the use of digital content for protecting media copyright holders. This paper proposes a generic scheme for digital media copy protection that can be applied to any digital media such as audio, video, etc. The scheme will make it very hard to play a copied content on a foreign platform and to guess secret content encryption keys. Unlike other DRM techniques, the scheme uses the stream cipher HC-256 only for encrypting media content and it allows a client to start content playback immediately following its streamed decryption. As to the encryption, it requires to generate several secret keys for each new client(player copy), rather than for each media content, which makes it scalable in terms of managed keys. Also, for simplicity, the scheme supports the popular unlimited-play-after-download policy only, which would eliminate the necessity for deploying separate server or process for licensing.

Content Protective Multi-Agent Platform for MsMu Service and Pattern-Based Content Management

  • Uhm, Yoon-Sik;Hwang, Zi-On;Lee, Min-Soo;Nah, Jae-Hoon;Song, Hwang-Jun;Park, Se-Hyun
    • ETRI Journal
    • /
    • v.32 no.5
    • /
    • pp.665-675
    • /
    • 2010
  • Recent research on mobile Internet protocol television and digital right management (DRM) interconnections has focused on multimedia technologies designed to enhance content scalability and adaptive content distribution. However, due to the architectural and scalable limitations, recent systems are not flexible and securable with respect to their adaptive content distribution and protective policy management. Therefore, we propose a content protective multi-agent platform that provides secure multimedia services, correlation management, pattern-based management, and multi-source multi-use (MsMu)-based services. Our architecture, supported by DRM, lets us create a rich set of MsMu-based content protection and seamless multimedia services through the extension of one source multi-use (OsMu)-based content services. We have verified our platform, which provides scalable and securable services with a 17% lower service response time by using a testbed.