Natural disasters such as earthquakes, hurricanes, and other extreme weather pose serious risks to modern critical infrastructure including electrical distribution grids. Recent U.S. government sources [1, 2] suggest that new methodologies for improving system resilience to these events is necessary. Here, we focus on developing methods for designing and upgrading these grids to better withstan...

We present a new approach to construct several leakage-resilient cryptographic primitives, including leakage-resilient public-key encryption (PKE) schemes, authenticated key exchange (AKE) protocols and low-latency key exchange (LLKE) protocols. To this end, we introduce a new primitive called leakage-resilient non-interactive key exchange (LR-NIKE) protocol. We introduce a generic security mod...

positive psychology as a field focuses on identifying and supporting internal strengths and external resources to promote optimal functioning, flourishing, and resilience in individual, organizations, and communities. research and interventions from the field are helping people be happy, productive, and resilient. from this perspective, each person has a unique set of strengths, which when used...

a non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. the main idea behind nonmalleable coding is that the adversary should not be able to obtain any valuable information about the message. non-malleablecodes are used in tamper-resilient cryptography and protecting memories against tampering attacks. many different types of nonmalleability have already...

To support reliable multicast routing in wireless mesh networks, it is important to protect multicast sessions against link or node failures. In this paper, we propose a resilient forwarding mesh approach for protecting a multicast session. Utilizing the wireless broadcast advantage, a resilient forwarding mesh effectively establishes two node disjoint paths for each source-destination pair. Th...

Recently, Luby et al. constructed information-theoretically almost optimal loss-resilient codes. The construction is based on a sequence of bipartite graphs. Using a probabilistic construction for the individual bipartite graphs, they obtain loss-resilient codes that have very eecient encoding and decoding algorithms. They left open the question whether there are other bipartite graphs leading ...

Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in cryptology and the theory of algorithms. Among their applications are universal hashing, authentication codes, resilient and correlation-immune functions, derandomization of algorithms, and perfect local randomizers. In this paper, we give new explicit bounds on the size of orthogonal arrays usin...