Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Esfahani, Navid Nasr"'
Non-overlapping codes have been studied for almost 60 years. In such a code, no proper, non-empty prefix of any codeword is a suffix of any codeword. In this paper, we study codes in which overlaps of certain specified sizes are forbidden. We prove s
Externí odkaz:
http://arxiv.org/abs/2211.10309
All-or-nothing transforms (AONT) were proposed by Rivest as a message preprocessing technique for encrypting data to protect against brute-force attacks, and have numerous applications in cryptography and information security. Later the unconditional
Externí odkaz:
http://arxiv.org/abs/2202.10280
Autor:
Esfahani, Navid Nasr, Stinson, Douglas
All-or-nothing transforms (AONTs) were originally defined by Rivest as bijections from $s$ input blocks to $s$ output blocks such that no information can be obtained about any input block in the absence of any output block. Numerous generalizations a
Externí odkaz:
http://arxiv.org/abs/2111.05961
In this paper, we initiate a study of asymmetric all-or-nothing transforms (or asymmetric AONTs). A (symmetric) $t$-all-or-nothing transform is a bijective mapping defined on the set of $s$-tuples over a specified finite alphabet. It is required that
Externí odkaz:
http://arxiv.org/abs/2105.14988
Publikováno v:
Journal of Combinatorial Mathematics and Combinatorial Computing, volume 107, pp. 137-147, (2018)
Binary self-orthogonal codes and balanced incomplete block designs are two combinatorial configurations that have been much studied because of their wide areas of application. In this paper, we have shown the distribution of (16; 6; 3)-designs in bin
Externí odkaz:
http://arxiv.org/abs/2103.16495
All-or-nothing transforms have been defined as bijective mappings on all s-tuples over a specified finite alphabet. These mappings are required to satisfy certain "perfect security" conditions specified using entropies of the probability distribution
Externí odkaz:
http://arxiv.org/abs/2103.05697
A $(t, s, v)$-all-or-nothing transform is a bijective mapping defined on $s$-tuples over an alphabet of size $v$, which satisfies the condition that the values of any $t$ input co-ordinates are completely undetermined, given only the values of any $s
Externí odkaz:
http://arxiv.org/abs/1702.06612
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We continue a study of unconditionally secure all-or-nothing transforms (AONT) begun in \cite{St}. An AONT is a bijective mapping that constructs s outputs from s inputs. We consider the security of t inputs, when s-t outputs are known. Previous work
Externí odkaz:
http://arxiv.org/abs/1510.03655
Autor:
Esfahani, Navid Nasr, Stinson, Douglas
Publikováno v:
Advances in Mathematics of Communications.
All-or-nothing transforms (AONTs) were originally defined by Rivest [14] as bijections from \begin{document}$ s $\end{document} input blocks to \begin{document}$ s $\end{document} output blocks such that no information can be obtained about any input
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0503933c8f061054028e013b2eebdb7b
https://doi.org/10.3934/amc.2021068
https://doi.org/10.3934/amc.2021068
