Consider a linear [ <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> , xmlns:xlink="http://www.w3.org/1999/xlink">k</i> xmlns:xlink="http://www.w3.org/1999/xlink">d</i> ] <sub xmlns:xlink="http://www.w3.org/1999/xlink">q</sub> code xmlns:xlink="http://www.w3.org/1999/xlink">C</i> . We say that the xmlns:xlink="http://www.w3.org/1999/xlink">i</i> th coordinate of has locality xmlns:xlink="http://www.w3.org/1999/xlink">r</i> if value at this...

P2P file downloading and streaming have already become very popular Internet applications. These systems dramatically reduce the server loading, provide a platform for scalable content distribution, as long there is interest content. P2P-based video-on-demand (P2P-VoD) new challenge technology. Unlike live content, P2P-VoD has less synchrony in users sharing video therefore it much more difficult to alleviate loading at same time maintaining performance. To compensate, small storage...

Video-on-demand in the Internet has become an immensely popular service recent years. But due to its high bandwidth requirements and popularity, it is also a costly provide. We consider design potential benefits of peer-assisted video-on-demand, which participating peers assist server delivering VoD content. The assistance done such way that provides same user quality experience as pure client-server distribution. focus on single-video approach, whereby peer only redistributes video...

P2P file downloading and streaming have already become very popular Internet applications. These systems dramatically reduce the server loading, provide a platform for scalable content distribution, as long there is interest content. P2P-based video-on-demand (P2P-VoD) new challenge technology. Unlike live content, P2P-VoD has less synchrony in users sharing video therefore it much more difficult to alleviate loading at same time maintaining performance. To compensate, small storage...

To reduce storage overhead, cloud file systems are transitioning from replication to erasure codes. This process has revealed new dimensions on which evaluate the performance of different coding schemes: amount data used in recovery and when performing degraded reads. We present an algorithm that finds optimal number codeword symbols needed for any XOR-based code produces schedules use a minimum data. differentiate popular codes based this criterion demonstrate differences improve I/O...

To flexibly explore the trade-offs between storage space and access efficiency in reliable data systems, we describe two classes of erasure resilient coding schemes: basic generalized pyramid codes. The codes can be simply derived from any existing codes, thus all known efficient encoding/decoding techniques directly apply. are radically advanced new which further improve and/or reliability upon We also establish a necessary condition for failure pattern to ever recoverable, show that...

