onr:"swepub:oai:DiVA.org:liu-4651"
Search: onr:"swepub:oai:DiVA.org:liu-4651" > Tree Structures in ...
- 1 of 1
- Previous record
- Next record
- To hitlist
Tree Structures in Broadcast Encryption
-
- Anderson, Kristin, 1977- (author)
- Linköpings universitet,Informationsteori,Tekniska högskolan
-
- Ingemarsson, Ingemar (thesis advisor)
- Linköpings universitet,Institutionen för systemteknik,Tekniska högskolan
-
- Löfvenberg, Jacob (thesis advisor)
- Linköpings universitet,Informationsteori,Tekniska högskolan
- show more...
- show less...
- (creator_code:org_t)
- ISBN 9185457833
- Institutionen för systemteknik, 2005
- English 83 s.
- Series: Linköping Studies in Science and Technology. Thesis, 0280-7971 ; 1215
- Licentiate thesis (other academic/artistic)
Abstract
Subject headings
Close
- The need for broadcast encryption arises when a sender wishes to securely distribute messages to varying subsets of receivers, using a broadcast channel, for instance in a pay-TV scenario. This is done by selecting subsets of users and giving all users in the same subset a common decryption key. The subsets will in general be overlapping so that each user belongs to many subsets and has several different decryption keys. When the sender wants to send a message to some users, the message is encrypted using keys that those users have. In this thesis we describe some broadcast encryption schemes that have been proposed in the literature. We focus on stateless schemes which do not require receivers to update their decryption keys after the initial keys have been received; particularly we concentrate on the Subset Difference (SD) scheme.We consider the effects that the logical placement of the receivers in the tree structure used by the SD scheme has on the number of required transmissions for each message. Bounds for the number of required transmissions are derived based on the adjacency of receivers in the tree structure. The tree structure itself is also studied, also resulting in bounds on the number of required transmissions based on the placement of the users in the tree structure.By allowing a slight discrepancy between the set of receivers that the sender intends to send to and the set of receivers that actually can decrypt the message, we can reduce the cost in number of transmissions per message. We use the concept of distortion to quantify the discrepancy and develop three simple algorithms to illustrate how the cost and distortion are related.
Subject headings
- NATURVETENSKAP -- Data- och informationsvetenskap -- Systemvetenskap, informationssystem och informatik (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Information Systems (hsv//eng)
Keyword
- Broadcast encryption
- Subset Difference
- tree structure
- Information technology
- Informationsteknologi
Publication and Content Type
- vet (subject category)
- lic (subject category)
Find in a library
- Tree Structures in Broadcast Encryption (Search the publication in LIBRIS)
To the university's database
- 1 of 1
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Anderson, Kristi ...
- Ingemarsson, Ing ...
- Löfvenberg, Jaco ...
- Forchheimer, Rob ...
- Smeets, Ben
- About the subject
-
- NATURAL SCIENCES
- NATURAL SCIENCES
- and Computer and Inf ...
- and Information Syst ...
- Parts in the series
- Linköping Studie ...
- By the university
- Linköping University
Search outside SwePub
- Extend your search to:
- Google Book Search
- Google Scholar
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
- Copyright © LIBRIS - National Library Systems
- LIBRIS.kb.se
