Yao's garbled circuit (GC) construction is a central cryptographic tool with numerous
applications. In this tutorial, we study garbled circuits from a foundational point of view under …

Algebraic independence is a fundamental notion in commutative algebra that generalizes
independence of linear polynomials. Polynomials {f1,…, fm}⊂ K [x1,…, xn](over a field K) …

Collision resistant hash functions are functions that shrink their input, but for which it is
computationally infeasible to find a collision, namely two strings that hash to the same value …

Collision-resistant hash functions (CRH) are a fundamental and ubiquitous cryptographic
primitive. Several recent works have studied a relaxation of CRH called t-way multi-collision …

We show that a decidable promise problem has a non-interactive statistical zero-knowledge
proof system if and only if it is randomly reducible via an honest polynomial-time reduction to …

A version of time-bounded Kolmogorov complexity, denoted KT, has received attention in
the past several years, due to its close connection to circuit complexity and to the Minimum …

Collision resistant hashing is a fundamental concept that is the basis for many of the
important cryptographic primitives and protocols. Collision resistant hashing is a family of …

It is well known that the entropy H (X) of a discrete random variable X is always greater than
or equal to the entropy H (f (X)) of a function f of X, with equality if and only if f is one-to-one …

To what extent can a computation be made “simpler” by settling for computing a randomized
encoding of the output? Originating from Yao's seminal idea of garbled circuits, answers to …

We show a general connection between various types of statistical zero-knowledge (SZK)
proof systems and (unconditionally secure) secret sharing schemes. Viewed through the …