Unconditionally Secure Broadcast Encryption Schemes with Trade-Offs between Communication and Storage

Access this Article

Author(s)

    • WATANABE Yohei
    • Graduate School of Environment and Information Sciences, Yokohama National University
    • SHIKATA Junji
    • Graduate School of Environment and Information Sciences, Yokohama National University|Institute of Advanced Sciences, Yokohama National University

Abstract

An (<i>≤n</i>,<i>≤ω</i>)-one-time secure broadcast encryption scheme (BES) allows a sender to choose <i>any</i> subset of receivers so that only the designated users can decrypt a ciphertext. In this paper, we first show an efficient construction of an (<i>≤n</i>,<i>≤ω</i>)-one-time secure BES with general ciphertext sizes. Specifically, we propose a generic construction of an (<i>≤n</i>,<i>≤ω</i>)-one-time secure BES from key predistribution systems (KPSs) when its ciphertext size is equal to integer multiple of the plaintext size, and our construction includes all known constructions. However, there are many possible combinations of the KPSs to realize the BES in our construction methodology, and therefore, we show that which combination is the best one in the sense that secret-key size can be minimized. Our (optimized) construction provides a <i>flexible</i> parameter setup (i.e. we can adjust the secret-key sizes) by setting arbitrary ciphertext sizes based on restrictions on channels such as channel capacity and channel bandwidth.

Journal

  • IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E99.A(6), 1097-1106, 2016

    The Institute of Electronics, Information and Communication Engineers

Codes

Page Top