This paper surveys the literature on certificateless encryption schemes. In particular, we
examine the large number of security models that have been proposed to prove the security …

One of the most important and successful tools for assessing hardness assumptions in
cryptography is the Generic Group Model (GGM). Over the past two decades, numerous …

To instill greater confidence in computations outsourced to the cloud, clients should be able
to verify the correctness of the results returned. To this end, we introduce Pinocchio, a built …

Blockchain, as one of the crypto-intensive creatures, has become a very hot topic recently.
Although many surveys have recently been dedicated to the security and privacy issues of …

An argument system for NP is a proof system that allows efficient verification of NP
statements, given proofs produced by an untrusted yet computationally-bounded prover …

We introduce a new characterization of the NP complexity class, called Quadratic Span
Programs (QSPs), which is a natural extension of span programs defined by Karchmer and …

Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an
important discipline that is not only the subject of an enormous amount of research, but …

We argue that the random oracle model—where all parties have access to a public random
oracle—provides a bridge between cryptographic theory and cryptographic practice. In the …

We introduce a model for provable data possession (PDP) that allows a client that has
stored data at an untrusted server to verify that the server possesses the original data …

The existence of succinct non-interactive arguments for NP (ie, non-interactive
computationally-sound proofs where the verifier's work is essentially independent of the …