Startsida
Hjälp
Sök i LIBRIS databas

     

 

Sökning: onr:htxq42f1fk8zlpk8 > Tree Structures in ...

Tree Structures in Broadcast Encryption [Elektronisk resurs]

Anderson, Kristin, 1977- (författare)
Ingemarsson, Ingemar (preses)
Löfvenberg, Jacob (preses)
Forchheimer, Robert (preses)
Smeets, Ben (opponent)
Linköpings universitet Institutionen för systemteknik (utgivare)
Linköpings universitet Tekniska högskolan (utgivare)
Publicerad: Institutionen för systemteknik, 2005
Engelska 95
Serie: Linköping Studies in Science and Technology. Thesis, 0280-7971 0280-7971 ; 1215
Läs hela texten
Läs hela texten
  • E-bokAvhandling(Lic.-avh. Linköping : Linköpings universitet, 2005)
Sammanfattning Ämnesord
Stäng  
  • 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. 

Ämnesord

Natural Sciences  (hsv)
Computer and Information Sciences  (hsv)
Information Systems  (hsv)
Naturvetenskap  (hsv)
Data- och informationsvetenskap  (hsv)
Systemvetenskap, informationssystem och informatik  (hsv)
SOCIAL SCIENCES  (svep)
Statistics, computer and systems science  (svep)
Informatics, computer and systems science  (svep)
Information technology  (svep)
SAMHÄLLSVETENSKAP  (svep)
Statistik, data- och systemvetenskap  (svep)
Informatik, data- och systemvetenskap  (svep)
Informationsteknologi  (svep)

Genre

government publication  (marcgt)

Indexterm och SAB-rubrik

Broadcast encryption
Subset Difference
tree structure
Inställningar Hjälp

Titeln finns på 1 bibliotek. 

Övriga bibliotek (1)

Ange som favorit
Om LIBRIS
Sekretess
Blogg
Hjälp
Fel i posten?
Kontakt
Teknik och format
Sök utifrån
Sökrutor
Plug-ins
Bookmarklet
Anpassa
Textstorlek
Kontrast
Vyer
LIBRIS söktjänster
SwePub
Sondera
Uppsök

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 - Nationella bibliotekssystem

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy