We survey the notion of provably secure searchable encryption (SE) by giving a complete
and comprehensive overview of the two main SE techniques: searchable symmetric …

Abstract Internet of Things (IoT) systems in different areas, such as manufacturing,
transportation, and healthcare, are the convergence of several technologies. There are …

Attribute-based encryption (ABE) is a public-key-based one-to-many encryption that allows
users to encrypt and decrypt data based on user attributes. A promising application of ABE is …

The CRC Handbook of Finite Fields (hereafter referred to as the Handbook) is a reference
book for the theory and applications of finite fields. It is not intended to be an introductory …

In encrypted email system, how to search over encrypted cloud emails without decryption is
an important and practical problem. Public key encryption with keyword search (PEKS) is an …

Abstract Structure-preserving signatures (SPS) are a powerful building block for
cryptographic protocols. We introduce SPS on equivalence classes (SPS-EQ), which allow …

In the past two years there have been several advances in Number Field Sieve (NFS)
algorithms for computing discrete logarithms in finite fields\mathbb F _ p^ n where p is prime …

Let us assume that Alice has received a constant-size signature on a set of messages {m_i\}
_ i= 1^ n from some organization. Depending on the situation, Alice might need to disclose …

In this paper, we present the concept of certificateless public key encryption with equality test
(CL-PKEET), which integrates certificateless public key cryptography (CL-PKC) into public …

Round-optimal blind signatures are notoriously hard to construct in the standard model,
especially in the malicious-signer model, where blindness must hold under adversarially …