Fine-grained cryptography is constructing cryptosystems in a setting where an adversary's
resource is a-prior bounded and an honest party has less resource than an adversary …

In this work, we initiate a study of K-NIKE protocols in the fine-grained setting, in which there
is a polynomial gap between the running time of the honest parties and that of the adversary …

We construct the first non-interactive zero-knowledge (NIZK) proof systems in the fine-
grained setting where adversaries' resources are bounded and honest users have no more …

Fine-grained cryptographic primitives are secure against adversaries with bounded
resources and can be computed by honest users with less resources than the adversaries …

Fine-grained cryptographic primitives are secure against adversaries with bounded
resources and can be computed by honest users with less resources than the adversaries …

We investigate proof systems where security holds against rational parties instead of
malicious ones. Our starting point is the notion of rational arguments, a variant of rational …

A sequential function is, informally speaking, a function $ f $ for which a massively parallel
adversary cannot compute" substantially" faster than an honest user with limited parallel …

We present a transformation from NIZK with inefficient provers in the uniform random string
(URS) model to ZAPs (two message witness indistinguishable proofs) with inefficient …

We revisit the construction of multiparty non-interactive key-exchange protocols with fine-
grained security, which was recently studied in (Afshar et al., Eurocrypt 2023). Their work …

We consider a setting where a verifier with limited computation power delegates a resource
intensive computation task—which requires a T * S computation tableau—to two provers …