A recent trend in cryptography is to formally show the leakage resilience of cryptographic
implementations in a given leakage model. A realistic model is to assume that leakages are …

In the past 15 years, cryptography has made considerable progress in expanding the
adversarial attack model to cover side-channel attacks and has built schemes to provably …

A recent trend in cryptography is to formally show the leakage resilience of cryptographic
implementations in a given leakage model. One of the most prominent leakage model—the …

Motivated by cryptographic applications, we study the notion of bounded indistinguishability,
a natural relaxation of the well studied notion of bounded independence. We say that two …

We present a universal framework for tamper and leakage resilient computation on a
random access machine (RAM). The RAM has one CPU that accesses a storage, which we …

We put forward a new approach for the design of efficient multiparty protocols: 1 Design a
protocol π for a small number of parties (say, 3 or 4) which achieves security against a single …

Let G be a group of prime order q, and let g 1,…, gn be random elements of G. We say that a
vector x= (x_1,...,x_n)∈Z_q^n is a discrete log representation of some some element y∈G …

Side channel attacks–attacks that exploit implementation-dependent information of a
cryptosystem–have been shown to be highly detrimental, and the cryptographic community …

We consider the problem of constructing leakage-resilient circuit compilers that are secure
against global leakage functions with bounded output length. By global, we mean that the …

A leakage-resilient circuit for f:{0, 1} n→{0, 1} m is a randomized Boolean circuit C mapping
a randomized encoding of an input x to an encoding of y= f (x), such that applying any …