• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • 1
  • Tagged with
  • 3
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

DTLS Adaptation for Efficient Secure Group Communication

Nikitin, Kirill January 2015 (has links)
The Internet has been growing rapidly during the past threedecades, evolving into a new paradigm called the Internet ofThings where all electronic devices are to be connected tothe global network. One of the most crucial needs forcommunication in this future global network is assuring its security.Datagram Transport Layer Security is a de facto standard protocolto secure end-to-end communication in the IoT. However, there isalso an increasing need for secure and efficient groupcommunication due to the frequently resource-constrained IoTenvironment. A DTLS adaptation for multicast communication hasbeen already proposed but protection of responses to multicastrequests has not been fully addressed yet. Furthermore, there is nopublicly available implementation of this adaptation. This thesis work is conducted in collaboration with SICS SwedishICT which is a research organization with a focus on appliedComputer Science. We have implemented the existing DTLS-basedapproach for multicast communication for the Contiki OS. We havealso implemented an approach for efficient response protectionthat was initially proposed at SICS and that we analyse andenhance in this thesis. Finally, we have experimentally evaluatedour and other approaches on a constrained hardware platform interms of memory requirements, communication performance andenergy consumption. We demonstrate advantages of our approachbased upon obtained results. / Internet har vuxit snabbt under de tre senaste decennierna, ochutvecklas till ett nytt paradigm kallat Internet of Things där allaelektroniska enheter kopplas till det globala nätverket. Ett av deviktigaste behoven för kommunikation i detta framtida globalanätverk är att garantera säkerhet. Datagram Transport LayerSecurity protokollet är en de facto-standard för säker end-to-endkommunikation i IoT. Det finns emellertid också ett ökande behovav säker och effektiv gruppkommunikation på grund av att IoTmiljöni regel är resursbegränsad. En anpassning av DTLS förmulticast-kommunikation har föreslagits men skydd av svar påmulticast-förfrågningar har ännu inte till fullo behandlats.Dessutom finns ingen offentligt tillgänglig implementation av dennaanpassning. Detta examensarbete utförs i samarbete med SICS Swedish ICTsom är en forskningsorganisation med fokus på tillämpaddatavetenskap. Vi har implementerat den existerande DTLSbaseradelösningen för multicast-kommunikation föroperativsystemet Contiki. Vi har också implementerat en lösningför effektivt skydd av svar på förfrågningar som ursprungligenföreslogs hos SICS och som vi analyserar och förbättrar i dettaexamensarbete. Slutligen har vi experimentellt utvärderat vår ochandra metoder på en begränsad hårdvaruplattform när det gällerminnesbehov, kommunikationsprestanda och energiförbrukning. Vivisar fördelar med vår metod baserat på de erhållna resultaten.
2

Efficient Group Key Management for Internet of Things

Rizki, Kiki January 2016 (has links)
The Internet of Things has become the next big step of a general Internetevolution, and conveys the assurance of security as one of the biggest challenge.In particular, use cases and application scenarios that adopt groupcommunication schemes need to be properly secured, in order to protect themessage exchange among group members from a number of security attacks.A typical way to achieve secure group communication relies on the adoptionof a symmetric group key shared among all the group members. This in turnrequires to rely on a group key management scheme, which is responsible forrevoking and renewing the group key when nodes join or leave the group.Due to the resource-constrained nature of typical IoT devices, the adoptedgroup key management scheme should be ecient and highly scalable withthe group size.This thesis project has been conducted in collaboration with SICS SwedishICT, a research institute with focus on applied computer science. We haveimplemented an ecient group key management protocol initially proposedand designed by SICS, considering the Contiki operating system and resourceconstrainedIoT platforms. We have also experimentally evaluated the protocolin terms of storage overhead, communication overhead, energy consumptionand total required rekeying time. / Internet of Things har blivit nästa stora steg i en generell utveckling avInternet, där en av de största utmaningarna är att garantera säkerhet.Speciellt användningsfall och applikationsscenarion som använder metoderför gruppkommunikation måste vara ordentligt säkrade, för att kunna skyddautbyte av meddelanden mellan gruppens medlemmar från ett antal attackscenarion.Ett vanligt sätt att uppnå säker gruppkommunikation baseras på användningav en symmetrisk gruppnyckel som delas av alla gruppens medlemmar.Detta i sin tur gör det nödvändigt att förlita sig på ett system för hanteringav gruppnycklar, vilket är ansvarigt för återkallning och förnyelse av nycklarnär noder går med i eller lämnar gruppen.På grund av att typiska IoT enheter har begränsade resurser måste metodensom används för hantering av gruppnycklar vara eektiv och mycketskalbar med gruppstorleken.Denna masteruppsats har utförts i samarbetet med SICS Swedish ICT,ett forskningsinstitut med fokus på applicerad datavetenskap. Vi har implementeratett eektiv protokoll för hantering av gruppnycklar ursprungligenframtaget och designat av SICS, med operativsystemet Contiki och resursbegränsade IoT-plattformar i åtanke. Vi har också experimentellt utvärderatprotokollet med hänsyn till overhead för datalagring, overhead för kommunikation,energikonsumtion och den totala tiden som krävs för förnyelse avnycklar.
3

Algorithms For Efficient Implementation Of Secure Group Communication Systems

Rahul, S 11 1900 (has links)
A distributed application may be considered as a set of nodes which are spread across the network, and need to communicate with each other. The design and implementation of these distributed applications is greatly simplified using Group Communication Systems (GCSs) which provide multipoint to multipoint communication. Hence, GCSs can be used as building blocks for implementing distributed applications. The GCS is responsible for reliable delivery of group messages and management of group membership. The peer-to-peer model and the client-server model are the two models of distributed systems for implementing GCSs. In this thesis, our focus is on improving the capability of GCS based on the client-server model. Security is an important requirement of many distributed applications. For such applications, security has to be provided m the GCS itself. The security of a GCS includes confidentiality, authentication and non-repudiation of messages, and ensuring that the GCS is properly meeting its guarantees. The complexity and cost of implementation of the above three types of security guarantees greatly depend on whether the GCS servers are trusted by the group members or not. Making use of the GCS services provided by untrusted GCS servers becomes necessary when the GCS servers are managed by a third party. In this thesis, we have proposed algorithms for ensuring the above three security guarantees for GCSs in which servers are not trusted. As part of the solution, we have proposed a new digital multisignature scheme which allows group members to verify that a message has indeed been signed by all group members. The various group key management algorithms proposed in literature differ from each other with respect to the following four metrics: communication overhead, computational overhead, storage at each member and distribution of load among group members. We identify the need for a distributed group key management algorithm which minimizes the computational overhead on group members and propose an algorithm to achieve it.

Page generated in 0.1439 seconds