Recently, Halevi et al.(CCS'11) proposed a cryptographic primitive called proofs of
ownership (PoW) to enhance security of client-side deduplication in cloud storage. In a proof …

A natural and recurring idea in the knapsack/lattice cryptography literature is to start from a
lattice with remarkable decoding capability as your private key, and hide it somehow to …

The generation of random numbers via quantum processes is an efficient and reliable
method to obtain true indeterministic random numbers that are of vital importance to …

Oblivious Transfer (OT) is at the heart of secure computation and is a foundation for many
applications in cryptography. Over two decades of work have led to extremely efficient …

Fuzzy extractors derive strong keys from noisy sources. Their security is usually defined
information-theoretically, with gaps between known negative results, existential …

We present here a new family of trapdoor one-way functions that are Preimage Sampleable
on Average (PSA) based on codes, the Wave-PSA family. The trapdoor function is one-way …

The device-unique response of a physically unclonable function (PUF) can serve as the root
of trust in an embedded cryptographic system. Fuzzy extractors transform this noisy non …

In this work we provide a traitor tracing construction with ciphertexts that grow polynomially
in log (n) where n is the number of users and prove it secure under the Learning with Errors …

In recent years there have been several attempts to build white-box block ciphers whose
implementations aim to be incompressible. This includes the weak white-box ASASA …

Zero-knowledge and succinctness are two important properties that arise in the study of non-
interactive arguments. Previously, Kitagawa et al.(TCC 2020) showed how to obtain a non …