English
Related papers

Related papers: An efficient implementation of the Shamir secret s…

200 papers

A large class of MDS linear codes is constructed. These codes are endowed with an efficient decoding algorithm. Both the definition of the codes and the design of their decoding algorithm only require from Linear Algebra methods, making…

Information Theory · Computer Science 2020-06-02 José Gómez-Torrecillas , Gabriel Navarro , José Patricio Sánchez-Hernández

E-voting systems (EVS)are having potential advantages over many existing voting schemes.Security, transparency, accuracy and reliability are the major concern in these systems.EVS continues to grow as the technology advances.It is…

Cryptography and Security · Computer Science 2015-02-27 Divya G. Nair , V. P. Binu , G. Santhosh Kumar

A homomorphic secret sharing (HSS) scheme is a secret sharing scheme that supports evaluating functions on shared secrets by means of a local mapping from input shares to output shares. We initiate the study of the download rate of HSS,…

Information Theory · Computer Science 2022-05-31 Ingerid Fosli , Yuval Ishai , Victor I. Kolobov , Mary Wootters

It is an important task to construct quantum maximum-distance-separable (MDS) codes with good parameters. In the present paper, we provide six new classes of q-ary quantum MDS codes by using generalized Reed-Solomon (GRS) codes and…

Information Theory · Computer Science 2019-12-06 Weijun Fang , Fang-Wei Fu

Maximum distance separable (MDS) and almost maximum distance separable (AMDS) codes have been widely used in various fields such as communication systems, data storage, and quantum codes because of their algebraic properties and excellent…

Information Theory · Computer Science 2026-04-08 Meiying Zhang , Shudi Yang , Yanbin Zheng

Products of MDS codes are of major practical importance; for a recent example, they are used in Data Availability Sampling (DAS) in blockchain networks such as Celestia and as part of the Ethereum roadmap. This motivates us to consider…

Information Theory · Computer Science 2026-04-17 Amit Berman , Yaron Shany , Itzhak Tamo

Maximum distance separable (MDS) array codes are XOR-based optimal erasure codes that are particularly suitable for use in disk arrays. This paper develops an innovative method to build MDS array codes from an elegant class of nested…

Information Theory · Computer Science 2016-11-18 Nattakan Puttarak , Phisan Kaewprapha , Boon Chong Ng , Jing , Li

Reed-Solomon (RS) codes are among the most ubiquitous codes due to their good parameters as well as efficient encoding and decoding procedures. However, RS codes suffer from having a fixed length. In many applications where the length is…

Information Theory · Computer Science 2024-05-01 Fernando Hernando , Kyle Marshall , Michael E. O'Sullivan

Traditionally, multi-trial error/erasure decoding of Reed-Solomon (RS) codes is based on Bounded Minimum Distance (BMD) decoders with an erasure option. Such decoders have error/erasure tradeoff factor L=2, which means that an error is…

Information Theory · Computer Science 2015-03-19 Christian Senger , Vladimir R. Sidorenko , Martin Bossert , Victor V. Zyablov

A $(t,m)$-threshold secret sharing and multisecret-sharing scheme based on Shamir's SSS are introduced with two-level security using a one-way function. Besides we give its application in smart contract-enabled consortium blockchain…

Cryptography and Security · Computer Science 2022-09-09 R. K. Sharma , Ritumoni Sarma , Neha Arora , Vidya Sagar

We consider the problem of Private Information Retrieval with Private Side Information (PIR-PSI), wherein a user wants to retrieve a file from replication based non-colluding databases by using the prior knowledge of a subset of the files…

Information Theory · Computer Science 2021-05-18 Murali Krishnan K. H. , J. Harshan

Generalized Reed-Solomon (RS) codes are a common choice for efficient, reliable error correction in memory and communications systems. These codes add $2t$ extra parity symbols to a block of memory, and can efficiently and reliably correct…

Information Theory · Computer Science 2024-05-28 Mike Hamburg , Eric Linstadt , Danny Moore , Thomas Vogelsang

The paper is devoted to the problem of erasure coding in distributed storage. We consider a model of storage that assumes that nodes are organized into equally sized groups, called racks, that within each group the nodes can communicate…

Information Theory · Computer Science 2019-01-15 Zitan Chen , Alexander Barg

In this paper, we consider the convertible codes with the maximum distance separable (MDS) property, which can adjust the code rate according to the failure rates of devices. We first extend the notion of convertible codes to allow initial…

Information Theory · Computer Science 2024-07-22 Songping Ge , Han Cai , Xiaohu Tang

A ($t$, $n$) threshold quantum secret sharing (QSS) is proposed based on a single $d$-level quantum system. It enables the ($t$, $n$) threshold structure based on Shamir's secret sharing and simply requires sequential communication in…

Quantum Physics · Physics 2018-10-10 Changbin Lu , Fuyou Miao , Junpeng Hou , Keju Meng

MDS (maximum distance separable) array codes are widely used in storage systems due to their computationally efficient encoding and decoding procedures. An MDS code with r redundancy nodes can correct any r erasures by accessing (reading)…

Information Theory · Computer Science 2011-07-11 Zhiying Wang , Itzhak Tamo , Jehoshua Bruck

Network coding is an efficient means to improve the spectrum efficiency of satellite communications. However, its resilience to eavesdropping attacks is not well understood. This paper studies the confidentiality issue in a bidirectional…

Information Theory · Computer Science 2016-11-17 Ashkan Kalantari , Gan Zheng , Zhen Gao , Zhu Han , Björn Ottersten

The rising need of secret image sharing with high security has led to much advancement in lucrative exchange of important images which contain vital and confidential information. Multi secret image sharing system (MSIS) is an efficient and…

Cryptography and Security · Computer Science 2017-10-27 Karthik Reddy , Tejas K , Swathi C , Ashok K , Rajesh Kumar M

Quantum maximum-distance-separable (MDS for short) codes are an important class of quantum codes. In this paper, by using Hermitian self-orthogonal generalized Reed-Solomon (GRS for short) codes, we construct five new classes of $q$-ary…

Information Theory · Computer Science 2023-07-11 Ruhao Wan , Shixin Zhu

Let $p$ be a prime and let $q$ be a power of $p$. In this paper, by using generalized Reed-Solomon (GRS for short) codes and extended GRS codes, we construct two new classes of quantum maximum-distance- separable (MDS) codes with parameters…

Information Theory · Computer Science 2018-07-17 Weijun Fang , Fang-Wei Fu