The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] DCA(288hit)

1-20hit(288hit)

  • Outsider-Anonymous Broadcast Encryption with Keyword Search: Generic Construction, CCA Security, and with Sublinear Ciphertexts Open Access

    Keita EMURA  Kaisei KAJITA  Go OHTAKE  

     
    PAPER-Cryptography and Information Security

      Pubricized:
    2024/02/26
      Vol:
    E107-A No:9
      Page(s):
    1465-1477

    As a multi-receiver variant of public key encryption with keyword search (PEKS), broadcast encryption with keyword search (BEKS) has been proposed (Attrapadung et al. at ASIACRYPT 2006/Chatterjee-Mukherjee at INDOCRYPT 2018). Unlike broadcast encryption, no receiver anonymity is considered because the test algorithm takes a set of receivers as input and thus a set of receivers needs to be contained in a ciphertext. In this paper, we propose a generic construction of BEKS from anonymous and weakly robust 3-level hierarchical identity-based encryption (HIBE). The proposed generic construction provides outsider anonymity, where an adversary is allowed to obtain secret keys of outsiders who do not belong to the challenge sets, and provides sublinear-size ciphertext in terms of the number of receivers. Moreover, the proposed construction considers security against chosen-ciphertext attack (CCA) where an adversary is allowed to access a test oracle in the searchable encryption context. The proposed generic construction can be seen as an extension to the Fazio-Perera generic construction of anonymous broadcast encryption (PKC 2012) from anonymous and weakly robust identity-based encryption (IBE) and the Boneh et al. generic construction of PEKS (EUROCRYPT 2004) from anonymous IBE. We run the Fazio-Perera construction employs on the first-level identity and run the Boneh et al. generic construction on the second-level identity, i.e., a keyword is regarded as a second-level identity. The third-level identity is used for providing CCA security by employing one-time signatures. We also introduce weak robustness in the HIBE setting, and demonstrate that the Abdalla et al. generic transformation (TCC 2010/JoC 2018) for providing weak robustness to IBE works for HIBE with an appropriate parameter setting. We also explicitly introduce attractive concrete instantiations of the proposed generic construction from pairings and lattices, respectively.

  • Performance of Broadcast Channel Using Hierarchical Modulation in OFDM Downlink

    Daiki MITAMURA  Mamoru SAWAHASHI  Yoshihisa KISHIYAMA  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2023/03/22
      Vol:
    E106-B No:9
      Page(s):
    844-854

    This paper proposes a multiple code block transmission scheme using hierarchical modulation (HM) for a broadcast channel in the orthogonal frequency division multiplexing (OFDM) downlink. We investigate the average bit error rate (BER) performance of two-layer HM using 16 quadrature amplitude modulation (QAM) and three-layer HM using 64QAM in multipath Rayleigh fading channels. In multiple code block transmission using HM, the basic information bits are demodulated and decoded to all users within a cell that satisfy the bit error rate (BER) requirement. Hence, we investigate non-uniform QAM constellations to find one that suppresses the loss in the average BER of the basic information bits for HM to a low level compared to that using the original constellation in which only the basic information bits are transmitted while simultaneously minimizing the loss in the average BER of the secondary and tertiary information bits from the original constellations in which the information bits of the respective layers are transmitted alone. Based on the path loss equations in the Urban Macro and Rural Macro scenarios, we also investigate the maximum distance from a base station (BS) for the information bits of each layer to attain the required average received signal-to-noise power ratio (SNR) that achieves the average BER of 10-3.

  • Multi-Designated Receiver Authentication Codes: Models and Constructions

    Yohei WATANABE  Takenobu SEITO  Junji SHIKATA  

     
    PAPER-Cryptography and Information Security

      Pubricized:
    2022/09/30
      Vol:
    E106-A No:3
      Page(s):
    394-405

    An authentication code (A-code) is a two-party message authentication code in the information-theoretic security setting. One of the variants of A-codes is a multi-receiver authentication code (MRA-code), where there are a single sender and multiple receivers and the sender can create a single authenticator so that all receivers accepts it unless it is maliciously modified. In this paper, we introduce a multi-designated receiver authentication code (MDRA-code) with information-theoretic security as an extension of MRA-codes. The purpose of MDRA-codes is to securely transmit a message via a broadcast channel from a single sender to an arbitrary subset of multiple receivers that have been designated by the sender, and only the receivers in the subset (i.e., not all receivers) should accept the message if an adversary is absent. This paper proposes a model and security formalization of MDRA-codes, and provides constructions of MDRA-codes.

  • Adversarial Reinforcement Learning-Based Coordinated Robust Spatial Reuse in Broadcast-Overlaid WLANs

    Yuto KIHIRA  Yusuke KODA  Koji YAMAMOTO  Takayuki NISHIO  

     
    PAPER-Terrestrial Wireless Communication/Broadcasting Technologies

      Pubricized:
    2022/08/02
      Vol:
    E106-B No:2
      Page(s):
    203-212

    Broadcast services for wireless local area networks (WLANs) are being standardized in the IEEE 802.11 task group bc. Envisaging the upcoming coexistence of broadcast access points (APs) with densely-deployed legacy APs, this paper addresses a learning-based spatial reuse with only partial receiver-awareness. This partial awareness means that the broadcast APs can leverage few acknowledgment frames (ACKs) from recipient stations (STAs). This is in view of the specific concerns of broadcast communications. In broadcast communications for a very large number of STAs, ACK implosions occur unless some STAs are stopped from responding with ACKs. Given this, the main contribution of this paper is to demonstrate the feasibility to improve the robustness of learning-based spatial reuse to hidden interferers only with the partial receiver-awareness while discarding any re-training of broadcast APs. The core idea is to leverage robust adversarial reinforcement learning (RARL), where before a hidden interferer is installed, a broadcast AP learns a rate adaptation policy in a competition with a proxy interferer that provides jamming signals intelligently. Therein, the recipient STAs experience interference and the partial STAs provide a feedback overestimating the effect of interference, allowing the broadcast AP to select a data rate to avoid frame losses in a broad range of recipient STAs. Simulations demonstrate the suppression of the throughput degradation under a sudden installation of a hidden interferer, indicating the feasibility of acquiring robustness to the hidden interferer.

  • Broadcast with Tree Selection from Multiple Spanning Trees on an Overlay Network Open Access

    Takeshi KANEKO  Kazuyuki SHUDO  

     
    PAPER-Network

      Pubricized:
    2022/08/16
      Vol:
    E106-B No:2
      Page(s):
    145-155

    On an overlay network where a number of nodes work autonomously in a decentralized way, the efficiency of broadcasts has a significant impact on the performance of distributed systems built on the network. While a broadcast method using a spanning tree produces a small number of messages, the routing path lengths are prone to be relatively large. Moreover, when multiple nodes can be source nodes, inefficient broadcasts often occur because the efficient tree topology differs for each node. To address this problem, we propose a novel protocol in which a source node selects an efficient tree from multiple spanning trees when broadcasting. Our method shortens routing paths while maintaining a small number of messages. We examined path lengths and the number of messages for broadcasts on various topologies. As a result, especially for a random graph, our proposed method shortened path lengths by approximately 28% compared with a method using a spanning tree, with almost the same number of messages.

  • DRoF-Based Optical Video Re-Transmission System with Adaptive Combination Compression for Rain Attenuated Satellite Broadcast Signals Open Access

    Ryota SHIINA  Toshihito FUJIWARA  Tomohiro TANIGUCHI  Shunsuke SARUWATARI  Takashi WATANABE  

     
    PAPER-Fiber-Optic Transmission for Communications

      Pubricized:
    2022/04/06
      Vol:
    E105-B No:9
      Page(s):
    1023-1032

    In order to further reduce the transmission rate of multi-channel satellite broadcast signals, whose carrier-to-noise ratio (CNR fluctuates due to rainfall attenuation, we propose a novel digitized radio-over-fiber (DRoF) -based optical re-transmission system based on adaptive combination compression for ultra-high definition (UHD) broadcasting satellite (BS)/communications satellite (CS) broadcast signals. The proposed system reduces the optical re-transmission rate of BS/CS signals as much as possible while handling input CNR fluctuations. Therefore, the transmission rate of communication signals in time-division multiplexing (TDM) transmission is ensured, and network sharing of communication signals and broadcast signals via passive optical network (PON) is realized. Based on the ITU-R P.618-13 prediction model, an experimental evaluation is performed using estimates of the long-term statistics of attenuation due to rainfall. The attenuation is evaluated as a percentage of the time that long-term re-transmission service is available. It is shown that the proposed system is able to accommodate a wide range of rainfall attenuation and achieve a 99.988% time percentage for the duration of service provision. In order to show the rate reduction effect of the proposed system, the quantization bit reduction effect as a function of the input CNR, which depends on rainfall attenuation, is experimentally confirmed. Experiments show that service operation time of 99.978% can be achieved by 3-bit transmission. This means a 62.5% reduction in transmission rate is realized compared to conventional fixed quantization. Furthermore, the average quantization bit number in our system for service operation times is 3.000, indicating that most service operation times are covered by just 3-bit transmission.

  • Rate Adaptation for Robust and Low-Latency Video Transmissions Using Multi-AP Wireless LAN

    Kazuma YAMAMOTO  Hiroyuki YOMO  

     
    PAPER

      Pubricized:
    2021/08/20
      Vol:
    E105-B No:2
      Page(s):
    177-185

    In this paper, we propose rate adaptation mechanisms for robust and low-latency video transmissions exploiting multiple access points (Multi-AP) wireless local area networks (WLANs). The Multi-AP video transmissions employ link-level broadcast and packet-level forward error correction (FEC) in order to realize robust and low-latency video transmissions from a WLAN station (STA) to a gateway (GW). The PHY (physical layer) rate and FEC rate play a key role to control trade-off between the achieved reliability and airtime (i.e., occupancy period of the shared channel) for Multi-AP WLANs. In order to finely control this trade-off while improving the transmitted video quality, the proposed rate adaptation controls PHY rate and FEC rate to be employed for Multi-AP transmissions based on the link quality and frame format of conveyed video traffic. With computer simulations, we evaluate and investigate the effectiveness of the proposed rate adaptation in terms of packet delivery rate (PDR), airtime, delay, and peak signal to noise ratio (PSNR). Furthermore, the quality of video is assessed by using the traffic encoded/decoded by the actual video encoder/decoder. All these results show that the proposed rate adaptation controls trade-off between the reliability and airtime well while offering the high-quality and low-latency video transmissions.

  • Privacy-Preserving System for Enriched-Integrated Service

    Kaisei KAJITA  Go OHTAKE  Kazuto OGAWA  

     
    PAPER

      Pubricized:
    2021/02/24
      Vol:
    E104-D No:5
      Page(s):
    647-658

    In this study, we propose a secure data-providing system by using a verifiable attribute-based keyword search (VABKS), which also has the functions of privacy preservation and feedback to providers with IP anonymous server. We give both theoretic and experimental result, which show that our proposed system is a secure system with real-time property. One potential application of the system is to Integrated Broadcast-Broadband (IBB) services, which acquire information related to broadcast programs via broadband networks. One such service is a recommendation service that delivers recommendations matching user preferences (such as to TV programs) determined from the user's viewing history. We have developed a real-time system outsourcing data to the cloud and performing keyword searches on it by dividing the search process into two stages and performing heavy processing on the cloud side.

  • Sequence-Based Schemes for Broadcast and Unicast under Frequency Division Duplex

    Fang LIU  Kenneth W. SHUM  Yijin ZHANG  Wing Shing WONG  

     
    INVITED PAPER-Communication Theory and Signals

      Vol:
    E104-A No:2
      Page(s):
    376-383

    We consider all-to-all broadcast and unicast among nodes in a multi-channel single-hop ad hoc network, with no time synchronization. Motivated by the hard delay requirement for ultra-reliable and low-latency communication (URLLC) in 5G wireless networks, we aim at designing medium access control (MAC) schemes to guarantee successful node-to-node transmission within a bounded delay. To provide a hard guarantee on the transmission delay, deterministic sequence schemes are preferred to probabilistic schemes such as carrier sense multiple access (CSMA). Therefore, we mainly consider sequence schemes, with the goal to design schedule sequence set to guarantee successful broadcast/unicast within a common sequence period. This period should be as short as possible since it determines an upper bound on the transmission delay. In previous works, we have considered sequence design under time division duplex (TDD). In this paper, we focus on another common duplex mode, frequency division duplex (FDD). For the FDD case, we present a lower bound on period of feasible sequence sets, and propose a sequence construction method by which the sequence period can achieve the same order as the lower bound, for both broadcast and unicast models. We also compare the sequence length for FDD with that for TDD.

  • Design and Implementation of Personalized Integrated Broadcast — Broadband Service in Terrestrial Networks

    Nayeon KIM  Woongsoo NA  Byungjun BAE  

     
    LETTER-Systems and Control

      Vol:
    E103-A No:12
      Page(s):
    1621-1623

    This article proposes a dynamic linkage service which is a specific service model of integrated broadcast — broadband services based ATSC 3.0. The dynamic linkage service is useful to the viewer who wants to continue watching programs using TV or their personal devices, even after the terrestrial broadcast ends due to the start of the next regular programming. In addition, we verify the feasibility of the proposed extended dynamic linkage service through developed emulation system based on ATSC 3.0. In consideration of the personal network capabilities of the viewer environment, the service was tested with 4K/2K Ultra HD and receiving the service was finished within 4 second over intranet.

  • Transmission System of 4K/8K UHDTV Satellite Broadcasting Open Access

    Yoichi SUZUKI  Hisashi SUJIKAI  

     
    INVITED PAPER

      Pubricized:
    2020/04/21
      Vol:
    E103-B No:10
      Page(s):
    1050-1058

    4K/8K satellite broadcasting featuring ultra-high definition video and sound was launched in Japan in 2018. This is the first 8K ultra high definition television (UHDTV) broadcasting in the world, with 16 times as many pixels as HDTV and 3D sound with 22.2ch audio. The large amount of information that has to be transmitted means that a new satellite broadcasting transmission system had to be developed. In this paper, we describe this transmission system, focusing on the technology that enables 4K/8K UHDTV satellite broadcasting.

  • A Long Delay Multipath Equalization Using High Frequency Resolution Spatial Filters for SDM MIMO-OFDM Systems

    Tomoaki TAKEUCHI  Masahiro OKANO  Kenichi TSUCHIDA  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2019/10/08
      Vol:
    E103-B No:4
      Page(s):
    476-484

    Long delay multipath is a major cause of the poor reception of digital terrestrial broadcasting signals. The direct solution to this problem in orthogonal frequency division multiplexing (OFDM) system is to make the guard interval (GI) longer than the maximum channel delay. However, given the wide variety in broadcasting channel characteristics, the worst case GI may be twice the value needed which decreases the spectral efficiency and service quality. Therefore, the solution must be implemented on the receiver side. For the next generation broadcasting system, this paper proposes a space division multiplexing (SDM) multiple-input multiple-output (MIMO)-OFDM receiver for a multipath environment whose maximum delay time exceeds the GI length. The proposed system employs the high frequency resolution spatial filters that have the same configuration as the conventional one but operate at four times higher frequency resolution. Computer simulation and laboratory test results are presented to show the effectiveness of the proposed system.

  • Cognition-Based Delay Analysis to Determine the Average Minimum Time Limit for Wireless Sensor Communications

    Kedir MAMO BESHER  Juan-Ivan NIETO-HIPÓLITO  Juan de Dios SÁNCHEZ LÓPEZ  Mabel VAZQUEZ-BRISENO  Raymundo BUENROSTRO MARISCAL  

     
    PAPER

      Pubricized:
    2019/12/26
      Vol:
    E103-D No:4
      Page(s):
    789-795

    End-to-end delay, aiming to realize how much time it will take for a traffic load generated by a Mobile Node (MN) to reach Sink Node (SN), is a principal objective of most new trends in a Wireless Sensor Network (WSN). It has a direct link towards understanding the minimum time delay expected where the packet sent by MN can take to be received by SN. Most importantly, knowing the average minimum transmission time limit is a crucial piece of information in determining the future output of the network and the kind of technologies implemented. In this paper, we take network load and transmission delay issues into account in estimating the Average Minimum Time Limit (AMTL) needed for a health operating cognitive WSN. To further estimate the AMTL based on network load, an end-to-end delay analysis mechanism is presented and considers the total delay (service, queue, ACK, and MAC). This work is proposed to answer the AMTL needed before implementing any cognitive based WSN algorithms. Various time intervals and cogitative channel usage with different application payload are used for the result analysis. Through extensive simulations, our mechanism is able to identify the average time intervals needed depending on the load and MN broadcast interval in any cognitive WSN.

  • Automatic Construction of a Large-Scale Speech Recognition Database Using Multi-Genre Broadcast Data with Inaccurate Subtitle Timestamps

    Jeong-Uk BANG  Mu-Yeol CHOI  Sang-Hun KIM  Oh-Wook KWON  

     
    PAPER-Speech and Hearing

      Pubricized:
    2019/11/13
      Vol:
    E103-D No:2
      Page(s):
    406-415

    As deep learning-based speech recognition systems are spotlighted, the need for large-scale speech databases for acoustic model training is increasing. Broadcast data can be easily used for database construction, since it contains transcripts for the hearing impaired. However, the subtitle timestamps have not been used to extract speech data because they are often inaccurate due to the inherent characteristics of closed captioning. Thus, we propose to build a large-scale speech database from multi-genre broadcast data with inaccurate subtitle timestamps. The proposed method first extracts the most likely speech intervals by removing subtitle texts with low subtitle quality index, concatenating adjacent subtitle texts into a merged subtitle text, and adding a margin to the timestamp of the merged subtitle text. Next, a speech recognizer is used to extract a hypothesis text of a speech segment corresponding to the merged subtitle text, and then the hypothesis text obtained from the decoder is recursively aligned with the merged subtitle text. Finally, the speech database is constructed by selecting the sub-parts of the merged subtitle text that match the hypothesis text. Our method successfully refines a large amount of broadcast data with inaccurate subtitle timestamps, taking about half of the time compared with the previous methods. Consequently, our method is useful for broadcast data processing, where bulk speech data can be collected every hour.

  • Characteristics and Applicability of Frequency Sharing Criteria in the Broadcasting Satellite Link Open Access

    Kazuyoshi SHOGEN  Thong PHAM VIET  

     
    PAPER-Satellite Communications

      Pubricized:
    2019/06/17
      Vol:
    E102-B No:12
      Page(s):
    2297-2303

    Two frequency sharing criteria for BSS (Broadcasting-Satellite Service) are enacted in Sect.1 of Annex 1 to Appendix 30 to Radio Regulations. These two criteria are pfd (power flux-density) and EPM (Equivalent Protection Margin) values. In this paper, the two criteria are compared and studied from the view point of applicability to the sharing cases between BSS and BSS. In particular, it is shown that in some cases, the EPM criterion contributes to alleviate the problem of “sensitive satellite network”, i.e., one that has relatively low transmission power and is very weak against interference and blocks the new satellite to enter. Disclaimer The views and positions expressed by the authors are strictly personal and do not constitute, nor can be interpreted as, the position of the International Telecommunication Union on the topics addressed in this paper.

  • 120-W Ku-Band GaN SSPA with Diode Linearizer for Future Broadcasting Satellites Open Access

    Masafumi NAGASAKA  Masaaki KOJIMA  Takuma TORII  Hiromitsu UTSUMI  Koji YAMANAKA  Shintaro SHINJO  Mitsuhiro SHIMOZAWA  Hisashi SUJIKAI  

     
    PAPER

      Vol:
    E102-C No:10
      Page(s):
    717-724

    Satellite broadcasting of 4K/8K ultra-high definition television (UHDTV) was launched in Japan in December 2018. Because this system uses the amplitude and phase shift keying (APSK) modulation scheme, there is a need to improve the non-linear characteristics of the satellite transponders. To meet this requirement, we have been developing a 120-W-class Ku-band solid state power amplifier (SSPA) as a replacement for the currently used traveling wave tube amplifier (TWTA). In this study, we developed a gallium-nitride (GaN) SSPA and linearizer (LNZ). The SSPA achieved an output power of 120W while maintaining a power added efficiency (PAE) of 31%. We evaluated the transmission performance of 16APSK in this SSPA channel in comparison with that in the TWTA channel.

  • Priority Broadcast Modeling of IEEE 802.11p MAC with Channel Switching Operation

    Daein JEONG  

     
    PAPER-Network

      Pubricized:
    2019/03/05
      Vol:
    E102-B No:9
      Page(s):
    1895-1903

    In this paper, we propose multidimensional stochastic modeling of priority broadcast in Vehicular Ad hoc Networks (VANET). We focus on the channel switching operation of IEEE 1609.4 in systems that handle different types of safety messages, such as event-driven urgent messages and periodic beacon messages. The model considers the constraints imposed by the channel switching operation. The model also reflects differentiated services that handle different types of messages. We carefully consider the delivery time limit and the number of transmissions of the urgent messages. We also consider the hidden node problem, which has an increased impact on broadcast communications. We use the model in analyzing the relationship between system variables and performance metrics of each message type. The analysis results include confirming that the differentiated services work effectively in providing class specific quality of services under moderate traffic loads, and that the repeated transmission of urgent message is a meaningful countermeasure against the hidden node problem. It is also confirmed that the delivery time limit of urgent message is a crucial factor in tuning the channel switching operation.

  • Rigorous Analytical Model of Saturated Throughput for the IEEE 802.11p EDCA

    Shintaro IKUMA  Zhetao LI  Tingrui PEI  Young-June CHOI  Hiroo SEKIYA  

     
    PAPER

      Pubricized:
    2018/10/15
      Vol:
    E102-B No:4
      Page(s):
    699-707

    The IEEE 802.11p Enhanced Distributed Channel Access (EDCA) is a standardization for vehicle-to-vehicle and road-to-vehicle communications. The saturated throughputs of the IEEE 802.11p EDCA obtained from previous analytical expressions differ from those of simulations. The purpose of this paper is to explain the reason why the differences appear in the previous analytical model of the EDCA. It is clarified that there is a special state wherein the Backoff Timer (BT) is decremented in the first time slot of after a frame transmission, which cannot be expressed in the previous Markov model. In addition, this paper proposes modified Markov models, which allow the IEEE 802.11p EDCA to be correctly analyzed. The proposed models describe BT-decrement procedure in the first time slot accurately by adding new states to the previous model. As a result, the proposed models provide accurate transmission probabilities of network nodes. The validity of the proposed models is confirmed by the quantitative agreements between analytical predictions and simulation results.

  • Flash Crowd Absorber for P2P Video Streaming

    Satoshi FUJITA  

     
    PAPER-Fundamentals of Information Systems

      Pubricized:
    2018/10/26
      Vol:
    E102-D No:2
      Page(s):
    261-268

    This paper proposes a method to absorb flash crowd in P2P video streaming systems. The idea of the proposed method is to reduce the time before a newly arrived node becoming an uploader by explicitly constructing a group of newly arrived nodes called flash crowd absorber (FCA). FCA grows continuously while serving a video stream to the members of the group, and it is explicitly controlled so that the upload capacity of the nodes is fully utilized and it attains a nearly optimal latency of the stream during a flash crowd. A numerical comparison with a naive tree-based scheme is also given.

  • Reliable Transmission Parameter Signalling Detection for DTMB-A Standard

    Jingjing LIU  Chao ZHANG  Changyong PAN  

     
    PAPER-Terrestrial Wireless Communication/Broadcasting Technologies

      Pubricized:
    2017/06/07
      Vol:
    E100-B No:12
      Page(s):
    2156-2163

    In the advanced digital terrestrial/television multimedia broadcasting (DTMB-A) standard, a preamble based on distance detection (PBDD) is adopted for robust synchronization and signalling transmission. However, traditional signalling detection method will completely fail to work under severe frequency selective channels with ultra-long delay spread 0dB echoes. In this paper, a novel transmission parameter signalling detection method is proposed for the preamble in DTMB-A. Compared with the conventional signalling detection method, the proposed scheme works much better when the maximum channel delay is close to the length of the guard interval (GI). Both theoretical analyses and simulation results demonstrate that the proposed algorithm significantly improves the accuracy and robustness of detecting the transmitted signalling.

1-20hit(288hit)