When data is outsourced to a remote storage server, searchable encryption plays an important role to protect data privacy while allowing users to retrieve data in the massive ciphertext. As far as we know, most of the existing searchable encryption schemes work based on the bilinear map. These schemes may not be secure in the quantum age. Both discrete logarithms and factorization can be solved...

Public key encryption with keyword search (PEKS) enables user Alice to send a secret key TW to a server that will enable the server to locate all encrypted messages containing the keyword W , but learn nothing else. In this paper, we propose a new PKES scheme based on pairings. There is no pairing operation involved in the encryption procedure. Then, we provide further discussion on removing se...

This paper studies the search for the impossible differentials of E2. We apply the Shrinking technique, the miss-in-the-middle technique, and a new search algorithm to E2. As a result, no impossible differential is found for E2 with more than 5 rounds. We conclude that E2 is secure against cryptanalysis using impossible differentials derived by the currently known techniques.

This paper describes the di erent approaches of plagiarism search, the methods used by the KOPI Online Plagiarism Search and Information Portal and, shows a distributed approach for building a plagiarism search system. This architecture adds scalability to the system, by allowing placing an arbitrary number of identical components into it. To reduce network tra c and enable secure transfer of t...

Homomorphic encryption is an encryption method that enables computing over encrypted data. This has a wide range of real world ramifications such as being able to blindly compute a search result sent to a remote server without revealing its content. This paper discusses how database search queries can be made secure using a homomorphic encryption scheme. We propose a new database search techniq...

Everyone has secrets and some have more than others. Each and every one wanted to have their data and information to be more secure and confidential. There are many ways to maintain the data and information to be safe. The main objective of this paper is to be maintained the file or data to be secure. So, proposed system has developed for searching keyword in encrypted format and search with en...

Oblivious RAM (ORAM) allows a client to access her data on a remote server while hiding the access pattern (which locations she is accessing) from the server. Beyond its immediate utility in allowing private computation over a client’s outsourced data, ORAM also allows mutually distrustful parties to run secure-computations over their joint data with sublinear on-line complexity. In this work w...