Quantum random sampling is the leading proposal for demonstrating a computational
advantage of quantum computers over classical computers. Recently the first large-scale …

Most of our lives are conducted in the cyberspace. The human notion of privacy translates
into a cyber notion of privacy on many functions that take place in the cyberspace. This …

In the private information retrieval (PIR) problem, a user wishes to retrieve, as efficiently as
possible, one out of K messages from N non-communicating databases (each holds all K …

This beginning graduate textbook describes both recent achievements and classical results
of computational complexity theory. Requiring essentially no background apart from …

Publicly accessible databases are an indispensable resource for retrieving up-to-date
information. But they also pose a significant risk to the privacy of the user, since a curious …

Private information retrieval (PIR) is the problem of retrieving as efficiently as possible, one
out of K messages from N non-communicating replicated databases (each holds all K …

We show that every language in NP has a probablistic verifier that checks membership
proofs for it using logarithmic number of random bits and by examining a constant number of …

A new algebraic technique for the construction of interactive proof systems is presented. Our
technique is used to prove that every language in the polynomial-time hierarchy has an …

IP = PSPACE Page 1 1P = IW?ACE ADI SHAMIR The Welzrnann Institute of Science, Reholot,
Israel Abstract. In this paper, it is proven that when both randomization and interaction are …

Suppose someone gives us an extremely fast program P that we can call as a black box to
compute a function f. Should we trust that P works correctly? A self-testing/correcting pair …