Offering high quality services/products has been of paramount importance for both
communications and computations. Early on, both of these were in dire need of practical …

In this article, we take a closer look at the reliability of large minimal networks constructed by
repeated compositions of the simplest possible networks. For a given number of devices we …

In this article, two new techniques of approximation of the reliability of a two-terminal network
are developed based on the constructive theory of functions and related methods. Two …

Although the hammock networks were introduced more than sixty years ago, there is no
general formula of the associated reliability polynomial. Using the full Hermite interpolation …

After two decades of research on signcryption, recently a new cryptographic primitive,
named higncryption, was proposed at ACM CCS'16. Higncryption can be viewed as privacy …

Abstract Applications using Artificial Intelligence techniques demand a thorough assessment
of different aspects of trust, namely, data and model privacy, reliability, robustness against …

Motivated by the study of hammock (aka brick-wall) networks, we introduce in this paper the
notion of X-path, which generates all possible connections through the network. The new …

A classical problem in computer/network reliability is that of identifying simple, regular and
repetitive building blocks (motifs) which yield reliability enhancements at the system-level …

In this paper, we develop a new method for evaluating the reliability polynomial of a
hammock network. The method is based on a homogeneous absorbing Markov chain and …

An open problem in reliability theory is that of finding all the coefficients of the reliability
polynomial associated with particular networks. Because reliability polynomials can be …