• Title/Summary/Keyword: Broadcast Message

Search Result 231, Processing Time 0.026 seconds

2-Subset Difference Broadcast Encryption System Based on Secret Sharing Method (비밀분산 기반의 2-Subset Difference 브로드캐스트 암호시스템)

  • Lee, Jae Hwan;Park, Jong Hwan
    • Journal of Broadcast Engineering
    • /
    • v.20 no.4
    • /
    • pp.580-597
    • /
    • 2015
  • Broadcast encryption system is a cryptographic primitive that enables a sender to broadcast a message to a set of receivers in a secure channel. Out of previous proposed broadcast encryption systems, the most effective is the one that uses the Subset Difference(SD) method in a binary tree structure. The SD method has been realized by two underlying approaches: Pseudo-Random Generator(PRG) and Secret Sharing(SS). 2-SD method is the generalized version of the SD method by which two subsets of revoked receivers can be dealt with by one subset (in an SD-based broadcast encryption system). The primary advantage of the 2-SD method is to further reduce the size of transmission overhead, compared to the SD method. Until now, however, there is no known broadcast encryption system that is based on such a 2-SD technique using either PRG or SS basis. In this paper, we suggest a new 2-SD broadcast encryption system using the SS-based technique that was suggested by Jae Hwan Lee et al. in 2014[9]. The new system can reduce the size of ciphertext by 25% of the one in the previous SS-based broadcast encryption system. Also, on a theoretical note, ours is the first 2-SD broadcast encryption system that is provably secure.

A Broadcasting Algorithm in Matrix Hypercubes (행렬 하이퍼큐브에 대한 방송 알고리즘)

  • 최선아;이형옥임형석
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.475-478
    • /
    • 1998
  • The matrix hypercube MH(2,n) is the interconnection network which improves the network cost of the hypercube. In this paper, we propose an algorithm for one-to-all broadcasting in the matrix hypercube MH(2,n). The algorithm can broadcast a message to 22n nodes in O(n) time. The algorithm uses the rich structure of the matrix hypercubes and works by recursively partitioning the original matrix hypercubes into smaller matrix hypercubes.

  • PDF

Method of inserting In-program Ads in Hybrid Broadcasting Environment based on MMT (MMT 기반 하이브리드 방송 환경에서의 중간 광고 삽입 방안)

  • Kang, Dongjin;Kang, Jeonho;Kim, Kyuheon
    • Journal of Broadcast Engineering
    • /
    • v.22 no.4
    • /
    • pp.462-472
    • /
    • 2017
  • As network technology evolves fast, media contents of particular countries are being consumed in not only the countries but also other countries around the world. Like this, in case that a particular media content is consumed in various country, method for inserting or replacing in-program ads which are appropriate to national/regional environment seems needed. For this, this paper proposes measures to insert in-program ads on hybrid broadcast environment based on MMT, next generation broadcasting standard. This paper analyzed structure of MMT, designed a system for verifying the proposed system and showed the result of experiment.

Novel Compressed Sensing Techniques for Realistic Image (실감 영상을 위한 압축 센싱 기법)

  • Lee, Sun Yui;Jung, Kuk Hyun;Kim, Jin Young;Park, Gooman
    • Journal of Satellite, Information and Communications
    • /
    • v.9 no.3
    • /
    • pp.59-63
    • /
    • 2014
  • This paper describes the basic principles of 3D broadcast system and proposes new 3D broadcast technology that reduces the amount of data by applying CS(Compressed Sensing). Differences between Sampling theory and the CS technology concept were described. Recently proposed CS algorithm AMP(Approximate Message Passing) and CoSaMP(Compressive Sampling Matched Pursuit) were described. This paper compared an accuracy between two algorithms and a calculation time that image data compressed and restored by these algorithms. As result determines a low complexity algorithm for 3D broadcast system.

Security Architecture for T4 Class Common Data Link

  • Lee, Sang-Gon;Lee, Hoon-Jae;Kim, Hyeong-Rag;Ryu, Young-Jae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.8
    • /
    • pp.63-72
    • /
    • 2017
  • In this paper, we propose a security architecture for HDLC-based T4 class common data link. The common data links are composed of point-to-point, multi-to-point, and point-to-multi mode. For multi-to-point mode, one node has a bundle of point-to-point links with different end-point on the other side of the links. Thus multi-to-point mode can be considered as a bundle of point-to-point mode. Point-to-multi mode is broadcasting link. For point-to-point mode we adopted robust security network scheme to establish a secure data link, and for multi-to-point mode we use broadcast encryption scheme based on ID-based cryptography to distribute encryption key for broadcasting message encryption. We also included MACsec technology for point-to-point data link security. Computational and communicational complexity analysis on the broadcast encryption have been done.

