English
Related papers

Related papers: Combinatorial Repairability for Threshold Schemes

200 papers

Secret sharing schemes are widely used now a days in various applications, which need more security, trust and reliability. In secret sharing scheme, the secret is divided among the participants and only authorized set of participants can…

Cryptography and Security · Computer Science 2014-06-24 V P Binu , A Sreekumar

A distributed storage system stores data across multiple nodes, with the primary objective of enabling efficient data recovery even in the event of node failures. The main goal of an exact repair scheme is to recover the data from a failed…

Information Theory · Computer Science 2026-01-05 Hiram H. López , Gretchen L. Matthews , Daniel Valvo

This paper presents a novel construction of $(n,k,d=n-1)$ access-optimal regenerating codes for an arbitrary sub-packetization level $\alpha$ for exact repair of any systematic node. We refer to these codes as general sub-packetized because…

Information Theory · Computer Science 2020-02-14 Katina Kralevska , Danilo Gligoroski , Harald Øverby

One of the design objectives in distributed storage system is the minimization of the data traffic during the repair of failed storage nodes. By repairing multiple failures simultaneously and cooperatively, further reduction of repair…

Information Theory · Computer Science 2015-03-20 Kenneth W. Shum , Yuchong Hu

Combinatorial optimization algorithms for graph problems are usually designed afresh for each new problem with careful attention by an expert to the problem structure. In this work, we develop a new framework to solve any combinatorial…

Cooperative regenerating codes are designed for repairing multiple node failures in distributed storage systems. In contrast to the original repair model of regenerating codes, which are for the repair of single node failure, data exchange…

Information Theory · Computer Science 2016-07-29 Kenneth W. Shum , Junyu Chen

Traditionally, reconfiguration problems ask the question whether a given solution of an optimization problem can be transformed to a target solution in a sequence of small steps that preserve feasibility of the intermediate solutions. In…

Discrete Mathematics · Computer Science 2019-01-25 Mark de Berg , Bart M. P. Jansen , Debankur Mukherjee

Erasure coding techniques are getting integrated in networked distributed storage systems as a way to provide fault-tolerance at the cost of less storage overhead than traditional replication. Redundancy is maintained over time through…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-06-12 Lluis Pamies-Juarez , Frédérique Oggier , Anwitaman Datta

Reparable systems are systems that are characterized by their ability to undergo maintenance actions when failures occur. These systems are often described by transport equations, all coupled through an integro-differential equation. In…

Optimization and Control · Mathematics 2024-07-09 Daniel Owusu Adu , Weiwei Hu

Bargaining can be used to resolve mixed-motive games in multi-agent systems. Although there is an abundance of negotiation strategies implemented in automated negotiating agents, most agents are based on single fixed strategies, while it is…

Multiagent Systems · Computer Science 2022-12-21 Bram M. Renting , Holger H. Hoos , Catholijn M. Jonker

The main aim of this paper is to construct a multi-secret sharing scheme for general access structure in a trusted dealer model using suitable hash function and Lagrange's interpolation method. Even though, the proposed scheme is a…

Cryptography and Security · Computer Science 2014-09-02 Partha Sarathi Roy , Avishek Adhikari

The threshold secret sharing scheme allows the dealer to distribute the share to every participant such that the secret is correctly recovered from a certain amount of shares. The traditional $(k, n)$-threshold secret sharing scheme…

Information Theory · Computer Science 2024-02-05 Qi Cheng , Hongru Cao , Sian-Jheng Lin , Nenghai Yu

Calibrated strategies can be obtained by performing strategies that have no internal regret in some auxiliary game. Such strategies can be constructed explicitly with the use of Blackwell's approachability theorem, in an other auxiliary…

Computer Science and Game Theory · Computer Science 2010-07-28 Vianney Perchet

Shamir's celebrated secret sharing scheme provides an efficient method for encoding a secret of arbitrary length $\ell$ among any $N \leq 2^\ell$ players such that for a threshold parameter $t$, (i) the knowledge of any $t$ shares does not…

Cryptography and Security · Computer Science 2018-12-14 Fuchun Lin , Mahdi Cheraghchi , Venkatesan Guruswami , Reihaneh Safavi-Naini , Huaxiong Wang

Non-malleable secret sharing was recently proposed by Goyal and Kumar in independent tampering and joint tampering models for threshold secret sharing (STOC18) and secret sharing with general access structure (CRYPTO18). The idea of making…

Cryptography and Security · Computer Science 2019-06-18 Fuchun Lin , Mahdi Cheraghchi , Venkatesan Guruswami , Reihaneh Safavi-Naini , Huaxiong Wang

Dau et al. recently extend Guruswami and Wootters' scheme (STOC'2016) to cooperatively repair two or three erasures in Reed-Solomon (RS) codes. However, their scheme restricts to either the case that the characteristic of $F$ divides the…

Information Theory · Computer Science 2019-01-11 Yaqian Zhang , Zhifang Zhang

The reliability of erasure-coded distributed storage systems, as measured by the mean time to data loss (MTTDL), depends on the repair bandwidth of the code. Repair-efficient codes provide reliability values several orders of magnitude…

Information Theory · Computer Science 2017-08-04 Vaneet Aggarwal , Chao Tian , Vinay A. Vaishampayan , Yih-Farn R. Chen

Future systems based on nano-scale devices will provide great potentials for scaling up in system complexity, yet they will be highly susceptible to operational faults. While spare units can be generally used to enhance reliability, they…

Hardware Architecture · Computer Science 2018-12-05 Soroush Khaleghi , Wenjing Rao

The goal of model-based diagnosis is to isolate causes of anomalous system behavior and recommend inexpensive repair actions in response. In general, precomputing optimal repair policies is intractable. To date, investigators addressing…

Artificial Intelligence · Computer Science 2013-02-21 Sampath Srinivas , Eric J. Horvitz

We present a practical methodology for securing the password-based authentication scheme. We propose a solution based on the well-known (k,n) threshold scheme of Shamir for sharing a secret, where in our case the secret is the password…

Cryptography and Security · Computer Science 2018-06-20 Andrea Bissoli , Fabrizio d'Amore