scholarly journals Rectangular, range, and restricted AONTs: Three generalizations of all-or-nothing transforms

2022 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Navid Nasr Esfahani ◽  
Douglas R. Stinson
Keyword(s):  
Information Security ◽  
Distributed Storage ◽  
Orthogonal Arrays ◽  
Mds Codes ◽  
Combinatorial Structures ◽  
Difference Matrices

<p style='text-indent:20px;'>All-or-nothing transforms (AONTs) were originally defined by Rivest [<xref ref-type="bibr" rid="b14">14</xref>] as bijections from <inline-formula><tex-math id="M1">\begin{document}$ s $\end{document}</tex-math></inline-formula> input blocks to <inline-formula><tex-math id="M2">\begin{document}$ s $\end{document}</tex-math></inline-formula> output blocks such that no information can be obtained about any input block in the absence of any output block. Numerous generalizations and extensions of all-or-nothing transforms have been discussed in recent years, many of which are motivated by diverse applications in cryptography, information security, secure distributed storage, etc. In particular, <inline-formula><tex-math id="M3">\begin{document}$ t $\end{document}</tex-math></inline-formula>-AONTs, in which no information can be obtained about any <inline-formula><tex-math id="M4">\begin{document}$ t $\end{document}</tex-math></inline-formula> input blocks in the absence of any <inline-formula><tex-math id="M5">\begin{document}$ t $\end{document}</tex-math></inline-formula> output blocks, have received considerable study.</p><p style='text-indent:20px;'>In this paper, we study three generalizations of AONTs that are motivated by applications due to Pham et al. [<xref ref-type="bibr" rid="b13">13</xref>] and Oliveira et al. [<xref ref-type="bibr" rid="b12">12</xref>]. We term these generalizations rectangular, range, and restricted AONTs. Briefly, in a rectangular AONT, the number of outputs is greater than the number of inputs. A range AONT satisfies the <inline-formula><tex-math id="M6">\begin{document}$ t $\end{document}</tex-math></inline-formula>-AONT property for a range of consecutive values of <inline-formula><tex-math id="M7">\begin{document}$ t $\end{document}</tex-math></inline-formula>. Finally, in a restricted AONT, the unknown outputs are assumed to occur within a specified set of "secure" output blocks. We study existence and non-existence and provide examples and constructions for these generalizations. We also demonstrate interesting connections with combinatorial structures such as orthogonal arrays, split orthogonal arrays, MDS codes and difference matrices.</p>

Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage

2013 ◽  
Vol 59 (5) ◽  
pp. 2974-2987 ◽  
Author(s):  
Viveck R. Cadambe ◽  
Syed Ali Jafar ◽  
Hamed Maleki ◽  
Kannan Ramchandran ◽  
Changho Suh
Keyword(s):  
Distributed Storage ◽  
Interference Alignment ◽  
Mds Codes

scholarly journals Challenges of Credit Reference Based on Big Data Technology in China

2021 ◽  
Author(s):  
Cheng-yong Liu ◽  
Chih-Chun Hou
Keyword(s):  
Big Data ◽  
Information Security ◽  
Secure Communication ◽  
Distributed Storage ◽  
Blockchain Technology ◽  
Financial Credit ◽  
Credit Data ◽  
Point To Point ◽  
The Individual ◽  
Big Data Technology

AbstractBig data-based credit reference system gradually attracts wide attention due to its ad-vantages in remedying the shortages of traditional credit reference and dealing with new challenges arising from financial credit management. Nevertheless, this new method is also adapted through different studies and experiments to be problematic with island of credit information and information security. Some researchers begin exploring the possibility of applying blockchain technology to the individual credit reference field. The business links in the individual credit reference can be innovated through the blockchain mechanism so that credit data from different industries get collected through peering points, secure communication and anonymous protection on the basis of such techniques as distributed storage, point-to-point transmission, consensus mechanism and encryption algorithm. In this way, it is feasible to solve island of information and enhance the protection of user information security. A promising future can be expected about the big data-based credit reference, but there are also many problems with blockchain-based credit reference in China.

scholarly journals Implementation of key-cryptosystem for efficient data sharing in cloud environment

2018 ◽  
Vol 7 (3) ◽  
pp. 1172
Author(s):  
Roaa Falih Mahdi ◽  
Salman Goli ◽  
Jumana Waleed
Keyword(s):  
Information Security ◽  
Access Control ◽  
Distributed Storage ◽  
Recovery Process ◽  
Data Recovery ◽  
Cloud Environment ◽  
Information Recovery ◽  
Secure Information ◽  
Efficient Data ◽  
Infor Mation