Vehicular fog computing extends the paradigm to conventional vehicular networks. This allows us support more ubiquitous vehicles, achieve better communication efficiency, and address limitations in networks terms of latency, location awareness, real-time response (typically required smart traffic control, driving safety applications, entertainment services, other applications). Such requirements are particularly important adversarial environments (e.g., urban warfare battlefields Internet...

Proper data placement schemes based on erasure correcting codes are one of the most important components for a highly available storage system. For such schemes, low decoding complexity (or recovering) node failures is essential practical systems. In this paper, we describe new coding scheme, which call STAR code, triple (erasures). The code an extension double-erasure-correcting EVENODD and modification generalized triple-erasure-correcting code. Maximum Distance Separable (MDS) thus...

Network codes designed specifically for distributed storage systems have the potential to provide dramatically higher efficiency same availability. One main challenge in design of such is exact repair problem: if a node storing encoded information fails, order maintain level reliability we need create at new node. open problems this emerging area has been simple coding schemes that allow and low cost failed nodes high data rates. In particular, all prior known explicit constructions rates...

Consider a systematic linear code where some (local) parity symbols depend on few prescribed symbols, whereas other (heavy) may all data symbols. Such codes have been studied recently in the context of erasure coding for storage, local parities facilitate fast recovery any single symbol when it is erased, heavy provide tolerance to large number simultaneous erasures. A as above maximally recoverable, if corrects patterns, which are information theoretically correctable given dependence...

A highly accurate client-independent geolocation service stands to be an important goal for the Internet. Despite extensive research effort and significant advances in this area, has not yet been met. Motivated by fact that best results date are achieved utilizing additional 'hints' beyond inherently inaccurate delay-based measurements, we propose a novel method fundamentally escalates use of external information. In particular, many entities (e.g., businesses, universities, institutions)...

We design flexible schemes to explore the tradeoffs between storage space and access efficiency in reliable data systems. Aiming at this goal, two new classes of erasure-resilient codes are introduced -- Basic Pyramid Codes (BPC) Generalized (GPC). Both require slightly more than conventional schemes, but significantly improve critical performance read during failures unavailability. As a by-product, we establish necessary matching condition characterize limit failure recovery, that is,...

In this paper, we quantify the potential gains of hybrid CDN-P2P for two leading CDN companies, Akamai and Limelight. We first develop novel measurement methodology mapping topologies networks. then consider ISP-friendly P2P distribution schemes which work in conjunction with CDNs to localize traffic within regions ISPs. To evaluate these schemes, use recent, real-world traces: a video-on-demand trace large-scale software update trace. find that can significantly reduce cost content...

With the pervasiveness of location-aware mobile electronic devices and advances wireless communications, location-based services (LBS), which can help people enjoy a convenient life, has attracted considerable interest recently. However, privacy issues LBS are still challenging today. Aiming at challenges, in this paper, we present new efficient privacy-preserving query scheme outsourced cloud, i.e., EPQ, for pervasive smartphones. In EPQ scheme, provider's data first to cloud server an...

It is believed that automated valet parking (AVP) system has great potential to mitigate the headache for future smart city, as it can provide on-demand services, bringing immense benefits from energy saving vehicles time drivers. For an AVP system, reservation indispensable part so accomplish in accordance with reserved information. However, requests may not only reveal driver identity, but also disclose his/her sensitive locations, e.g., most visited places, which are of concerns users. To...

Secure and efficient access authentication is one of the most important security requirements for vehicular networks, but it difficult to fulfill due potential attacks long delay caused by high vehicle mobility, etc. Most existing protocols, either do not consider like single point failure or focus on reducing delay. To address these issues, we introduce an edge-assisted decentralized (EADA) architecture, which provides secure more communication-efficient enabling server delegate its...

In mobile crowdsensing, location-based task recommendation requires each data requester to submit a task-related geometric range crowdsensing service providers such that they can match suitable workers within this range. Generally, trusted server (i.e., database owner) should be deployed protect location privacy during the process, which is not desirable in practice. paper, we propose privacy-preserving (PPTR) schemes with query without owner. Specifically, first PPTR scheme linear search...

In this article, we aim to design an architecture for privacy-preserved credit data and model sharing guarantee the secure storage of information in a distributed environment. The proposed optimizes privacy by instead revealing actual data. This article also proposes efficient mechanism combined with deletable Bloom filter uniform consensus training computation process. addition, propose authority control contract verification certification results under federated learning. Extensive...

Secure cross-domain authorization and authentication (AA) enable application service providers (ASPs) to allow users for resource access from different trusted domains. In this article, we propose a unified blockchain-assisted secure AA framework smart city, which can guarantee transparent while preserving user privacy. the framework, ASPs flexibly delegate their capabilities blockchain, authorized by be authenticated blockchain where events are publicly audited traced. Since is accessible,...

We consider exact repair of failed nodes in maximum distance separable (MDS) code based distributed storage systems. It is well known that an (n, k) MDS can tolerate failure (erasure) up to n - k disks, when the used store information elements over disks. The focus this paper optimal recovery, terms bandwidth amount data be downloaded a node for single node. When fails, it has been previously shown by Dimakis et. al. at least equation units, each disk stores ℒ units data. achievability lower...

In this article, we propose an accountable and efficient data sharing scheme for industrial IoT (IIoT), named (ADS), in which a owner can pursue the responsibility of receiver if latter leaks some sensitive shared to public profits while without permission (i.e., accountability). Specifically, ADS is built upon adaptive decentralized oblivious transfer protocol together with zero-knowledge proof technique, enables receiver's private key be hidden from yet correctly embedded into during...

Data are generated by Internet of Things (IoT) devices and centralized at a cloud server, that can later be traded with third parties, i.e., data marketing, to enable various data-intensive applications. However, the approach is recently under debate due lack (1) transparent distributed marketplace management, (2) marketing fairness for both IoT users (data sellers) parties buyers). In this paper, we propose Blockchain-Cloud Transparent Marketing (Block-DM) consortium management executable...