Random Early Beacon Broadcast (REB2) for Cooperative Vehicle Safety Applications (차량안전 응용을 위한 임의 조기 비컨방송)

  • Jeong, Han-You;Nguyen, Hoa-Hung
    • Journal of IKEEE
    • /
    • v.24 no.4
    • /
    • pp.1017-1021
    • /
    • 2020
  • In the V2X communications, each vehicle periodically broadcasts a message, called a beacon, so that its neighbor vehicles can accurately predict the near-future positions of the sending vehicle. In particular, the mobility-adaptive beacon broadcast (MAB2) scheme keeps the tracking error of a sending vehicle below a fixed threshold within a few consecutive beacon losses. In this paper, we present a random-early beacon broadcast (REB2) scheme that addresses the beacon aging problem of the MAB2 scheme. The simulation results show that, for a neighbor vehicle within 100 m distance, the tracking failure probability of REB2 scheme can be reduced to less than 1/10 of that of MAB2 scheme.

Operational Verification of Common Alert Protocol System and UHD Advanced Emergency Alert Table Service (표준 재난경보 발령 시스템과 UHD 재난경보 데이터 서비스 실증 시험)

  • Kwak, Chunsub;Suh, Young-Woo
    • The Journal of the Korea Contents Association
    • /
    • v.21 no.12
    • /
    • pp.296-301
    • /
    • 2021
  • This study is a study dealing with the empirical test of standardized multimedia disaster warning broadcasting linked with the next-generation prediction and warning platform and the disaster warning additional data service of terrestrial UHD broadcasting. The next-generation prediction and warning platform used in the demonstration test complies with the CAP-based TTA standardization standard, and the UHD disaster warning additional data service complies with the AEAT standard. As a result of the experiment, when a standardized CAP disaster warning message is issued and delivered to a broadcasting company, a system was established so that it is automatically converted to AEAT, a UHD disaster warning additional data message, and transmitted. The receiver unit was configured by connecting a set-top capable of receiving disaster alert data and a TV with an HDMI cable. When a disaster is announced, the set-top displays the AEAT message on the TV broadcasting screen, customized to the priority of the disaster and the area where it is issued. In addition, incoming messages are displayed in a language suitable for user settings among 5 languages. Additional multimedia functions such as images and alarm sounds could also be linked. In particular, it was confirmed that the receiver message was displayed within 3 seconds of issuing the disaster alert, enabling prompt delivery of the disaster alert.

Distance and Random-based Broadcast Scheme for Vehicle Safety Communication (차량 안전 통신을 위한 거리와 랜덤 기반 브로드캐스트 기법)

  • You, Jong-Duck;Jung, Sou-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.11
    • /
    • pp.69-76
    • /
    • 2008
  • Safety-related messages are propagated in form of broadcasting among vehicles in vehicle safety communication. There is the broadcast storm problem in high density vehicle environments. To solve this problem, a distance-based broadcast scheme has been proposed. It causes a serious problem such as retransmission delay in low density vehicle environments since it requires additional defer time to rebroadcast messages. This paper proposes a distance and random-based broadcast scheme. The proposed scheme selects a random time from zero to the defer time that estimated depending on the distance between sending and receiving vehicles. Simulation results show that the proposed scheme requires shorter defer time and less rebroadcasting message than existing schemes.

Hybrid Multipath Routing in Mobile Ad Hoc Networks (MANET환경에서 적용 가능한 복합적 다중 라우팅 기술)

  • Ninh, Khanhchi;Jung, Sou-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.2
    • /
    • pp.49-56
    • /
    • 2011
  • One of the most important VANET applications is providing active safety by broadcasting emergency messages. In order to prevent broadcast storm of flooding-based broadcasting scheme in which any node receiving message will rebroadcast, the existing protocols use the different methods to limit the number of relay nodes. Nevertheless, the existing protocols have low delivery ratio with high traffic density and cause message overhead. Currently, the dramatic increase in the number of vehicles equipped with Global Positioning System (GPS) and onboard radar created new application scenarios that were not feasible before. Consequently, we proposed a broadcasting protocol that selects relay node by using GPS-based position information and detecting neighboring vehicles with the help of onboard radar to. Simulation results show that our proposed protocol has better performance than the existing schemes.

Experimental Verification of the Versatility of SPAM-based Image Steganalysis (SPAM 기반 영상 스테그아날리시스의 범용성에 대한 실험적 검증)

  • Kim, Jaeyoung;Park, Hanhoon;Park, Jong-Il
    • Journal of Broadcast Engineering
    • /
    • v.23 no.4
    • /
    • pp.526-535
    • /
    • 2018
  • Many steganography algorithms have been studied, and steganalysis for detecting stego images which steganography is applied to has also been studied in parallel. Especially, in the case of the image steganalysis, the features such as ALE, SPAM, and SRMQ are extracted from the statistical characteristics of the image, and stego images are classified by learning the classifier using various machine learning algorithms. However, these studies did not consider the effect of image size, aspect ratio, or message-embedding rate, and thus the features might not function normally for images with conditions different from those used in the their studies. In this paper, we analyze the classification rate of the SPAM-based image stegnalysis against variety image sizes aspect ratios and message-embedding rates and verify its versatility.