This thesis is centered around the problem of broadcast encryption. It considers a setting with one or more senders wanting to securely distribute messages, using a one-way broadcast channel, to a selected set of receivers.This can be achieved using encryption and one part of the problem is to decide which user should have what decryption key(s). An example of the scenario described above is the distribution of pay-TV where the distributors want only the paying subscribers to be able to decrypt and view their broadcasts. Another application area is in military or civilian TETRA1 net-works…
Contents
1 Introduction
1.1 Outline of the Thesis
2 The Broadcast Encryption Problem
2.1 Terminology and Notation
2.1.1 Trees
2.2 Evaluation Parameters
2.3 Scope
3 Broadcast Encryption Schemes
3.1 Simple Schemes
3.2 Stateful Schemes
3.2.1 Logical Key Hierarchy
3.2.2 Other Stateful Schemes
3.3 Stateless Schemes
3.3.1 Fiat and Naor’s Schemes
3.3.2 Complete Subtree
3.3.3 Subset Difference
3.3.4 Other Stateless Schemes
3.4 Hybrid Schemes
4 Effects of Adjacency
4.1 Terminology and Notation
4.2 A General Upper Bound
4.3 Specific Cases of Few Transitions
4.3.1 One Transition
4.3.2 Two Transitions
4.3.3 Three Transitions
4.4 A General Lower Bound
4.5 Results and Conclusions
5 Structural Properties
5.1 Equivalent Trees
5.2 Equivalence Classes
5.2.1 Complement Classes
5.3 Permutation Groups
5.3.1 Conjugacy Classes and Equivalence Classes
5.4 Structural Properties of the SD Scheme
5.4.1 Equivalence Classes and Transitions
5.4.2 Equivalence Classes and Transmissions
5.5 Results and Conclusions
6 Allowing Errors
6.1 Distortion
6.1.1 Definitions
6.1.2 Distortion and Cost in Broadcast Encryption
6.2 Tradeoff Between Cost and Distortion
6.2.1 A Greedy Algorithm
6.2.2 A Randomized but Predictable Algorithm
6.2.3 A Randomized Unpredictable Algorithm
6.3 Possibilities for Future Research
7 Conclusions and FutureWork
7.1 Conclusions and Discussion
7.2 Suggestions for FutureWork
7.2.1 Effects of Adjacency
7.2.2 Structural Properties
7.2.3 Allowing Errors
References
Author: Anderson, Kristin
Source: Linköping University
Download URL 2: Visit Now