Reducing Communication Overhead of the Subset Difference Scheme
| Autor: | Sanjay Bhattacherjee, Palash Sarkar |
|---|---|
| Přispěvatelé: | Laboratoire de l'Informatique du Parallélisme (LIP), Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon), Arithmetic and Computing (ARIC), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), Université de Lyon-École normale supérieure - Lyon (ENS Lyon)-Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Applied Statistics Unit, Indian Statistical Institute [Kolkata], École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL) |
| Jazyk: | angličtina |
| Rok vydání: | 2015 |
| Předmět: |
Binary tree
business.industry Computer science 020206 networking & telecommunications 0102 computer and information sciences 02 engineering and technology Encryption Binary logarithm 01 natural sciences Theoretical Computer Science Broadcasting (networking) Computational Theory and Mathematics 010201 computation theory & mathematics Hardware and Architecture Header 0202 electrical engineering electronic engineering information engineering Key (cryptography) Overhead (computing) [INFO]Computer Science [cs] Arithmetic business Broadcast encryption Software ComputingMilieux_MISCELLANEOUS Computer network |
| Zdroj: | IEEE Transactions on Computers IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2015 IEEE Transactions on Computers, 2015, 65 (8), pp.2575-2587. ⟨10.1109/TC.2015.2485231⟩ |
| ISSN: | 0018-9340 |
| DOI: | 10.1109/TC.2015.2485231⟩ |
| Popis: | In Broadcast Encryption (BE) systems like Pay-TV, AACS, online content sharing and broadcasting, reducing the header length (communication overhead per session) is of practical interest. The Subset Difference (SD) scheme due to Naor-Naor-Lotspiech (NNL) is the most popularly used BE scheme. We introduce the $(a,b,\gamma)$ augmented binary tree subset difference ( $(a,b,\gamma)$ -ABTSD) scheme which is a generalization of the NNL-SD scheme. By varying the parameters $(a,b,\gamma)$ , it is possible to obtain $O(n\log n)$ different schemes. The average header length achieved by the new schemes is smaller than all known schemes having the same decryption time as that of the NNL-SD scheme and achieving non-trivial trade-offs between the user storage and the header size. The amount of key material that a user is required to store increases. For the earlier mentioned applications, reducing header size and achieving fast decryption is perhaps more of a concern than the user storage. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|