The Experts below are selected from a list of 48 Experts worldwide ranked by ideXlab platform

H. Vincent Poor - One of the best experts on this subject based on the ideXlab platform.

  • Data Secrecy in Distributed Storage Systems under Exact Repair
    arXiv: Information Theory, 2013
    Co-Authors: Sreechakra Goparaju, Salim El Rouayheb, Robert Calderbank, H. Vincent Poor
    Abstract:

    The problem of securing data against eavesdropping in distributed storage systems is studied. The focus is on systems that use linear codes and implement exact repair to recover from node failures.The Maximum File Size that can be stored securely is determined for systems in which all the available nodes help in repair (i.e., repair degree $d=n-1$, where $n$ is the total number of nodes) and for any number of compromised nodes. Similar results in the literature are restricted to the case of at most two compromised nodes. Moreover, new explicit upper bounds are given on the Maximum secure File Size for systems with $d

  • NetCod - Data secrecy in distributed storage systems under exact repair
    2013 International Symposium on Network Coding (NetCod), 2013
    Co-Authors: Sreechakra Goparaju, Salim El Rouayheb, Robert Calderbank, H. Vincent Poor
    Abstract:

    The problem of securing data against eavesdropping in distributed storage systems is studied. The focus is on systems that use linear codes and implement exact repair to recover from node failures. The Maximum File Size that can be stored securely is determined for systems in which all the available nodes help in repair (i.e., repair degree d = n -1, where n is the total number of nodes) and for any number of compromised nodes. Similar results in the literature are restricted to the case of at most two compromised nodes. Moreover, new explicit upper bounds are given on the Maximum secure File Size for systems with d

Sreechakra Goparaju - One of the best experts on this subject based on the ideXlab platform.

  • Data Secrecy in Distributed Storage Systems under Exact Repair
    arXiv: Information Theory, 2013
    Co-Authors: Sreechakra Goparaju, Salim El Rouayheb, Robert Calderbank, H. Vincent Poor
    Abstract:

    The problem of securing data against eavesdropping in distributed storage systems is studied. The focus is on systems that use linear codes and implement exact repair to recover from node failures.The Maximum File Size that can be stored securely is determined for systems in which all the available nodes help in repair (i.e., repair degree $d=n-1$, where $n$ is the total number of nodes) and for any number of compromised nodes. Similar results in the literature are restricted to the case of at most two compromised nodes. Moreover, new explicit upper bounds are given on the Maximum secure File Size for systems with $d

  • NetCod - Data secrecy in distributed storage systems under exact repair
    2013 International Symposium on Network Coding (NetCod), 2013
    Co-Authors: Sreechakra Goparaju, Salim El Rouayheb, Robert Calderbank, H. Vincent Poor
    Abstract:

    The problem of securing data against eavesdropping in distributed storage systems is studied. The focus is on systems that use linear codes and implement exact repair to recover from node failures. The Maximum File Size that can be stored securely is determined for systems in which all the available nodes help in repair (i.e., repair degree d = n -1, where n is the total number of nodes) and for any number of compromised nodes. Similar results in the literature are restricted to the case of at most two compromised nodes. Moreover, new explicit upper bounds are given on the Maximum secure File Size for systems with d

Salim El Rouayheb - One of the best experts on this subject based on the ideXlab platform.

  • Data Secrecy in Distributed Storage Systems under Exact Repair
    arXiv: Information Theory, 2013
    Co-Authors: Sreechakra Goparaju, Salim El Rouayheb, Robert Calderbank, H. Vincent Poor
    Abstract:

    The problem of securing data against eavesdropping in distributed storage systems is studied. The focus is on systems that use linear codes and implement exact repair to recover from node failures.The Maximum File Size that can be stored securely is determined for systems in which all the available nodes help in repair (i.e., repair degree $d=n-1$, where $n$ is the total number of nodes) and for any number of compromised nodes. Similar results in the literature are restricted to the case of at most two compromised nodes. Moreover, new explicit upper bounds are given on the Maximum secure File Size for systems with $d

  • NetCod - Data secrecy in distributed storage systems under exact repair
    2013 International Symposium on Network Coding (NetCod), 2013
    Co-Authors: Sreechakra Goparaju, Salim El Rouayheb, Robert Calderbank, H. Vincent Poor
    Abstract:

    The problem of securing data against eavesdropping in distributed storage systems is studied. The focus is on systems that use linear codes and implement exact repair to recover from node failures. The Maximum File Size that can be stored securely is determined for systems in which all the available nodes help in repair (i.e., repair degree d = n -1, where n is the total number of nodes) and for any number of compromised nodes. Similar results in the literature are restricted to the case of at most two compromised nodes. Moreover, new explicit upper bounds are given on the Maximum secure File Size for systems with d

Robert Calderbank - One of the best experts on this subject based on the ideXlab platform.

  • Data Secrecy in Distributed Storage Systems under Exact Repair
    arXiv: Information Theory, 2013
    Co-Authors: Sreechakra Goparaju, Salim El Rouayheb, Robert Calderbank, H. Vincent Poor
    Abstract:

    The problem of securing data against eavesdropping in distributed storage systems is studied. The focus is on systems that use linear codes and implement exact repair to recover from node failures.The Maximum File Size that can be stored securely is determined for systems in which all the available nodes help in repair (i.e., repair degree $d=n-1$, where $n$ is the total number of nodes) and for any number of compromised nodes. Similar results in the literature are restricted to the case of at most two compromised nodes. Moreover, new explicit upper bounds are given on the Maximum secure File Size for systems with $d

  • NetCod - Data secrecy in distributed storage systems under exact repair
    2013 International Symposium on Network Coding (NetCod), 2013
    Co-Authors: Sreechakra Goparaju, Salim El Rouayheb, Robert Calderbank, H. Vincent Poor
    Abstract:

    The problem of securing data against eavesdropping in distributed storage systems is studied. The focus is on systems that use linear codes and implement exact repair to recover from node failures. The Maximum File Size that can be stored securely is determined for systems in which all the available nodes help in repair (i.e., repair degree d = n -1, where n is the total number of nodes) and for any number of compromised nodes. Similar results in the literature are restricted to the case of at most two compromised nodes. Moreover, new explicit upper bounds are given on the Maximum secure File Size for systems with d

O. Ozan Koyluoglu - One of the best experts on this subject based on the ideXlab platform.

  • ISIT - Secure regenerating codes for hybrid cloud storage systems
    2017 IEEE International Symposium on Information Theory (ISIT), 2017
    Co-Authors: Islam Samy, Gokhan Calis, O. Ozan Koyluoglu
    Abstract:

    We study the scenario of hybrid cloud storage where the client utilizes both an off-site and a local storage. The former is a distributed storage system (DSS) with the presence of an eavesdropper that has access to the content stored in and downloaded to some subset of nodes. The latter (local) storage is utilized to store a secret key to secure the stored File against the eavesdropper. We introduce two possibilities to utilize local storage (secret key) in enhancing the DSS. First, the key can be used to increase the Maximum File Size stored in the DSS. We propose an upper bound for this scenario and show constructions achieving it. Second, the key can be used to decrease the number of contacted nodes required to reconstruct the File at the client. We extend the product matrix (PM) framework and construct codes that enables efficient data access. Our analysis includes both minimum repair bandwidth regenerating (MBR) and minimum storage regenerating (MSR) codes.