Rainbow connections are natural combinatorial measures that are used in applications to
secure the transfer of classified information between agencies in communication networks …

The concept of rainbow connection was introduced by Chartrand et al.[14] in 2008. It is
interesting and recently quite a lot papers have been published about it. In this survey we …

We construct an efficient information-theoretically non-malleable code in the split-state
model for one-bit messages. Non-malleable codes were introduced recently by …

Randomness extractors and error correcting codes are fundamental objects in computer
science. Recently, there have been several natural generalizations of these objects, in the …

Recently, Bravyi, Gosset, and Konig (Science, 2018) exhibited a search problem called the
2D Hidden Linear Function (2D HLF) problem that can be solved exactly by a constant …

The strongest standard security notion for digital signature schemes is unforgeability under
chosen message attacks. In practice, however, this notion can be insufficient due to “side …

We give an introduction to the area of “randomness extraction” and survey the main
concepts of this area: deterministic extractors, seeded extractors and multiple sources …

Increasingly severe I/O bottlenecks on High-End Computing machines are prompting
scientists to process simulation output data online while simulations are running and before …

We study a problem of secure data storage on hardware that may leak information. We
introduce a new primitive, that we call leakage-resilient storage (LRS), which is an …

Let P be a k-ary predicate over a finite alphabet. Consider a random CSP (P) instance I over
n variables with m constraints. When m≫ n the instance will be unsatisfiable with high …