We build the first unleveled fully homomorphic signature scheme in the standard model. Our
scheme is not constrained by any a-priori bound on the depth of the functions that can be …

Over the development of modern cryptography, often, alternative cryptographic schemes are
developed to achieve goals that in some important respect are orthogonal. Thus, we have to …

We provide a standard-model implementation (of a relaxation) of the algebraic group model
(AGM,[Fuchsbauer, Kiltz, Loss, CRYPTO 2018]). Specifically, we show that every algorithm …

Abstract Decentralized Anonymous Payment (DAP) frameworks provide users with the
capability to securely and privately transfer cryptocurrencies. These frameworks enable …

Non-interactive zero-knowledge proofs (NIZKs) are important primitives in cryptography. A
major challenge since the early works on NIZKs has been to construct NIZKs with a …

Non-interactive zero-knowledge (NIZK) proof systems are a cornerstone of modern
cryptography, but their security has received little attention in the quantum settings …

A hash function family $\mathcal {H} $ is correlation intractable for a $ t $-input relation
$\mathcal {R} $ if, given a random function $ h $ chosen from $\mathcal {H} $, it is hard to …

Information technology systems have become indispensable to uphold our way of living, our
economy and our safety. Failure of these systems can have devastating effects …

A hash function family H is correlation intractable for a t-input relation R if, given a random
function h chosen from H, it is hard to find x1,..., xt such that R (x1,..., xt, h (x1),..., h (xt)) is …

When talking about the security of a cryptographic scheme, researchers often model it as a
game between a challenger and an adversary. Such a game gives a clear description of the …