The offline keyword guessing attack (KG attack) is a new security threat to the searchable public key encryption with designated verifier. Many techniques have been proposed to resist such an attack. However, all these techniques are only secure against the outside KG attackers (neither the server nor the receiver), and have not solved the problem that the KG attacker is the server. In this pap...

As the product of third information technology revolution, Internet Things (IoT) has greatly altered our way lifetime. Cloud storage gradually become best choice for data processing due to its scalability and flexibility. However, cloud is not a completely trusted entity, such as tampering with user or leaking personal privacy. Therefore, usually adopts attribute-based encryption schemes accomp...

Searchable encryption schemes provide an important mechanism to cryptographically protect data while keeping it available to be searched and accessed. In a common approach for their construction, the encrypting entity chooses one or several keywords that describe the content of each encrypted record of data. To perform a search, a user obtains a trapdoor for a keyword of her interest and uses t...

Data confidentiality in the Cloud Computing is a very challenging task. Encryption is one of the most secure methods ensuring this task, and searchable encryption techniques are used to search on encrypted data without the need for decryption. But, despite this secure measure some leaks may appear when searching over data. In this article, we propose to improve confidentiality of outsourced dat...

Nowadays an increasing amount of data stored in the public cloud need to be searched remotely for fast accessing. For the sake of privacy, the remote files are usually encrypted, which makes them difficult to be searched by remote servers. It is also harder to efficiently share encrypted data in the cloud than those in plaintext. In this paper, we develop a searchable encryption framework calle...

In the model of no-dictionary verifiable searchable symmetric encryption (SSE) scheme, a client does not need to keep the set of keywords W in the search phase, where W is called a dictionary. Still a malicious server cannot cheat the client by saying that “your search word w does not exist in the dictionary W” when it exists. In the previous such schemes, it takes O(logm) time for the server t...