Reducing Receiver's Storage in CS, SD and LSD Broadcast Encryption Schemes(Application)(<Special Section>Cryptography and Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• This paper deals with broadcast encryption schemes, in which a sender can send information securely to a group of receivers excluding some receivers over a broadcast channel. In this paper we propose modifications of the Complete Subtree (CS), the Subset Difference (SD) and the Layered Subset Difference (LSD) methods based on the Master Key Tree (MKT). Our modifications eliminate log N keys or labels from receivers' storage, in exchange for an increase in the computational overhead, where N is the total number of receivers. We also propose modifications of the SD and LSD methods by applying the Trapdoor One-way Permutation Tree (TOPT) which is originally proposed in order to modify the CS method. Our modifications based on TOPT also eliminate log N labels, and the computational cost is much smaller than MKT based methods.

• 2005-01-01

著者

• Asano Tomoyuki

  Sony Corporation

関連論文

• Reducing Receiver's Storage in CS, SD and LSD Broadcast Encryption Schemes(Application)(Cryptography and Information Security)
• A Lightweight Tree Based One-Key Broadcast Encryption Scheme(Information Security)

スポンサーリンク