DOCSLIB.ORG

Gossipsub: a Secure Pubsub Protocol for Unstructured

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Gossipsub: a Secure Pubsub Protocol for Unstructured 1 GossipSub: A Secure PubSub Protocol for Unstructured, 59 2 60 3 Decentralised P2P Overlays 61 4 62 5 Dimitris Vyzovitis Yiannis Psaras 63 6 64 7 Protocol Labs UCL, UK & Protocol Labs 65 8 [email protected] [email protected] 66 9 ABSTRACT 67 10 68 11 This report is discussing the design choices behind gossipsub, the 69 12 pubsub protocol in use today in the IPFS ecosystem and in partic- 70 13 ular as a message mechanism protocol for IPNS records. We are 71 14 discussing the requirements of the protocol, related works in the 72 15 area, as well as the specific parameters that influence its behaviour. 73 16 74 17 CCS CONCEPTS 75 18 • Computer systems organization → Embedded systems; Re- Figure 1: Topics & Peers 76 19 dundancy; Robotics; • Networks → Network reliability. 77 20 78 21 KEYWORDS 79 22 IPFS, libp2p, pubsub, gossipsub 80 23 81 ACM Reference Format: 24 Dimitris Vyzovitis and Yiannis Psaras. 2019. GossipSub: A Secure PubSub 82 25 Protocol for Unstructured, Decentralised P2P Overlays. In Proceedings of 83 26 Protocol Labs TechRep (PL-TechRep-gossipsub-v0.1-Dec19). Protocol Labs, 84 27 8 pages. https://doi.org/10.1145/nnnnnnn.nnnnnnn 85 28 Figure 2: Message Delivered to Subscribers 86 29 1 INTRODUCTION 87 30 Publish/Subscribe systems have traditionally been used to facilitate 88 31 distribution of messages in an asynchronous manner between a set of pub/sub messaging and other operations related to the system 89 32 of publishers and subscribers. Senders (publishers) and receivers on a stable and continuous fashion. 90 33 (subscribers) are not in direct communication, but instead com- Unstructured P2P overlay networks, on the other hand, do not 91 34 municate through the pub/sub system. Subscribers declare their assume any connectivity properties for any of its nodes. That is, 92 35 topics of interest; publishers publish in one of the system’s topics. in unstructured P2P networks, nodes can be of any type (i.e., from 93 36 The pub/sub system then matches the two and delivers new mes- always-on rack servers, to ephemerally connected laptops and mo- 94 37 sages (or more commonly called events) to all subscribers under bile devices) and thus, connect and disconnect at random times. 95 38 a topic. Pub/Sub systems have been extensively used by Internet These random connectivity patterns make it impossible to assign 96 39 applications (see Twitter, RSS Feeds, Facebook), but also by general extra event routing or message caching responsibilities to any node 97 40 purpose Peer-to-Peer (P2P) systems. Not for distribution.in unstructured P2P networks. In turn, designing message propaga- 98 41 By and large, peer-to-peerUnpublished (P2P) networks can be split in two workingtion and guaranteeing draft. reliability of message delivery (that is, that a 99 42 categories: i) structured P2P overlays and ii) unstructured P2P over- message will reach all nodes in the network within a given amount 100 43 lays. In structured P2P overlays (or networks), the network has of time) is very difficult. 101 44 some structure, e.g., it is based on some topological or node hier- For these reasons, unstructured P2P networks very often use 102 45 archy. In such cases, some nodes (often called Super Nodes) can pub/sub protocols that are closer to flooding, or random walks 103 46 be assigned more responsibilities than others, such as for example, on the overlay to propagate event and membership information. 104 47 relay published events to subscribed nodes. Those nodes are also However, naïve flooding introduces a lot of extra traffic inthe 105 48 assumed to be dedicated servers, hence, they can support routing network, while random walks may take extended amounts of time 106 49 before reaching all nodes. 107 50 Permission to make digital or hard copies of all or part of this work for personal or 108 classroomUnpublished use is granted working without fee draft. provided Not that copies for distribution.are not made or distributed While previous work has addressed many different aspects and 51 for profit or commercial advantage and that copies bear this notice and the full citation requirements of pub/sub design for structured P2P networks, little 109 52 on the first page. Copyrights for components of this work owned by others than ACM has been done for unstructured P2P networks. “Gossip" has been 110 must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, 53 111 to post on servers or to redistribute to lists, requires prior specific permission and/or a introduced as a way to limit the number of messages propagated be- 54 fee. Request permissions from [email protected]. tween peers in pub/sub systems, as compared to flooding, where all 112 55 PL-TechRep-gossipsub-v0.1-Dec19, Dec 2019, AoE published messages are forwarded to all subscribed peers. In gossip- 113 © 2019 Association for Computing Machinery. 56 114 ACM ISBN 978-x-xxxx-xxxx-x/YY/MM...$15.00 based approaches, peers forward metadata related to messages they 57 https://doi.org/10.1145/nnnnnnn.nnnnnnn have “seen" without forwarding the messages themselves. There 115 58 2019-12-30 05:20. Page 1 of 1–8. 116 PL-TechRep-gossipsub-v0.1-Dec19, Dec 2019, AoE Vyzovitis and Psaras 117 have been numerous studies that explored gossip-based systems, paper intends to pursue. In its current version, we are starting by 175 118 but the scalability of large-scale, unstructured pub/sub systems has illustrating the protocol’s main design choices, together with a 176 119 not been addressed thoroughly. conceptual comparison against related works in the area. 177 120 In recent years, there has been significant momentum for design Gossipsub Design Summary: The pubsub protocol proposed 178 121 and deployment of decentralised Internet services and applications. here falls in the category of gossip-based pubsub protocols. Its main 179 122 Among others, such services include distributed and decentralised design features are a connected mesh, complemented by gossip 180 123 storage [8], [7], [12], [34], [2] but also computation systems [3]. functionality and lazy push. Lazy push is a technique used in pub- 181 124 The aim is to replace, or complement traditional centrally man- sub systems, according to which only metadata and not the full 182 125 aged and operated cloud services. End-users are contributing part message, is forwarded to subscribed nodes. In turn, if nodes are in- 183 126 of their resources to the network and get rewarded according to terested in the actual message whose metadata they have received, 184 127 contribution. These emerging systems are distributed in the sense they request the message explicitly. As is the case with many un- 185 128 of geographical spread and decentralised from the point of view of structured P2P networks, the first version of the protocol was closer 186 129 ownership, management and operation. to flood-based pubsub. However, as the IPFS network grew over 187 130 We are, therefore, witnessing a trend towards building P2P over- time, it was clear that flooding is not an efficient approach. Scal- 188 131 lays, where, in most cases, unreliable and non-dedicated end-user ability requirements quickly surfaced and resulted in the design 189 132 devices are active contributors to the network. In the absence of of meshsub, a connected mesh which is complemented by gossip 190 133 central control, messaging in those systems is of utmost impor- and lazy push as core features of the protocol. The combination of 191 134 tance in order to communicate operational processes (e.g., find file those techniques, along with the ability to plug in custom routing 192 135 or execute function), but also propagate management events. heuristics, constitute the main novelty of gossipsub. Simplicity of 193 136 Pub/Sub has seen a surge in usage from distributed applications implementation, as well as being reactive to dynamic network con- 194 137 in the area of decentralised services, such as decentralised chat ditions have been the driving philosophies behind the design of 195 138 and social networks [12], [10], collaborative editing tools without a gossipsub. 196 139 backend server [11], hosting of dynamic website content in unman- 197 140 aged P2P networks [8], storage and synchronisation of evolving 2 BACKGROUND & RELATED WORK 198 141 datasets, to name a few. 2.1 Tradeoffs in PubSub 199 142 In distributed storage systems and in the case of the InterPlan- 200 143 etary File System (IPFS) ecosystem in particular, pub/sub can be General purpose pub/sub messaging systems can prove very useful 201 144 used for several purposes, including content routing, i.e., one of the from several different aspects (from management and operation 202 145 most central and vital functions of the system. IPFS is a content- to performance) in P2P networks and as such come with many 203 146 addressable, distributed P2P storage network with hundreds of tradeoffs [19], [25]. Due to the wide variety of applications building 204 147 thousands of daily users. Users can participate in the network on top of pubsub systems, not all tradeoffs apply to all systems and 205 148 as unreliable nodes, e.g., using laptop devices and with frequent many of them are contradictory to each other. Below, we discuss 206 149 disconnections. The gossip-based pubsub protocol proposed here some of them and, where relevant, note how they influenced the 207 150 (acronymed “gossipsub") was developed with those system and design of gossipsub. 208 151 environment requirements in mind (i.e., unmanaged network and (1) Reliable Delivery. In case of no node downtime, all pub- 209 152 unreliable nodes) and is currently in use to push naming record lished messages should be delivered to all subscriber nodes.
Load more

