• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 19
  • 3
  • 2
  • 1
  • Tagged with
  • 27
  • 14
  • 12
  • 9
  • 8
  • 8
  • 7
  • 6
  • 6
  • 6
  • 5
  • 5
  • 4
  • 4
  • 4
  • 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.
21

Supervision des réseaux pair à pair structurés appliquée à la sécurité des contenus

Cholez, Thibault 23 June 2011 (has links) (PDF)
L'objectif de cette thèse est de concevoir et d'appliquer de nouvelles méthodes de supervision capables d'appréhender les problèmes de sécurité affectant les données au sein des réseaux P2P structurés (DHT). Ceux-ci sont de deux types. D'une part les réseaux P2P sont utilisés pour diffuser des contenus illégaux dont l'activité est difficile à superviser. D'autre part, l'indexation des contenus légitimes peut être corrompue (attaque Sybil). Nous proposons tout d'abord une méthode de supervision des contenus basée sur l'insertion de sondes et le contrôle du mécanisme d'indexation du réseau. Celle-ci permet d'attirer l'ensemble des requêtes des pairs pour un contenu donné, puis de vérifier leur intention en générant des appâts très attractifs. Nous décrivons ainsi les faiblesses du réseau permettant la mise en œuvre de notre méthode en dépit des protections existantes. Nous présentons les fonctionnalités de notre architecture et en évaluons l'efficacité sur le réseau P2P KAD avant de présenter un déploiement réel ayant pour but l'étude des contenus pédophiles. Nous considérons ensuite la sécurité des données indexées dans une DHT. Nous supervisons le réseau KAD et montrons que celui-ci est victime d'une pollution particulièrement néfaste affectant 2/3 des fichiers mais aussi de nombreuses attaques ciblées affectant la sécurité des contenus stockés. Nous proposons un moyen de détecter efficacement cette dernière attaque en analysant la distribution des identifiants des pairs autour d'une référence ainsi qu'une contre-mesure permettant de protéger les pairs à un coût négligeable. Nous terminons par l'évaluation de la protection au sein de réseaux P2P réels.
22

Progressive primitivism race, gender and turn-of-the-century American art /

Hutchinson, Elizabeth West. January 1998 (has links)
Thesis (Ph. D.)--Stanford University, 1998. / UMI copy paged continuously. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 320-325).
23

Towards Engineering Trustworthy Distributed Reputation Systems Over The Blockchain

Grankvist, Georg, Moustakas, Paul January 2022 (has links)
Peer-to-peer (P2P) reputation systems, such as those used by eBay and Amazon, servean important role on the web, especially in E-commerce, as online reputation serves asa primary guiding factor for consumers in making informed decisions. The importanceof these systems, and also the increasing popularity of P2P and distributed systems, theissue of how to prevent and resist sybil and re-entry attacks becomes an important area ofresearch as they can impinge the integrity of those systems. To address this issue, in thisthesis, we propose an approach that encompasses a software architecture and processeswhich serves as a proof-of-concept of how to mitigate sybil and re-entry attacks on review based P2P distributed reputation systems. The architecture uses novel technologiessuch as blockchain, smart contracts, and non-fungible tokens (NFT) in conjunction withSwedish E-id provider BankID to build a sybil and re-entry attack resistant reputationsystem. To validate the feasibility of our approach, we developed a prototype and used itto run experiments to evaluate the functional correctness of the architecture as a mitigation solution
24

Simulating ADS-B vulnerabilities by imitating aircrafts : Using an air traffic management simulator / Simulering av ADS-B sårbarheter genom imitering av flygplan : Med hjälp av en flyglednings simulator

Boström, Axel, Börjesson, Oliver January 2022 (has links)
Air traffic communication is one of the most vital systems for air traffic management controllers. It is used every day to allow millions of people to travel safely and efficiently across the globe. But many of the systems considered industry-standard are used without any sort of encryption and authentication meaning that they are vulnerable to different wireless attacks. In this thesis vulnerabilities within an air traffic management system called ADS-B will be investigated. The structure and theory behind this system will be described as well as the reasons why ADS-B is unencrypted. Two attacks will then be implemented and performed in an open-source air traffic management simulator called openScope. ADS-B data from these attacks will be gathered and combined with actual ADS-B data from genuine aircrafts. The collected data will be cleaned and used for machine learning purposes where three different algorithms will be applied to detect attacks. Based on our findings, where two out of the three machine learning algorithms used were able to detect 99.99% of the attacks, we propose that machine learning algorithms should be used to improve ADS-B security. We also think that educating air traffic controllers on how to detect and handle attacks is an important part of the future of air traffic management.
25

Wireless Sensing in Vehicular Networks:Road State Inference and User Authentication

Tulay, Halit Bugra 27 September 2022 (has links)
No description available.
26

The M2X Economy – Concepts for Business Interactions, Transactions and Collaborations Among Autonomous Smart Devices

Leiding, Benjamin 11 December 2019 (has links)
No description available.
27

Spam Analysis and Detection for User Generated Content in Online Social Networks

Tan, Enhua 23 July 2013 (has links)
No description available.

Page generated in 0.0444 seconds