As storage-outsourcing services and resource-sharing networks have become popular, the
problem of efficiently proving the integrity of data stored at untrusted servers has received …

Bit coin is widely regarded as the first broadly successful e-cash system. An oft-cited
concern, though, is that mining Bit coins wastes computational resources. Indeed, Bit coin's …

This paper presents Checklist, a system for private blocklist lookups. In Checklist, a client
can determine whether a particular string appears on a server-held blocklist of strings …

Proofs of retrievability allow a client to store her data on a remote server (eg,“in the cloud”)
and periodically execute an efficient audit protocol to check that all of the data are being …

Cloud storage auditing is viewed as an important service to verify the integrity of the data in
public cloud. Current auditing protocols are all based on the assumption that the client's …

Ateniese et al. proposed the Provable Data Possession (PDP) model in 2007. Following
that, Erway et al. adapted the model for dynamically updatable data and called it the …

Non-malleable codes are a generalization of classical error-correcting codes where the act
of “corrupting” a codeword is replaced by a “tampering” adversary. Non-malleable codes …

A non-malleable code protects messages against a class of tampering functions. Informally,
a code is non-malleable if the effect of applying any tampering function on an encoded …

We formalize the notion of Verifiable Oblivious Storage (VOS), where a client outsources the
storage of data to a server while ensuring data confidentiality, access pattern privacy, and …

We show a general framework for constructing non-malleable codes against tampering
families with average-case hardness bounds. Our framework adapts ideas from the Naor …