Recommended publications
  • Pangea Jurisdiction and Pangea Arbitration Token (PAT)
    Pangea Jurisdiction and Pangea Arbitration Token (PAT) The Internet of Sovereignty Susanne Tarkowski Tempelhof, Eliott Teissonniere James Fennell Tempelhof and Dana Edwards Bitnation, Planet Earth, April 2017 Pangea Jurisdiction and Pangea Arbitration Token (PAT) The Internet of Sovereignty Susanne Tarkowski Tempelhof, Eliott Teissonniere, James Fennell Tempelhof and Dana Edwards Bitnation, Planet Earth, April 2017 <abstract_ The Pangea software is a Decentralized Opt-In Jurisdiction where Citizens can conduct peer- to-peer arbitration and create Nations. Pangea uses the Panthalassa mesh, which is built using Secure Scuttlebutt (SSB) and Interplanetary File System (IPFS) protocols. This enables Pangea to be highly resilient and secure, conferring resistance to emergent threats such as high- performance quantum cryptography. Pangea is blockchain agnostic but uses the Ethereum blockchain for the time being. In the future, other chains such as Bitcoin, EOS and Tezos can be integrated with Pangea. The Pangea Arbitration Token (PAT) is an ERC20 compatible in-app token for the Pangea Jurisdiction. The PAT token rewards good reputation and is issued on Pangea when Citizens accumulate non-tradable reputation tokens through creating a contract, successfully completing a contract or resolving a dispute attached to a contract. PAT is an algorithmic reputation token, an arbitration currency based on performance rather than purchasing power, popularity or attention. The distribution mechanism for PAT tokens on Pangea is an autonomous agent, Lucy, which will initially launch on Ethereum as a smart contract. This mechanism is blockchain agnostic and can be ported to any viable smart contract platform. An oracle created by Bitnation will help to facilitate this (semi-) autonomous distribution mechanism in a decentralized and secure fashion.
    [Show full text]
  • Migration in the Stencil Pluralist Cloud Architecture
    Migration in the Stencil Pluralist Cloud Architecture Tai Liu Zain Tariq Tencent America LLC New York University Abu Dhabi [email protected] [email protected] Barath Raghavan Jay Chen University of Southern California International Computer Science Institute [email protected] [email protected] ABSTRACT There are many important technical design challenges in decen- A debate in the research community has buzzed in the background tralized infrastructure, including security, naming, and more. Our for years: should large-scale Internet services be centralized or de- goal is to narrow the focus to the key issues the architecture must centralized? Now-common centralized cloud and web services have adjudicate as opposed to an individual application or service. We downsides—user lock-in and loss of privacy and data control—that argue that we need a pluralist architecture: one that allows the are increasingly apparent. However, their decentralized counter- co-existence of applications and seamless migration between them. parts have struggled to gain adoption, suffer from their own prob- Not only can such an architecture prevent user lock in, but it can lems of scalability and trust, and eventually may result in the exact also ease the pain of developing decentralized applications. Put same lock-in they intended to prevent. another way, a pluralist architecture is one that picks no winners: In this paper, we explore the design of a pluralist cloud architec- instead, it allows a marketplace of services to be developed, and ture, Stencil, one that can serve as a narrow waist for user-facing provides enough scaffolding and restrictions to ensure that the services such as social media.
    [Show full text]
  • Technology Stack for Decentralized Mobile Services
    Technology Stack for Decentralized Mobile Services Matouš Skála Technology Stack for Decentralized Mobile Services by Matouš Skála to obtain the degree of Master of Science at the Delft University of Technology, to be defended publicly on Monday August 31, 2020 at 3:00 PM. Student number: 4893964 Project duration: November 15, 2019 – August 31, 2020 Thesis committee: Dr.ir. J.A. Pouwelse, TU Delft, supervisor Dr. J.S. Rellermeyer, TU Delft Dr. N. Yorke-Smith, TU Delft An electronic version of this thesis is available at http://repository.tudelft.nl/. Preface When I was choosing my thesis topic, I originally came up with an idea of designing a decen- tralized social network. After realizing how ambitious that goal was, I later decided to focus on more fundamental issues first and create a library that would allow for building any de- centralized applications, running purely on an overlay network consisting of smartphones. Rather than reinventing the wheel, I took inspiration from an existing networking library de- veloped at TU Delft over the last decade and created its wire-compatible implementation in Kotlin. Interestingly, in the end, I have even implemented a trivial social network to demon- strate the usage of the library, returning back to the original idea. I would like to thank my supervisor Johan Pouwelse for an endless stream of fresh ideas and valuable feedback, and to PhD students of the Delft Blockchain Lab for numerous coffee meetings and for serving me as a walking documentation of the existing codebase. Matouš Skála Prague,
    [Show full text]
  • Service Competition and Data-Centric Protocols for Internet Access
    University of Massachusetts Amherst ScholarWorks@UMass Amherst Doctoral Dissertations Dissertations and Theses October 2019 Service Competition and Data-Centric Protocols for Internet Access Thiago Teixeira University of Massachusetts Amherst Follow this and additional works at: https://scholarworks.umass.edu/dissertations_2 Part of the Digital Communications and Networking Commons Recommended Citation Teixeira, Thiago, "Service Competition and Data-Centric Protocols for Internet Access" (2019). Doctoral Dissertations. 1770. https://doi.org/10.7275/15202406 https://scholarworks.umass.edu/dissertations_2/1770 This Open Access Dissertation is brought to you for free and open access by the Dissertations and Theses at ScholarWorks@UMass Amherst. It has been accepted for inclusion in Doctoral Dissertations by an authorized administrator of ScholarWorks@UMass Amherst. For more information, please contact [email protected]. SERVICE COMPETITION AND DATA-CENTRIC PROTOCOLS FOR INTERNET ACCESS A Dissertation Presented by THIAGO TEIXEIRA Submitted to the Graduate School of the University of Massachusetts Amherst in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY September 2019 Electrical and Computer Engineering © Copyright by Thiago Teixeira 2019 All Rights Reserved SERVICE COMPETITION AND DATA-CENTRIC PROTOCOLS FOR INTERNET ACCESS A Dissertation Presented by THIAGO TEIXEIRA Approved as to style and content by: Tilman Wolf, Co-chair Michael Zink, Co-chair Jay Taneja, Member Anna Nagurney, Member Christopher V. Hollot, Department Head Electrical and Computer Engineering DEDICATION To my wife Cavaille and my parents Norma and Jose Roberto. ACKNOWLEDGMENTS I would like to thank my advisor, Professor Tilman Wolf, for his much valuable guid- ance and lessons learned during my doctorate. I would also like to thank Professor Michael Zink for supporting, guiding, and working together in many exciting projects.
    [Show full text]
  • P2P-Hate-Report.Pdf
    I’m in a community called Scuttlebutt which uses Peer-to-Peer technology. This is a type of ​ ​ technology that works radically differently from the internet as we know it now and offers a powerful vision for a resilient and sustainable future for technology and social movements. One evening, a friend who is a developer on Scuttlebutt and also has marginalized identities like myself messaged me and a small group of others with great concern writing: “Ok - so we have nazis already using scuttlebutt. When the NZ shootings happened I had a dream that in the news it was announced that they had been using an enclave of scuttlebutt to organise and radicalise. It seems inevitable that this will happen…” It continued a long conversation about the risks created by these radical technologies. My friend was genuinely afraid. So was I. And I still am. Like so many others, he had put a ton of work into cultivating both the community and the technology. He was scared both that the product of so many people’s love would become a central aid in white-supremacist organizing and that the community wasn’t ready to deal with the fall out of such a “nightmarish vision.” In most Peer-to-Peer communities it is impossible to surveill them or know how many people are using them because they are secure and often private by design. The only way to even catch a glimpse of how many white supremacists are using them is when they post on leaked forums or public websites. Otherwise, unless their conversations are infiltrated, we can only see the tips of the iceberg of the violence (or good!) facilitated by these technologies.
    [Show full text]
  • Hyperwell: Local-First, Collaborative Notebooks for Digital Annotation
    Hyperwell: Local-First, Collaborative Notebooks for Digital Annotation A thesis presented for the degree of Master of Science by Jan Kaßel [email protected] 3724135 at the Institute of Computer Science Universität Leipzig, Germany May 4, 2020 Advisor & First Examiner Second Examiner Dr. Thomas Köntges Prof. Gregory Crane Chair of Digital Humanities Department of Classical Studies Leipzig University Tufts University Except where otherwise noted, content in this thesis is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License¹, which permits un- restricted adaption, use, and distribution in any medium, provided the original work is properly cited the resulting work is licensed under the same terms as the original. The source code of all Hyperwell repositories is available as open-source soft- ware, licensed under the more permissive MIT License. Copyright 2020, Jan Kaßel. 1. https://creativecommons.org/licenses/by-sa/4.0/ Table of Contents Abstract i Acknowledgements ii List of Abbreviations iii List of Figures iv 1 Introduction 1 1.1 Motivation: A Question of Ownership ................ 3 1.2 Research Goals and Affiliated Work ................. 4 1.3 Synopsis ................................ 5 2 Related Work 7 2.1 Hypertext and Annotation ....................... 7 2.2 Digital Real-Time Collaboration ................... 10 2.3 Linked Data and Digital Humanities . 12 2.4 Peer-to-Peer Networks ........................ 16 2.5 Local-First Applications ........................ 20 3 Study: Exploring Collaborative Workflows 22 3.1 Study Framework ........................... 25 3.2 Analyzing Digital Workflows ..................... 27 3.3 Setting and Observations ....................... 30 3.4 Results ................................. 32 4 Peer-to-Peer Annotation 35 4.1 What’s (Not) Wrong with Servers? .
    [Show full text]
  • Trustnet: Trust-Based Moderation Using Distributed Chat Systems for Transitive Trust Propagation
    TrustNet: Trust-based Moderation Using Distributed Chat Systems for Transitive Trust Propagation Alexander Cobleigh Department of Automatic Control MSc Thesis TFRT-6102 ISSN 0280-5316 Department of Automatic Control Lund University Box 118 SE-221 00 LUND Sweden © 2020 by Alexander Cobleigh. All rights reserved. Printed in Sweden by Tryckeriet i E-huset Lund 2020 Abstract This thesis introduces TrustNet, a flexible and distributed system for deriving, and interacting with, computational trust. The focus of the thesis is applying TrustNet as a tool within distributed chat systems for implementing a subjective moderation sys- tem. Two distributed chat systems, Secure Scuttlebutt and Cabal, are discussed, the latter having been extended with a proof of concept implementation of the proposed system. The concept of ranking strategies is also introduced as a general purpose technique for converting a produced set of rankings into strategy-defined subsets. This work proposes a complete trust system that can be incorporated as a ready- made software component for distributed ledger technologies, and which provides real value for impacted users by way of automating decision-making and actions as a result of assigned trust scores. 3 Acknowledgements I want to start by thanking Johan Eker, my thesis supervisor from the department of Automatic Control at Lund University, for his support, patience, advice and feed- back in this unusually long Master’s thesis. I am very glad you took the time to listen to the random student dropping by your office to pitch his thesis idea. I also greatly appreciate the frequent discussions we have had throughout the thesis pro- cess.
    [Show full text]
  • Cryptographic Protocol Analysis for the Real World
    Verifpal: Cryptographic Protocol Analysis for the Real World Nadim Kobeissi1, Georgio Nicolas1, and Mukesh Tiwari2 1 Symbolic Software 2 University of Melbourne Abstract Verifpal is a new automated modeling framework and verifier for cryp- tographic protocols, optimized with heuristics for common-case protocol specifica- tions, that aims to work better for real-world practitioners, students and engineers without sacrificing comprehensive formal verification features. In order to achieve this, Verifpal introduces a new, intuitive language for modeling protocols that is easier to write and understand than the languages employed by existing tools. Its formal verification paradigm is also designed explicitly to provide protocol modeling that avoids user error. Verifpal is able to model protocols under an active attacker with unbounded ses- sions and fresh values, and supports queries for advanced security properties such as forward secrecy or key compromise impersonation. Furthermore, Verifpal’s semantics have been formalized within the Coq theorem prover, and Verifpal mod- els can be automatically translated into Coq as well as into ProVerif models for further verification. Verifpal has already been used to verify security properties for Signal, Scuttlebutt, TLS 1.3 as well as the first formal model for the DP-3T pandemic-tracing protocol, which we present in this work. Through Verifpal, we show that advanced verification with formalized semantics and sound logic can exist without any expense towards the convenience of real-world practitioners. Keywords: formal analysis · protocol analysis · protocol modeling 1 Introduction Internet communications rely on a handful of protocols, such as Transport Layer Security (TLS), SSH and Signal, in order to keep user data confidential.
    [Show full text]
  • General Maintenance Track Collaborative Notes Doc Themaintainers.Org
    General Maintenance Track Collaborative Notes Doc themaintainers.org Maintainers III MONDAY Opening Remarks + Introducing MAMA (Bernardo Robles Hidalgo) [ADD YOUR NOTES BELOW] Opening Ceremony: Scores for Maintainers (Taeyoon Choi, Cori Kresge) Basic data ● WHO were the maintainers/care workers mentioned in the paper/session? Choi: School for Poetic Computation Kresge: dancer, interval training ● WHAT kinds of work do these people do? Building Communities, increasing diversity through offering classes for learning to code ● HOW do they do it? Through a commitment to care; skepticism toward military-industrial-complex Context ● What elements (time, place, populations, technologies, methodologies) of the paper/session stood out the most? Artistic approach: paintings, drawings, community gatherings. Artistic approach, anti-establishment vibe Supportive exercise with little people, nurturing and introducing them to other little people 2 min Interval training: move in a way that feels good for you 2 min Write/draw continuously, without the pen leaving the page REPEAT but with the word “care” foregrounded 2 min 2 min AMPLIFY 2 min 1 min do NOTHING 3 minutes to review: mine your archive themaintainers.org 1 General Maintenance Track Collaborative Notes Doc themaintainers.org 5 minutes: talk in your groups (1-on-1), share what came up ● What recommendations or conclusions did the speaker/s offer? Love yourself; think about responsibilities as maintainers, and the kinds of trust we can give to the world Focus on the uncomputable, unknowable, ungovernable ● What significant connections do track chair, audience, and/or speakers make to other presentations at MIII, or to other issues/articles/media outside of MIII? Code, technologies and bodies More notes School for Poetic computation are we maintaining systems of segregation? @chrissunkim - project about slowing down, looking back as a way to explore what the future could be video of her signing Signing Coders converting computing concepts to sign language.
    [Show full text]
  • Open Source TOOLS
    07/06/2020, 11)31 Open Source TOOLS - alternatives to surveillance capitalist software for communicating - thinking critically about the choices we have in the platforms & technologies that we use COLLECT open source / FLOSS online tools to communicate (NOT ONLY) during the pandemic. C'est un endroit pour collecter des outils en ligne open source / FLOSS pour communiquer (PAS SEULEMENT) pendant la pandémie. feel free to extend this list and spread!!! Since the list is now quite long, here are the subheadings that you can scroll down to: 1. Audio-visual conferencing 2. Scheduling group meetings 3. Streaming 4. Video hosting 5. Chat 6. Etherpads 7. Feminist internet 8. Alternative social networks 9. Artistic collaboration 10. Audio tech 11. Game development 12. Self hosting (with others) 13. Mobile phones 14. For kids 15. Photo safety 16. Useful links 17. Document sharing 18. Digital solidarity 19. Articles 20. Other / unsorted 1. AUDIO-VISUAL CONFERENCING https://p2p.chat - free, no limit on participants, in a browser, no login/account, and fully p2p encrypted even in multiple-participants calls Jitsi Meet (https://jitsi.org/jitsi-meet ) free, no limit on participants, browser-based (which https://etherpad.wikimedia.org/p/online-tools-for-the-pandemic Page 1 of 9 07/06/2020, 11)31 means nothing to install for any participants) new version is improved in regards to FF support, e2ee, and number of participants / How to selfhost Ubuntu/Debian - https://guides.lw1.at/books/how-to-install-jitsi-meet-on-debian-or-ubuntu/ o!cial installation:
    [Show full text]
  • Ulc Law Journal 2019
    Vol : 9 Vol : - No. : 1 No. Vol : 9 - No. : 1 January 2019 ISSN.0973-3280 BANGALORE UNIVERSITY LAW JOURNAL UGC approved Peer Reviewed and Refereed Journal Vol : 9 No. 1 January 2019 Vol. 9 No. 1 BANGALORE UNIVERSITY LAW JOURNAL UGC approved Peer Reviewed and Refereed Journal CITE THIS VOLUME AS 9 BULJ 2019 (1) This Journal is published by University Law College & Department of Studies in Law, Bangalore University, Bengaluru Price of single issue : ` 200/- ii CALL FOR CONTRIBUTIONS Bangalore University Law Journal is a biannual publication. Contributions to the journal are invited in the form of articles, notes and case comments. Contributions should be typed in double space on one side of the A4 size paper and should also be sent by rewritable CD. It may also be sent through email-id [email protected] The Editors, Publishers and Printers do not claim any responsibility for the views expressed by the contributors and for the errors, if any, in the information contained in the journal. The subscription amount may be sent to the following address along with D.D drawn in favour of Finance Officer, Bangalore University, Bangalore. BANGALORE UNIVERSITY LAW JOURNAL C/O PROFESSOR DR. V. SUDESH PRINCIPAL UNIVERSITY LAW COLLEGE BANGALORE UNIVERSITY, BANGALORE iii EDITORIAL ADVISORY BOARD Justice Dr. Shivraj V. Patil Former Judge, Supreme Court of India, Bangalore Prof. V. B. Coutinho Dr. R. Venkat Rao Former Vice Chancellor Vice Chancellor Gulbarga University National Law School of India University Gulbarga Nagarabhavi Bangalore Prof. Manoj Kumar Sinha Shri. Mohan V. Katarki Director, Indian Law Institute Senior Advocate Bhagwandas Road Supreme Court New Delhi New Delhi Dr.
    [Show full text]
  • Thèse De Doctorat De
    Thèse de doctorat de L’UNIVERSITÉ DE RENNES 1 Comue Université Bretagne Loire École Doctorale N° 601 Mathématiques et Sciences et Technologies de l’Information et de la Communication Spécialité : Informatique Par Adrien LUXEY Les e-squads : Un nouveau paradigme pour la conception d’applications ubiquitaires respectant le droit à la vie privée Thèse présentée et soutenue à Rennes (France), le 29 Novembre 2019 Unité de recherche : Irisa (UMR 6074) Rapporteurs avant soutenance : Romain ROUVOY Professeur des Universités Université de Lille Vivien QUÉMA Professeur des Universités Grenoble INP Composition du Jury : Présidente : Anne-Marie KERMARREC Directrice de recherche Univ Rennes, CNRS, Inria, IRISA Rapporteurs : Romain ROUVOY Professeur des Universités Université de Lille Vivien QUÉMA Professeur des Universités Grenoble INP Examinatrice : Sonia BEN MOKHTAR Directrice de recherche CNRS Lyon Dir. de thèse : Yérom-David BROMBERG Professeur des Universités Univ Rennes, CNRS, Inria, IRISA Notre héritage n’est précédé d’aucun testament. René Char Technology is neither good nor bad; nor is it neutral. Melvin Kranzberg A tenured scientist Table of Contents 1 Introduction7 2 State of the Art 11 2.1 ‘Privacy is dead’ ... in the cloud........................ 12 2.2 Today’s alternatives............................... 13 2.2.1 The edge cloud: a poor diversion................... 13 2.2.2 Decentralised networks......................... 13 2.3 The multi-device paradigm........................... 17 2.4 The path toward e-squads........................... 18 3 Fluid user interactions inside the e-squad 21 3.1 Introducing Sprinkler ............................ 21 3.2 Our approach.................................. 23 3.2.1 Solution outline............................. 23 3.2.2 Decentralized knowledge aggregation................. 26 3.2.3 The Session Handoff algorithm...................
    [Show full text]