We show the following hold, unconditionally unless otherwise stated, relative to a random
oracle:—There are NP search problems solvable by quantum polynomial-time (QPT) …

Recent advances in blockchain technology suggest that the technology has potential for use
in applications in a variety of new domains including spatio-temporal data management. The …

In a seminal work, Goldreich, Micali and Wigderson (CRYPTO'86) demonstrated the wide
applicability of zero-knowledge proofs by constructing such a proof system for the NP …

Constructing collision-resistant hash families (CRHFs) from one-way functions is a long-
standing open problem and source of frustration in theoretical cryptography. In fact, there are …

Batch proofs are proof systems that convince a verifier that x 1,…, xt∈ L, for some NP
language L, with communication that is much shorter than sending the t witnesses. In the …

A k-collision for a compressing hash function H is a set of k distinct inputs that all map to the
same output. In this work, we show that for any constant k,\varTheta\left (N^ 1 2 (1-1 2^ k …

Ramsey theory assures us that in any graph there is a clique or independent set of a certain
size, roughly logarithmic in the graph size. But how difficult is it to find the clique or …

Is quantum computing truly faster than classical computing? Demonstrating unconditional
quantum computational advantage lies beyond the reach of the current complexity theory …

We study the power of preprocessing adversaries in finding bounded-length collisions in the
widely used Merkle-Damgård (MD) hashing in the random oracle model. Specifically, we …

Non-malleable codes allow one to encode data in such a way that once a codeword is being
tampered with, the modified codeword is either an encoding of the original message, or a …