liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Security and trust mechanisms for groups in distributed services
Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
2005 (English)Doctoral thesis, comprehensive summary (Other academic)
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.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press , 2005. , 22 p.
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 979
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-30648Local ID: 16243ISBN: 91-85457-54-X (print)OAI: oai:DiVA.org:liu-30648DiVA: diva2:251471
Public defence
2005-11-09, Visionen, hus B, Campus Valla, Linköpings universitet, Linköping, 10:15 (English)
Available from: 2009-10-09 Created: 2009-10-09 Last updated: 2012-12-10Bibliographically approved
List of papers
1. A flexible category-based collusion-resistant key management scheme for multicast
Open this publication in new window or tab >>A flexible category-based collusion-resistant key management scheme for multicast
2003 (English)In: 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, 133-144 p.Conference paper, Published paper (Refereed)
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.

Place, publisher, year, edition, pages
Kluwer Academic Publishers, 2003
Series
IFIP - International Federation for Information Processing, ISSN 1571-5736 ; 122
National Category
Computer Science
Identifiers
urn:nbn:se:liu:diva-59903 (URN)10.1007/978-0-387-35691-4_12 (DOI)000184323200012 ()978-1-4757-6489-5 (ISBN)978-0-387-35691-4 (ISBN)
Conference
18th IFIP International Information Security Conference, 26-28 May 2003, Athens, Greece
Available from: 2010-09-29 Created: 2010-09-29 Last updated: 2016-12-08Bibliographically approved
2. Efficient storage for category-based group key management
Open this publication in new window or tab >>Efficient storage for category-based group key management
2004 (English)In: Proceedings of the 5th Conference on Computer Science and Systems Engineering in Linköping, 2004, 139-146 p.Conference paper, Published paper (Refereed)
Abstract [en]

In multicast group communication, efficiency- and security are competing requirements and balancing them is an acknowledged challenge. In particular, the collusion resistance has an impact on the efficiency of any scheme. In this context, the category-based group key management (category-based GKM) scheme balances the collusion resistance constraints against the communication cost and the group controller storage. However, this scheme increases the storage requirements for users. In this paper we address this problem by introducing a novel technique based on spanning hash key tree (SKT). In the worst case, using our t echnique, the storage requirement remains the same as in the original category-based GKM scheme. However, the experimentalresults show that, in general, the SKT technique greatly reduces the key storage for the users as well as for the controller.

Keyword
group communication, security, efficiency, tradeoffs
National Category
Computer Science
Identifiers
urn:nbn:se:liu:diva-22782 (URN)2114 (Local ID)2114 (Archive number)2114 (OAI)
Conference
5th Conference on Computer Science and Systems Engineering in Linköping, Norrköping, Sweden, October, 2004
Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2015-02-18
3. A hybrid key tree scheme for multicast to balance security and efficiency requirement
Open this publication in new window or tab >>A hybrid key tree scheme for multicast to balance security and efficiency requirement
2003 (English)In: Proceedings of the Twelfth IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE '03), Institute of Electrical and Electronics Engineers (IEEE), 2003, 208-213 p.Conference paper, Published paper (Refereed)
Abstract [en]

Security and efficiency of rekeying are crucial requirements for multicast key management. However, the two requirements pull in different directions and balancing them to meet the application needs is still an open issue. In this paper we introduce a hybrid key tree scheme to balance security, namely the resistance to collusion, and the efficiency. The resistance to collusion is measured by an integer parameter. The communication and the storage requirements for the controller depend on this parameter too, and they decrease as the resistance to collusion is relaxed. We analytically evaluate the efficiency of our scheme and compare with the previous work. The results show that our scheme allows a fine-tuning of security requirements versus efficiency requirements at run-time, which is not possible with the previous key management schemes.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2003
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-59904 (URN)10.1109/ENABL.2003.1231409 (DOI)000186183900037 ()0769519636 (ISBN)
Conference
Twelfth IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, 9-11 June, Linz, Austria, 2003
Available from: 2010-09-29 Created: 2010-09-29 Last updated: 2016-12-06Bibliographically approved
4. Resilient trust for peer-to-peer based critical information infrastructures
Open this publication in new window or tab >>Resilient trust for peer-to-peer based critical information infrastructures
2004 (English)In: Proceedings of the 2nd International Conference on Critical Infrastructures (CRIS 2004), Grenoble, France: International Institute for Critical Infrastructure , 2004Conference paper, Published paper (Refereed)
Abstract [en]

