[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Pawar et al., 2010 - Google Patents

On secure distributed data storage under repair dynamics

Pawar et al., 2010

View PDF
Document ID
5038203042224618453
Author
Pawar S
El Rouayheb S
Ramchandran K
Publication year
Publication venue
2010 IEEE International Symposium on Information Theory

External Links

Snippet

We address the problem of securing distributed storage systems against passive eavesdroppers that can observe a limited number of storage nodes. An important aspect of these systems is node failures over time, which demand a repair mechanism aimed at …
Continue reading at arxiv.org (PDF) (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
    • H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communication the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/34—Encoding or coding, e.g. Huffman coding or error correction
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks

Similar Documents

Publication Publication Date Title
Pawar et al. On secure distributed data storage under repair dynamics
Pawar et al. Securing dynamic distributed storage systems against eavesdropping and adversarial attacks
Rawat et al. Optimal locally repairable and secure codes for distributed storage systems
Papailiopoulos et al. Locally repairable codes
Cadambe et al. Bounds on the size of locally recoverable codes
Andersson et al. Nested polar codes for wiretap and relay channels
El Rouayheb et al. Fractional repetition codes for repair in distributed storage systems
Silberstein et al. Error resilience in distributed storage via rank-metric codes
Oggier et al. Coding techniques for repairability in networked distributed storage systems
Gad et al. Asymmetric error correction and flash-memory rewriting using polar codes
Koyluoglu et al. Secure cooperative regenerating codes for distributed storage systems
Tandon et al. Toward optimal secure distributed storage systems with exact repair
Silberstein et al. Error-correcting regenerating and locally repairable codes via rank-metric codes
Kadhe et al. Weakly secure regenerating codes for distributed storage
Pawar et al. Securing dynamic distributed storage systems from malicious nodes
Yi et al. Achieving strong security based on fountain code with coset pre‐coding
Liu et al. On storage codes allowing partially collaborative repairs
Kosut Polytope codes for distributed storage in the presence of an active omniscient adversary
Mahdaviani et al. Bandwidth adaptive & error resilient regenerating codes with minimum repair bandwidth
Shahabinejad et al. On the average locality of locally repairable codes
Huang et al. Generic secure repair for distributed storage
Chanayai et al. Fountain codes and their applications: Comparison and implementation for wireless applications
Kim et al. New results on network error correction: capacities and upper bounds
Oggier et al. Homomorphic self-repairing codes for agile maintenance of distributed storage systems
Yue et al. Design of network coding for wireless broadcast and multicast with optimal decoders