A non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. The main idea behind non-malleable coding is that the adversary should not be able to obtain any valuable information about the message. Non-malleable codes are used in tamper-resilient cryptography and protecting memories against tampering attacks. Many different types of non-malleability have alre...

OBJECTIVES To identify plausible mechanisms by which resilience (low mortality rates despite persistent economic adversity) was achieved in some areas in Britain between 1971 and 2001. METHODS Mixed method observational study, combining quantitative analyses of cause- and age group-specific mortality rates, and area sociodemographic and environmental characteristics, with case studies of resi...

and resilient mice. (a) Schematic detailing time-course of chronic social defeat, social interaction testing and tissue collection. (b) To identify susceptible and resilient mice, a social interaction ratio (time in interaction zone with social target/time with target absent) was calculated for each mouse based on (c) behavior in the social interaction test 24 hr after CSDS (susceptible ratio <...

OBJECTIVES To examine 10-year mortality and hospital use among individuals categorised as resilient and vulnerable to the impact of chronic pain. DESIGN A cohort record linkage study. SETTING Grampian, Scotland. PARTICIPANTS 5858 individuals from the Grampian Pain Cohort, established in 1996, were linked, by probability matching, with national routinely collected datasets. MAIN OUTCOME ...

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...