liu.seSearch for publications in DiVA
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet 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 (engelsk)Licentiatavhandling, monografi (Annet vitenskapelig)
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.

sted, utgiver, år, opplag, sider
Institutionen för systemteknik , 2005. , s. 95
Serie
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1215
Emneord [en]
Broadcast encryption, Subset Difference, tree structure
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-4651ISBN: 91-85457-83-3 (tryckt)OAI: oai:DiVA.org:liu-4651DiVA, id: diva2:20669
Presentation
2005-12-09, Key 1, Keyhuset, Campus Valla, Linköpings universitet, Linköping, 13:15 (engelsk)
Opponent
Veileder
Merknad
Report code: LIU-Tek-Lic-2005:70.Tilgjengelig fra: 2005-11-17 Laget: 2005-11-17 Sist oppdatert: 2018-01-13

Open Access i DiVA

fulltekst(1087 kB)1715 nedlastinger
Filinformasjon
Fil FULLTEXT01.pdfFilstørrelse 1087 kBChecksum MD5
b43a7cc8acff0ec750106b4fe3b846c399e1f3e0b92ae2e8fb4b4d70fb893210657e4fca
Type fulltextMimetype application/pdf

Personposter BETA

Anderson, Kristin

Søk i DiVA

Av forfatter/redaktør
Anderson, Kristin
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 1715 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

isbn
urn-nbn

Altmetric

isbn
urn-nbn
Totalt: 1300 treff
RefereraExporteraLink to record
Permanent link

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