Critical information infrastructures (CII) include the information technologies, telecommunication, and the Internet. The protection of CII is a paramount task, as other critical infrastructures (e.g. power grids, banking, and finance) become increasingly dependent on information services. Fault tolerance, scalability, self management, and self healing are some of the main requirements for the information-based critical services. These requirements can be addressed by the emerging peer-to-peer (P2P) technologies. The P2P architectural paradigm distributes the functionality, previously centralized into servers, to all the peers into the network. This approach has the advantage of avoiding bottlenecks and single point of failure making P2P networks robust and resilient to attacks. However, decentralization and distribution of P2P systems raise t he question of trust: how to distinguish the trustworthy peers from malicious ones. In this paper we analyze the resiliency of the existing reputation-based trust management mechanisms and identify the open problems to be addressed in order to provide the degree of resiliency necessary to critical information infrastructures.

Place, publisher, year, edition, pages
Grenoble, France: International Institute for Critical Infrastructure, 2004
Keyword
security, trust, critical information infrastructure, peer-to-peer
National Category
Computer Science
Identifiers
urn:nbn:se:liu:diva-22754 (URN)2072 (Local ID)2072 (Archive number)2072 (OAI)
Conference
2nd International Conference on Critical Infrastructures (CRIS 2004), Grenoble, France, October, 2004
Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2012-12-10
5. Dynamic trust metrics for peer-to-peer systems
Open this publication in new window or tab >>Dynamic trust metrics for peer-to-peer systems
2005 (English)In: Proceedings of the Sixteenth International Workshop on Database and Expert Systems Applications, 2005, Los Alamitos, CA, USA: IEEE Computer Society, 2005, 776-781 p.Conference paper, Published paper (Refereed)
Abstract [en]

One of the fundamental challenges for peer-to-peer (P2P) systems is the ability to manage risks involved in interacting and collaborating with priorly unknown and potentially malicious parties. Reputation-based trust management can mitigate this risk by deriving the trustworthiness of a certain peer from that peer's behavior history. However, the existing reputation systems do not provide an adequate reaction to quick changes in peers' behavior, raising serious concerns regarding their effectiveness in coping with dynamic malicious peers.

In this paper we investigate the requirements on the dynamics of trust in P2P systems and propose a versatile trust metric which satisfies these requirements. In particular, our proposed metric is able to detect and penalize both the sudden changes in peers' behavior and their potential oscillatory malicious behavior. Moreover, our metric is flexible and allows the implementation of different types of trust dynamics. We evaluate our metric through simulation and show its unique features and advantages over the existing metrics.

Place, publisher, year, edition, pages
Los Alamitos, CA, USA: IEEE Computer Society, 2005
National Category
Computer Science
Identifiers
urn:nbn:se:liu:diva-30649 (URN)16244 (Local ID)0-7695-2424-9 (ISBN)16244 (Archive number)16244 (OAI)
Conference
Sixteenth International Workshop on Database and Expert Systems Applications, 22-26 August, 2005, Copenhagen, Denmark
Available from: 2009-10-09 Created: 2009-10-09 Last updated: 2012-12-10
6. A trust aware peer-to-peer based overlay architecture for intrusion detection
Open this publication in new window or tab >>A trust aware peer-to-peer based overlay architecture for intrusion detection
Show others...
(English)Manuscript (preprint) (Other academic)
Abstract [en]

Traditional intrusion detection systems (IDS) are centralized and focused on protecting well bounded network regions. In contrast, current Internet attacks are highly distributed, spanning very large and dispersed regions of the Internet. This renders the deployed intrusion detection approaches inferior and limited in comparison to the attackers' capabilities. In this paper we propose a novel trust-aware peer-to-peer (P2P) based Overlay IDS architecture which is able tocoordinate and concert the detection capabilities of individual and formerly isolated IDSs, thereby increasing the overall effectiveness againstcurrent Internet attacks. The Overlay lDS is fully decentralized, thus avoiding the single point of failure problem characteristic to many other distributed lDS solutions. Moreover, we design an adaptive trust management mechanism which makes the Overlay IDS resilient to possible malicious peers infiltrating the overlay network. We have implemented our proposed Overlay lDS using JXTA P2P framework and we have evaluated its effectiveness for preventing the spread of a real Internet worm over an emulated network. As indicated by the evaluationresults, the use of our Overlay IDS significantly increases the overall survival rate of the network.

National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-86193 (URN)
Note

This manuscript will not be published.

Available from: 2012-12-10 Created: 2012-12-10 Last updated: 2017-01-17

Open Access in DiVA

No full text

Authority records BETA

Duma, Claudiu

Search in DiVA

By author/editor
Duma, Claudiu
By organisation
Department of Computer and Information ScienceThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 147 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf