1 Atomic swap: a risk for AML regulation? Abstract This thesis deals with atomic swaps. Particularly it deals with their characteristics and relation to AML regulation. The aim of this thesis is to assess the risks that atomic swaps pose to AML regulation and the ways in which these risks can be addressed. The first part of this thesis briefly describes the concepts and technologies needed to understand atomic swaps. Among other things this part describes distributed databases, cryptographic keys, wallets, and virtual currency exchanges. This is followed by a description of the evolution of atomic swaps, how atomic swaps work and what are their advantages and disadvantages. The second part analyses the current regulation against money laundering and terrorist financing from the perspective of FATF, the European Union and the Czech Republic in relation to virtual currencies and atomic swaps. Particularly it focuses on the definition of virtual currencies and obliged entities. After the explanation how atomic swaps work and the analysis of AML regulation in relation to atomic swaps, it is possible to assess whether atomic swaps pose a risk to AML regulation. This is the focus of the third part of this thesis. It first introduces the issue of money laundering and the use of virtual currencies for illicit...

Resource Description Framework (RDF) est devenu un modèle de données pertinentafin de décrire et de modéliser les informations qui sont partagées sur le Web.Cependant, fournir une solution permettant de stocker et de récupérer cesdonnées de manière efficace tout en passant à l’échelle reste un défi majeur.Dans le contexte de cette thèse nous proposons un intergiciel dévoué austockage, à la récupération synchrone mais aussi à la dissémination sélectiveet asynchrone en quasi temps réel d'informations RDF dans un environnementcomplètement distribué. L’objectif est de pouvoir tirer parti des informationsdu passé comme de celles filtrées en quasi temps réel. Contrairement à unegrande majorité de solutions existantes, nous avons avons fait le choixd’éviter le hachage pour indexer les données ce qui nous permet de traiter lesrequêtes à intervalles de manière efficace. Le filtrage des informations enquasi temps réel est permis par l’expression des intérêts à l’aide desouscriptions basées sur le contenu des évènements futurs. Nous avons proposédeux algorithmes qui permettent de vérifier la concordance des évènements RDFavec les souscriptions enregistrées. Les deux algorithmes ont été testésexpérimentalement. En sus de la récupération synchrone et de la diffusionasynchrone d’évènements, nous nous sommes intéressés à améliorer la répartitiondes données RDF qui souffrent de dissymétrie. Finalement, nous avons consacréun effort non négligeable à rendre notre intergiciel modulaire. / RDF has become a relevant data model for describing and modeling information on the Web but providing scalable solutions to store and retrieve RDF data in a responsive manner is still challenging. Within the context of this thesis we propose a middleware devoted to storing, retrieving synchronously but also disseminating selectively and asynchronously RDF data in a fully distributed environment. Its purposes is to allow to leverage historical information and filter data near real-time. To this aims we have built our system atop a slightly modified version of a 4-dimensional Content Addressable Network (CAN) overlay network reflecting the structure of an RDF tuple. Unlike many existing solutions we made the choice to avoid hashing for indexing data, thus allowing efficient range queries resolution. Near realtime filtering is enabled by expressing information preferences in advance through content-based subscriptions handled by a publish/subscribe layer designed atop the CAN architecture. We have proposed two algorithms to check RDF data or events satisfaction with subscriptions but also to forward solutions to interested parties. Both algorithms have been experimentally tested for throughput and scalability. Although one performs better than the other, they remain complementary to ensure correctness. Along with information retrieval and dissemination, we have proposed a solution to enhance RDF data distribution on our revised CAN network since RDF information suffers from skewness. Finally, to improve maintainability and reusability some efforts were also dedicated to provide a modular middleware reducing the coupling between its underlying software artifacts.

Les systèmes pair-à-pair (P2P) sont utilisés par des millions d'usagers tous les jours. Dans beaucoup de cas, un usager souhaite communiquer, échanger du contenu ou des services à travers différents systèmes P2P. Cela requiert de la coopération entre les différents systèmes P2P, ce qui est très souvent difficile ou même impossible à obtenir, à cause des raisons suivantes; in primis, l'absence d'une infrastructure de routage entre les réseaux, ce qui rend la communication étanche et, in secundis, l'incompatibilité des protocoles et des opérations des susdits systèmes. L'objectif principal de cette thèse est celui de permettre la coopération entre systèmes P2P. La thèse introduit un cadre de coopération rétro-compatible entre systèmes P2P hétérogènes constitué de deux parties. La première est un cadre de routage intra-réseaux permettant à des réseaux hétérogènes de communiquer. La deuxième est une application coopérative, conçue à l'aide et au travers du cadre de routage, dont l'objectif est celui de résoudre les incompatibilités protocolaires des systèmes P2P sous-jacents. Comme étude de cas de notre cadre de coopération, on présente une solution complète permettant une coopération entre des réseaux P2P spécialisés dans l'échange des fichiers pouvant s'appliquer aux réseaux P2P actuels. Dans la deuxième partie de la thèse, on présente une étude de cas d'usage de notre architecture d'interconnexion des réseaux P2P pour la collecte et la gestion des données dans réseaux d'électricité intelligents. / Peer-to-peer systems are used by millions of users every day. In many scenarios, it is desirable for the users from different P2P systems to communicate and exchange content or services with each other. This requires co-operation between the P2P systems, which is often difficult or impossible, due to the two following reasons. First is the lack of an inter-overlay routing infrastructure throughout these systems, caused by the incompatibilities in overlay networks on top of which they are built. Second, there are incompatibilities in the application protocols of these systems. The main topic of this thesis is enabling the cooperation between P2P systems. The thesis introduces a cooperation framework for backward-compatible cooperating heterogeneous P2P systems which constitutes two parts. The first one is an inter-overlay routing framework which allows to inter-routing between heterogeneous overlay networks. The second one is the cooperation application, built on the top of the inter-overlay routing framework, which aims at solving the incompatibilities in the application protocols of P2P systems. As a case study of the cooperation framework, we introduce a complete solution for cooperating P2P file-sharing networks which is applicable for all current P2P file-sharing networks. In the second topic of this thesis, we investigate a case study of using inter-connecting P2P overlays for collecting and managing data in smart grid, a typical example of cyber physical system.

Nowadays, we can get the wireless devices easily, such as cell phone, PDA, etc. It can make the life convenient. The P2P network which has been constructed by the wireless devices does not need the central server. They can communicate by themselves. Not only have protected in the privacy, but also add the convenience. The reason is that the devices are portable, we can get the newest information. Some P2P software focuses on the sharing. They can share files with other peer. The file can separate into several modes. The software will share these nodes. Every peer shares his own node, and it will speed up the rate of sharing. There are some selfish peers in this environment, and they will not want to share their own node. Moreover, some of them share the incorrect file. The software will solve this kind of problem by some mechanism. And it set some incentive mechanism to make the sharing to go on. Because the wireless devices are portable, we can use these devices for exchanging immediate information. Sharing the files is similar to the exchanging. Both of the users trust each other. They can exchange automatically. So, our research has designed a reputation based mechanism for exchanging. The users can evaluate each other to exchanging the information automatically. By this mechanism, the user in our system will exchange continuously. We can reach our purpose which makes the user in our environment can exchange automatically.

Durante os últimos anos, a quantidade de dados gerada pelas aplicações cresceu consideravelmente. No entanto, para tornarem-se relevantes estes dados precisam ser processados. Para atender este objetivo, novos modelos de programação para processamento paralelo e distribuído foram propostos. Um exemplo é o modelo MapReduce, o qual foi proposto pela Google. Este modelo, no entanto, possui pontos de falha única (SPOF), os quais podem comprometer a sua execução. Assim, este trabalho apresenta uma nova arquitetura, inspirada pelo Chord, para lidar com os SPOFs do modelo. A avaliação da proposta foi realizada através de modelagem analítica e de testes experimentais. Os resultados mostram a viabilidade de usar a arquitetura proposta para executar o MapReduce. / During the last years, the amount of data generated by applications grew considerably. To become relevant, however, this data should be processed. With this goal, new programming models for parallel and distributed processing were proposed. An example is the MapReduce model, which was proposed by Google. This model, nevertheless, has Single Points of Failure (SPOF), which can compromise the execution of a job. Thus, this work presents a new architecture, inspired by Chord, to avoid the SPOFs on MapReduce. The evaluation was performed through an analytical model and an experimental setup. The results show the feasibility of using the proposed architecture to execute MapReduce jobs.

