Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Tree Structures in Broadcast Encryption
Linköpings universitet, Institutionen för systemteknik, Informationsteori. Linköpings universitet, Tekniska högskolan.
2005 (Engelska)Licentiatavhandling, monografi (Övrigt vetenskapligt)
Abstract [en]

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.

Ort, förlag, år, upplaga, sidor
Institutionen för systemteknik , 2005. , 95 s.
Serie
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1215
Nyckelord [en]
Broadcast encryption, Subset Difference, tree structure
Nationell ämneskategori
Systemvetenskap
Identifikatorer
URN: urn:nbn:se:liu:diva-4651ISBN: 91-85457-83-3 (tryckt)OAI: oai:DiVA.org:liu-4651DiVA: diva2:20669
Presentation
2005-12-09, Key 1, Keyhuset, Campus Valla, Linköpings universitet, Linköping, 13:15 (Engelska)
Opponent
Handledare
Anmärkning
Report code: LIU-Tek-Lic-2005:70.Tillgänglig från: 2005-11-17 Skapad: 2005-11-17 Senast uppdaterad: 2009-02-12

Open Access i DiVA

fulltext(1087 kB)1566 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 1087 kBChecksumma SHA-1
b92ae2e8fb4b4d70fb893210657e4fcab43a7cc8acff0ec750106b4fe3b846c399e1f3e0
Typ fulltextMimetyp application/pdf

Sök vidare i DiVA

Av författaren/redaktören
Anderson, Kristin
Av organisationen
InformationsteoriTekniska högskolan
Systemvetenskap

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 1566 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

Totalt: 1132 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf