The minimum distance between Bent functions and Resilient functions is studied. An algorithm for calculating the minimum distance betw een Bent functions and resilient functions is given. We give a new lower bound for the minimum distance be tween Bent functions and 1 resilient functions. This new lower bound is better than that presented by S. Maity etc in 2004, and their conjectures are prove...

We extend the notions of correlation-immune functions and resilient functions to functions over any nite alphabet endowed with the structure of an Abelian group. Thus we generalize the results of Gopalakrishnan and Stinson as we give an orthogonal array characterization and a Fourier transform characterization for resilient functions over any nite alphabet. This leads to a generalization of som...

We present the design and initial evaluation of a resilient operating system architecture that leverages HW architectures combining few resilient with many non-resilient CPU cores. To this end, we build our system around a Reliable Computing Base (RCB) consisting of those software components that must work for reliable operation, and run the RCB on the resilient cores. The remainder of the syst...

In a recent paper [1], Zhang and Xiao describe a technique on constructing almost optimal resilient functions on even number of variables. In this paper, we will present an extensive study of the constructions of almost optimal resilient functions by using the generalized MaioranaMcFarland (GMM) construction technique. It is shown that for any given m, it is possible to construct infinitely man...

Worldwide water governance failures undermine effective water management under uncertainty and change. Overcoming these failures requires employing more adaptive, resilient water management approaches; yet, while scholars have advance theory of what adaptive, resilient approaches should be, there is little empirical evidence to support those normative propositions. To fill this gap, we reviewed...

Garg, Jain, and Sahai first consider zero knowledge proofs in the presence of leakage on the local state of the prover, and present a leakageresilient-zero-knowledge proof system for HC (Hamiltonian Cycle) problem. Their construction is called (1 + ε)-leakage-resilient zero-knowledge, for any constant ε > 0, because the total length of the leakage the simulator needs is (1 + ε) times as large a...

BACKGROUND The main focus of studies of individuals at ultra-high risk for psychosis (UHR) has been on identifying brain changes in those individuals who will develop psychosis. However, longitudinal studies have shown that up to half of UHR individuals are resilient, with symptomatic remission and good functioning at follow-up. Yet little is known about brain development in resilient individua...

1 In this paper we derive several important results towards a better understanding of propagation characteristics of resilient Boolean functions. We first introduce a new upper bound on nonlinearity of a given resilient function depending on the propagation criterion. We later show that a large class of resilient functions admit a linear structure; more generally, we exhibit some divisibility p...

We analyze the performance of resilient functions for imperfect input bits. Specifically, we allow more input bits than the resiliency degree of the resilient function to be biased and analyze the output behavior under this new assumption. We develop bounds on the output distribution of resilient functions build from a number of families of linear codes. We develop an explicit formula for the p...