During the past decade, the Internet has witnessed a dramatic increase in the popularity of Peer-to-Peer (P2P) applications. This has caused a significant growth in the volume of P2P traffic. This trend has been particularly alarming for the Internet Service Providers (ISPs) that need to cope with the associated cost but have limited control in routing or managing P2P traffic. To alleviate this problem, researchers have proposed mechanisms to reduce the volume of external P2P traffic for individual ISPs. However, prior studies have not examined the global effect of P2P applications on the entire network, namely the traffic that a P2P application imposes on individual underlying Autonomous Systems (ASs). Such a global view is particularly important because of the large number of geographically scattered peers in P2P applications. This dissertation examines the global effect of P2P applications on the underlying AS-level Internet. Toward this end, first we leverage a large number of complete overlay snapshots from a large-scale P2P application, namely Gnutella, to characterize the connectivity and evolution of its overlay structure. We also conduct a case study on the performance of BitTorrent and its correlation with peer- and group-level properties. Second, we present and evaluate Respondent-driven sampling as a promising technique to collect unbiased samples for characterizing peer properties in large-scale P2P overlays without requiring the overlay's complete snapshot. Third, we propose a new technique leveraging the geographical location of peers in an AS to determine its geographical footprint and identify the cities where its Points-of-Presence (PoPs) are likely to be located. Fourth, we present a new methodology to characterize the effect of a given P2P overlay on the underlying ASs. Our approach relies on the large scale simulation of BGP routing over the AS-level snapshots of the Internet to identify the imposed load on each transit AS. Using our methodology, we characterize the impact of Gnutella overlay on the AS-level underlay over a 4-year period. Our investigation provides valuable insights on the global impact of large scale P2P overlay on individual ASs. This dissertation includes my previously published and co-authored material.

Durante os últimos anos, a quantidade de dados gerada pelas aplicações cresceu consideravelmente. No entanto, para tornarem-se relevantes estes dados precisam ser processados. Para atender este objetivo, novos modelos de programação para processamento paralelo e distribuído foram propostos. Um exemplo é o modelo MapReduce, o qual foi proposto pela Google. Este modelo, no entanto, possui pontos de falha única (SPOF), os quais podem comprometer a sua execução. Assim, este trabalho apresenta uma nova arquitetura, inspirada pelo Chord, para lidar com os SPOFs do modelo. A avaliação da proposta foi realizada através de modelagem analítica e de testes experimentais. Os resultados mostram a viabilidade de usar a arquitetura proposta para executar o MapReduce. / During the last years, the amount of data generated by applications grew considerably. To become relevant, however, this data should be processed. With this goal, new programming models for parallel and distributed processing were proposed. An example is the MapReduce model, which was proposed by Google. This model, nevertheless, has Single Points of Failure (SPOF), which can compromise the execution of a job. Thus, this work presents a new architecture, inspired by Chord, to avoid the SPOFs on MapReduce. The evaluation was performed through an analytical model and an experimental setup. The results show the feasibility of using the proposed architecture to execute MapReduce jobs.