The distributed storage based on data recovery administration is a promising innovative way that mounts market actively sooner rather than later. However, in spite of the various studies which have been done in terms of secure information recovery over encoded information in cloud administrations, the majority of these studies concentrated on the strict security given to information in an outside space. Those methodologies oblige dynamite expenses to unify on cloud administration supplier that can be an important hindrance to accomplish productive information recovery in distributed storage. In this paper, a proficient information recovery plan utilizing property based encryption was proposed. The proposed plan is most appropriate for distributed storage frameworks with the gigantic measure of infor-mation. Affluent expressiveness as access control and quick pursuits with straightforward examinations of looking elements were given. Additionally, the plan ensures information security and client protection among information recovery process.  

scholarly journals Constructions of irredundant orthogonal arrays

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Guangzhou Chen ◽  
Xiaotong Zhang
Keyword(s):  
Finite Fields ◽  
Orthogonal Array ◽  
Orthogonal Arrays ◽  
Physical Review ◽  
Local Dimension ◽  
Difference Matrices ◽  
Uniform State ◽  
Definition Of

<p style='text-indent:20px;'>An <inline-formula><tex-math id="M1">\begin{document}$ N \times k $\end{document}</tex-math></inline-formula> array <inline-formula><tex-math id="M2">\begin{document}$ A $\end{document}</tex-math></inline-formula> with entries from <inline-formula><tex-math id="M3">\begin{document}$ v $\end{document}</tex-math></inline-formula>-set <inline-formula><tex-math id="M4">\begin{document}$ \mathcal{V} $\end{document}</tex-math></inline-formula> is said to be an <i>orthogonal array</i> with <inline-formula><tex-math id="M5">\begin{document}$ v $\end{document}</tex-math></inline-formula> levels, strength <inline-formula><tex-math id="M6">\begin{document}$ t $\end{document}</tex-math></inline-formula> and index <inline-formula><tex-math id="M7">\begin{document}$ \lambda $\end{document}</tex-math></inline-formula>, denoted by OA<inline-formula><tex-math id="M8">\begin{document}$ (N,k,v,t) $\end{document}</tex-math></inline-formula>, if every <inline-formula><tex-math id="M9">\begin{document}$ N\times t $\end{document}</tex-math></inline-formula> sub-array of <inline-formula><tex-math id="M10">\begin{document}$ A $\end{document}</tex-math></inline-formula> contains each <inline-formula><tex-math id="M11">\begin{document}$ t $\end{document}</tex-math></inline-formula>-tuple based on <inline-formula><tex-math id="M12">\begin{document}$ \mathcal{V} $\end{document}</tex-math></inline-formula> exactly <inline-formula><tex-math id="M13">\begin{document}$ \lambda $\end{document}</tex-math></inline-formula> times as a row. An OA<inline-formula><tex-math id="M14">\begin{document}$ (N,k,v,t) $\end{document}</tex-math></inline-formula> is called <i>irredundant</i>, denoted by IrOA<inline-formula><tex-math id="M15">\begin{document}$ (N,k,v,t) $\end{document}</tex-math></inline-formula>, if in any <inline-formula><tex-math id="M16">\begin{document}$ N\times (k-t ) $\end{document}</tex-math></inline-formula> sub-array, all of its rows are different. Goyeneche and <inline-formula><tex-math id="M17">\begin{document}$ \dot{Z} $\end{document}</tex-math></inline-formula>yczkowski firstly introduced the definition of an IrOA and showed that an IrOA<inline-formula><tex-math id="M18">\begin{document}$ (N,k,v,t) $\end{document}</tex-math></inline-formula> corresponds to a <inline-formula><tex-math id="M19">\begin{document}$ t $\end{document}</tex-math></inline-formula>-uniform state of <inline-formula><tex-math id="M20">\begin{document}$ k $\end{document}</tex-math></inline-formula> subsystems with local dimension <inline-formula><tex-math id="M21">\begin{document}$ v $\end{document}</tex-math></inline-formula> (Physical Review A. 90 (2014), 022316). In this paper, we present some new constructions of irredundant orthogonal arrays by using difference matrices and some special matrices over finite fields, respectively, as a consequence, many infinite families of irredundant orthogonal arrays are obtained. Furthermore, several infinite classes of <inline-formula><tex-math id="M22">\begin{document}$ t $\end{document}</tex-math></inline-formula>-uniform states arise from these irredundant orthogonal arrays.</p>

Sign in / Sign up

Export Citation Format

Share Document