liu.seSök publikationer i DiVA
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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
A flexible category-based collusion-resistant key management scheme for multicast
Linköpings universitet, Tekniska högskolan. Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik.
Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan.
Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Tekniska högskolan. (IDA/ADIT)ORCID-id: 0000-0002-9084-0470
2003 (Engelska)Ingår i: Security and privacy in the age of uncertainty: IFIP TC11 18th International Conference on Information Security (SEC2003) May 26-28, 2003, Athens, Greece / [ed] Dimitris Gritzalis; Sabrina De Capitani di Vimercati; Pierangela Samarati; Sokratis Katsikas, Kluwer Academic Publishers, 2003, s. 133-144Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Current key management schemes for multicast provide either no resistance to collusion or perfect resistance to collusion. However, resistance to collusion is achieved at the expense of efficiency in terms of the number of transmissions and the number of keys that are used. We argue that applications may have certain assumptions regarding the users and their access to the multicast channel that may be used to provide a broader range of choices for balancing efficiency against resistance to collusion.

We formalize the collusion requirement based upon the users' access to the multicast channel. Different user categorizations give different degrees of collusion resistance and we show that the existing work has focused on special cases of user categorizations. Further, we go on to propose and evaluate a flexible key management strategy for the general case where the accessibility relation defines the order of exclusion of the categories. The theoretical and experimental results show that our scheme has good performance regarding transmissions and keys per controller.

Ort, förlag, år, upplaga, sidor
Kluwer Academic Publishers, 2003. s. 133-144
Serie
IFIP - International Federation for Information Processing, ISSN 1571-5736 ; 122
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
URN: urn:nbn:se:liu:diva-59903DOI: 10.1007/978-0-387-35691-4_12ISI: 000184323200012ISBN: 978-1-4757-6489-5 (tryckt)ISBN: 978-0-387-35691-4 (tryckt)OAI: oai:DiVA.org:liu-59903DiVA, id: diva2:354010
Konferens
18th IFIP International Information Security Conference, 26-28 May 2003, Athens, Greece
Tillgänglig från: 2010-09-29 Skapad: 2010-09-29 Senast uppdaterad: 2018-01-12Bibliografiskt granskad
Ingår i avhandling
1. Security and trust mechanisms for groups in distributed services
Öppna denna publikation i ny flik eller fönster >>Security and trust mechanisms for groups in distributed services
2005 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

Group communication is a fundamental paradigm in modem distributed services, with applications in domains such as content distribution, distributed games, and collaborative workspaces. Despite the increasing interest in group-based services and the latest developments in efficient and reliable multi cast, the secure management of groups remains a major challenge for group communication.

In this thesis we propose security and trust mechanisms for supporting secure management of groups within the contexts of controlled and of self-organizing settings.

Controlled groups occur in services, such as multi cast software delivery, where an authority exists that enforces a group membership policy. In this context we propose a secure group key management approach which assures that only authorized users can access protected group resources. In order to scale to large and dynamic groups, the key management scheme must also be efficient. However, security and efficiency are competing requirements. We address this issue by proposing two flexible group key management schemes which can be configured to best meet the security and efficiency requirements of applications and services. One of the schemes can also be dynamically tuned, at system runtime, to adapt to possible requirement changes.

Self-organizing groups occur in services, such as those enabled by peer-to-peer (P2P) and wireless technologies, which adopt a decentralized architecture. In the context of self-organizing groups, with no authority to dictate and control the group members' interactions, group members might behave maliciously and attempt to subvert other members in the group. We address this problem by proposing a reputation-based trust management approach that enables group members to distinguish between well-behaving and malicious members.

We have evaluated our group key management and trust mechanisms analytically and through simulation. The evaluation of the group key management schemes shows cost advantages for rekeying and key storage. The evaluation of the reputation-based trust management shows that our trust metric is resilient to group members maliciously changing their behavior and flexible in that it supports different types of trust dynamics. As a proof of concept, we have incorporated our trust mechanism into a P2P-based intrusion detection system. The test results show an increase in system resiliency to attacks.

Ort, förlag, år, upplaga, sidor
Linköping: Linköping University Electronic Press, 2005. s. 22
Serie
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 979
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
urn:nbn:se:liu:diva-30648 (URN)16243 (Lokalt ID)91-85457-54-X (ISBN)16243 (Arkivnummer)16243 (OAI)
Disputation
2005-11-09, Visionen, hus B, Campus Valla, Linköpings universitet, Linköping, 10:15 (Engelska)
Tillgänglig från: 2009-10-09 Skapad: 2009-10-09 Senast uppdaterad: 2018-01-13Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Personposter BETA

Duma, ClaudiuShahmehri, NahidLambrix, Patrick

Sök vidare i DiVA

Av författaren/redaktören
Duma, ClaudiuShahmehri, NahidLambrix, Patrick
Av organisationen
Tekniska högskolanDatabas och informationsteknik
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 118 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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