Durante os últimos anos, a quantidade de dados gerada pelas aplicações cresceu consideravelmente. No entanto, para tornarem-se relevantes estes dados precisam ser processados. Para atender este objetivo, novos modelos de programação para processamento paralelo e distribuído foram propostos. Um exemplo é o modelo MapReduce, o qual foi proposto pela Google. Este modelo, no entanto, possui pontos de falha única (SPOF), os quais podem comprometer a sua execução. Assim, este trabalho apresenta uma nova arquitetura, inspirada pelo Chord, para lidar com os SPOFs do modelo. A avaliação da proposta foi realizada através de modelagem analítica e de testes experimentais. Os resultados mostram a viabilidade de usar a arquitetura proposta para executar o MapReduce. / During the last years, the amount of data generated by applications grew considerably. To become relevant, however, this data should be processed. With this goal, new programming models for parallel and distributed processing were proposed. An example is the MapReduce model, which was proposed by Google. This model, nevertheless, has Single Points of Failure (SPOF), which can compromise the execution of a job. Thus, this work presents a new architecture, inspired by Chord, to avoid the SPOFs on MapReduce. The evaluation was performed through an analytical model and an experimental setup. The results show the feasibility of using the proposed architecture to execute MapReduce jobs.

The subject of this thesis is to map the development of p2p lending in the US. Firstly, we compare the different business models and roles in the current monetary system of commercial banks and p2p platform lenders. The structure as well as trends of p2p lending industry are described. The returns of p2p loans are compared with traditional assets such as bonds, stocks and commodities in the 2011-2016 period. The last part of the thesis examines the loanbook of the most prominent p2p platform lender, Lending Club.

Purpose and Research question: The purpose of this study is to map how Swedish companies are working to build trust on their p2p platforms within the Sharing Economy. With this purpose in mind we formulated our research question as follows: How do Swedish companies work in order to build trust on their p2p-platform within the Sharing Economy?     Methodology: Due to the fact that the study has a starting point in a social context, a qualitative method was applied. The study was initiated with an explorative approach where a pilot interview was conducted in order to find an unexploited field of research within the Sharing Economy. The study is based on an abductive character where interplay in between induction and deduction occurred. The collection of empirical data has been characterized by a triangulation, where interviews were conducted with companies, business advisors and consumers. Primary data was collected by using semi structured interviews and a focus group.   Conclusion: In our study it was revealed that building trust on p2p platforms occurs in  a process where management control, platform design and activating users were three fundamental keys. Results show that the p2p platforms design is distinguished depending on what industry the company operates in. Four trends are highlighted; financial goals are not a primary focus, transparency is key on the platform, quality assurance and activating existing users. These trends are all crucial in order to build  trust on a p2p platform. Clear evidence shows that trust is the key in order to attract new users to the platform. Trust on a p2p platform contributes to more users dare to join the p2p platforms within the Sharing Economy. / Syfte och forskningsfråga: Syftet med denna studie är att kartlägga hur företag arbetar med att skapa tillit på sina p2p-plattformar. Studiens syfte är uppdelat i tre olika undersyften som avser att generera underlag till att besvara forskningsfrågan: Hur arbetar svenska företag med att skapa tillit på sina digitala p2p-plattformar inom delningsekonomin? Metod: Då studien har en utgångspunkt ur den sociala verkligheten så har en kvalitativ metod tillämpats. Studien inleddes med ett explorativt tillvägagångssätt där en pilotintervju genomfördes för att finna ett oexploaterat forskningsområde inom delningsekonomin. Studien utformades efter en abduktiv ansats då ett växelspel mellan induktion och deduktion uppstod. Insamlingen av empirisk data har präglats av en triangulering, där intervjuobjekt har utgjorts av företag, företagsrådgivare samt konsumenter. Primärdata har hämtats med hjälp av semi-strukturerade intervjuer och en fokusgrupp.   Slutsatser: I studien framkom det att tillitsskapande på p2p-plattformar sker i en tredelad process som utgörs av verksamhetsstyrning, utformning av p2p-plattformen  och aktivering av användare. Resultat ur studien visar att utformningen av digitala p2p- plattformar skiljer sig beroende på den bransch företag verkar i. Fyra tendenser och mönster lyfts fram; finansiella mål är inte primärt fokus, plattformarnas transparens, kvalitetssäkring och aktivering av befintliga användare som väsentliga faktorer att tillämpa för att skapa tillit på p2p-plattformar. Tydliga resultat visar att tillit innehar en nyckelroll när det kommer till att attrahera nya användare. Tillitsskapandet bidrar till att fler användare vågar ansluta sig till p2p-plattformarna inom delningsekonomin.