International Journal of Electrical, Electronics and Computer Systems (IJEECS)
________________________________________________________________________________________________
Multi-Keyword Search on Encrypted Files and Ranking Based on Time
1P.Keerthiga, 2P.Geetha
1,2Dhanalakshmi Srinivasan College of Engineering and Technology, Mamallapuram, Chennai, Tamil nadu, India.
Email: 1[email protected], 2[email protected]
Abstract— In this paper, the data owners is using the cloud computing to put their files in the on commercial cloud from the local sites. The data search here is based on the plain text keyword which is inefficient in the data utilization. Thus, an encrypted cloud data search service is important when the large numbers of data users and file in the cloud where it is necessary to allow multiple key words in the search request and return file according to the relevant keyword. In proposed system time based ranking system is introduced generally ranking is done based on visit count which doesn’t provide efficient ranking. So to overcome the ranking efficiency problem time based ranking system is introduced where time count of each visit is measured and updated so that ranking will be done on the basis of time count. In additional multi-owner data sharing system is also introduced to overcome problem uploading the same file more than one time. In multi- owner data sharing once file is uploaded in database for sending to user owner can just share the new key. If user deletes the file key gets deleted not original because it may be shared to another users. The ranking process is totally based on the amount of time in which the web page used by the users. Then the owner can send the same files to multiple users simultaneously. The owner will send single secret key for single file and then automatically it generates multiple secret keys for each user receiving the file.
Index terms—cloud computing, rank method, encryption search on data, triple-DES
I. INTRODUCTION
Cloud computing systems all generally are designed for scalability to support large numbers of customers and surges in demand service. Cloud computing is an demand service in which shared resources, information, software and other devices are provided according to the clients requirement at a specific time. Cloud data under the mentioned model, system design should simultaneously achieve security and performance guarantees as follows. Multi keyword ranked search use design search schemes which allow multi-keyword query and provide result similarity ranking for effective data retrieval, instead of returning undifferentiated results. Privacy-preserving are prevent the cloud server from learning additional information from the data set and the index, and to meet privacy requirements.
Efficiency is functionality and privacy should be
achieved with low communication and computation overhead [1].
The data owner sends the secret key that the secret-key storage outsourcing allows data user with either limited resources or limited expertise to store and distribute large amounts of symmetrically encrypted data at low cost. Since regular secret-key encryption prevents one from searching over encrypted data.
Ranked search system enables data users to find the most relevant information quickly, rather than burdensomely sorting through every match in the content collection. Ranked search can also elegantly eliminate unnecessary network traffic by sending back only the most relevant data.
II. RELATED WORK
The owner stores the documents in untrusted server.
That documents may be an, business documents, tax documents, medical reports and important files. When the user can needs such documents containing a certain keyword he provides the server with a small piece of information (called a capability) that enables the server to identify the desired (encrypted) documents [16]. In proposed system, the resulting design is able to facilitate efficient cloud server-side ranking without losing the multi-keyword privacy. Thorough analysis shows that our proposed solution enjoys ―as-strong-as-possible‖
security guarantee compared to other searchable encryption schemes, while correctly realizing the goal of ranked multi-keyword search [10]. The keyword derived from the owner stores the documents in those documents, owner select a relevant keyword. If users search the documents from the possible keywords, in the user webpage shows the ranking order documents but it can open only having the private key. In this paper we are using triple-DES algorithm for sufficient encryption and decryption processing methods.
There different types techniques used in the privacy preserving techniques [4]. In the existing system, Encryption focuses on single keyword search or Boolean keyword search, Single-keyword search without ranking [1]. The large number of data users and documents in the cloud, it is inefficient for the search service to allow
multi-keyword query and provide result similarity ranking to meet the effective data retrieval need. In the proposed system, multi-keyword search with ranking, timer for the webpage for calculating the user visit the web page. Multi-user can retrieve the data with authentications processes. In this project, secure the cloud storage server where user retrieving data [8]. It is mainly provides ranking technique and the efficient for the user in time consumption.
III. PROPOSED WORK
Now a days cloud computing place an important role for sharing of data through the network. For the sharing of data in network we are provide the security of that data.
Considering the large number of data users and documents in cloud, it is crucial for the search service to allow multi-keyword query and provide result similarity ranking to meet the effective data retrieval need [11].
In proposed system time based ranking system is introduced generally ranking is done based on visit count which doesn’t provide efficient ranking. So to overcome the ranking efficiency problem time based ranking system is introduced where time count of each visit is measured and updated so that ranking will be done on the basis of time count. In additional multi owner data sharing system is also introduced to overcome problem uploading the same file more than one time. In multi owner data sharing once file is uploaded in database for sending to user owner can just share the new key. If user deletes the file key gets deleted not original because it may be shared to another users.
Ranking the web page based on the timing. Ranking is based on Time count of visit, number of visit and the download count files on the amount of time in which the web page used by the users.. It shows accuracy ranking in search results. Ranking method can be implemented by using triple-DES algorithm. The owner can send the same files to multiple users simultaneously. The owner will send single secret key for single file and the system will generate multiple secret keys for each user receiving the file. It is efficient for time saving to the data owner. Multi owner data sharing with key management to reduce data loss and uploading the same files again and again is reduced.
1. Searching web page using multi-keyword.
2. Ranking the web page based on the timing method.
3. Owner can send same file to the different users with secret key.
Using PHP to provide a code-execution environment that guarantees safe execution of code, including code created by an unknown or semi-trusted third party.
Fig. 1 System Architecture
Then the multi- user can retrieve the file through the user login. The user gives query to the server through the sent key by the owner. Then the multi-user enters the encrypted key and the user can download or view the files through the ranking method.
IV. MODULES
In the owner upload a file into the application through owner login. The owner uploads a file with content, index and appropriate key to the server.
A. Index
The owners have to register the owner details and provide the login details. After the logging in, the owner can upload the file to the authorized users. The owner can attach the index, key and file. The owner can send the index that contains appropriate keyword from the file document. Attachment of index is used to search the files to be easier. The index module contains the multi- keywords that are related to the content of the file.
Whenever user searches the file it will look upon index files. Then produce the search result with corresponding files for the user.
Fig. 2 Index
The owner can also view the files with content, index and key uploaded to the user. This ensures the files to be protected from unauthorized user. The data owner can choose any keyword that document. They do not have size ranges for keywords. The data user can send the request to the owner for a needed document [9]. Then only the data owner sends the appropriate file to the user with a security. That security provides the secret key.
B. Key Generation
During a file upload by user provides a key from which automatically secret key is generated. The secret key was send by the data owner to data multi-user mobile. It contains the numbers that can be sending to the user’s mobile. If the user can view or download the file it can be done by the secret key [5]. Then the multi-user to download the file using his separate secret key is sent by the data owner to the mobile. User gains the decrypt key from mobile and then downloaded or view or delete the data. The key is encrypted and decrypted by using triple- DES algorithm.
Fig. 3 Key Generation
Fig. 4 Key
In this paper the encryption and decryption of data can be done by using Triple DES algorithm. The owner upload the file to the database through the key is encrypted using the triple-DES algorithm to securely
store the file. The unknown user cannot get the data because it asks the appropriate decrypt secret key to view or download the file.
C. Secure Storage
This ensures the files to be protected from unauthorized user. The authenticated user will retrieve shared key, encrypt data and stored into cloud. If any user wants that data he/she retrieve data from the decrypt it. Thus the privacy requirements of the documents in a cloud storage server [8].
Fig. 5 Secure Storage
Guarantee for the file stored in the cloud server the server to learn which documents match each individual keyword of the conjunctive search and the latter results in exponential storage if the user allows for searches on every set of keywords. A protocol for which the total communication cost of sending a capability to the server is constant in the number of documents. When the user needs all documents containing a certain keyword he provides the server with a small piece of information (called a capability) that enables the server to identify the desired (encrypted) documents. The data owner can send the files to the appropriate user with several privacy models.
D. Rank Search
In the rank search module, the user searches the file that is searched using multi-keyword search [1]. It shows the data by the ranking order that is already the file can be seen by the authenticated user so it can be ranked by time count of visit, number of visit and the download count files. The time count of visit describes the how many seconds the files can be viewed, number of visit describes the how many times the user can view the file and download count files describes the how many times the user can download the files.
In the proposed process, the ranking technique can be implemented. In this project the user can retrieve the begin
{
triple-DES = new triple-DES ();
publicKey = 65537;
privateKey = 1265385473;
modulus = 1891728589;
}
triple-DES->set triple-DES Keys(
$publicKey, $privateKey, $modulus );
{
key=POST["txt_key"];
m = triple-DES ->decrypt($key);
} end
relevant documents in the ranking method technique. It is efficient and reliable to the user for retrieve the needed documents. It is useful for several authenticated user and time management also efficient to the user. The ranking technique is mainly based on the user side process it shows recent documents to the user [3]. It shows the update documents to the user.
Fig. 6 Ranking
In this project, timing to the webpage for calculating the webpage how long by the user can view the files. It related to the ranking technique, updated documents can view in the top range, can be useful to the user. The user can search by the multi keyword; efficiently show the documents in the ranking order. It is sufficient for both data user and the data owner. Time consumption is more in this project. It is based in the multi-keyword search on ranking time.
For the privacy requirements, in this project secure storage in the cloud server. The ranking technique shows to the user needed. The user can search the files by multikeyword search then to shows the files in ranking order, describes recent viewed files. The ranking technique is useful for the data user, relevant or needed files can also rank [2]. Ranking method count of visit, number of visit and download the count files. Relevant documents shows to the user.
Ranking is done on the basis of time count of visit, number of visit and the download count files. How long the user can use the web page, it takes time count for ranking. The timer should calculate the How long the user can use the web page. It is useful for the user can get most relevant file. Time consumption for the user, using the multi-keyword search. To effectively support ranked search over encrypted file collection, we now resort to the newly developed cryptographic primitive–
order preserving symmetric encryption (OPSE) to achieve more practical performance [6].
Fig. 7 Ranking
In existing ranking still issues in producing efficiency ranking result with help of visit count based ranking. In the proposed process, the ranking technique can be implemented. In this project the user can retrieve the relevant documents in the ranking method technique [2].
It is efficient and reliable to the user for retrieve the needed documents. It is useful for several authenticated user and time management also efficient to the user. The ranking technique is mainly based on the user side process it shows recent documents to the user. It shows the update documents to the user.
V. CONCLUSION
In this project, for the first time define and solve the problem of multi-keyword ranked search over encrypted cloud data, and establish a variety of privacy requirements. Thorough analysis investigating privacy and efficiency guarantees of proposed schemes is given, and experiments on the real-world dataset show the proposed schemes introduce low overhead on both computation and communication. The proposed schemes are ranking technique and time saving for the data owner.
VI. FUTURE WORK
At this part, the owner is able to upload all the files and can maintain the security of the data. In the future, the owner will also be able to upload videos in its space.
This will also be encrypted using the triple-DES algorithm so that the authentication of the cloud user will be maintained and security of the files and videos will be done.
REFERENCES
[1] Ning Cao, Cong Wang, Ming Li, Kui Ren, Wenjing Lou ―Privacy-Preserving Multi- Keyword Ranked Search over Encrypted Cloud Data‖ IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 1, January 2014.
Number of visit Download count files
Time count of visit
//ranking begin {
vcount=res["file_visitcount"];
download count=vcount+1;
newcount=vcount+1;
}
update="update tbl_fileupload set {
file_visitcount=newcount where file_fileid=id";
} end
[2] A.Singhal, ―Modern Information Retrieval: A Brief Overview,‖ IEEE Data Eng. Bull., vol. 24, no. 4, pp. 35-43, Mar. 2001.
[3] C. Wang, N. Cao, K. Ren, and W. Lou,
―Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data,‖ IEEE Trans. Parallel and Distributed Systems, vol. 23, no. 8, pp. 1467- 1479, Aug. 2012.
[4] C. Wang, Q. Wang, K. Ren, and W. Lou,
―Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing,‖ Proc.
IEEE INFOCOM, 2010.
[5] D. Boneh, G.D. Crescenzo, R. Ostrovsky, and G.
Persiano, ―Public Key Encryption with Keyword Search,‖ Proc. Int’l Conf. Theory and Applications of Cryptographic Techniques (EUROCRYPT), 2004.
[6] D. Song, D. Wagner, and A. Perrig, ―Practical Techniques for Searches on Encrypted Data,‖Proc. IEEE Symp. Security and Privacy, 2000.
[7] J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, and W. Lou, ―Fuzzy Keyword Search Over Encrypted Data in Cloud Computing,‖ Proc.
IEEE INFOCOM, Mar. 2010.
[8] N. Cao, S. Yu, Z. Yang, W. Lou, and Y. Hou,
―LT Codes-Based Secure and Reliable Cloud Storage Service,‖ Proc. IEEE INFOCOM, pp.
693-701, 2012.
[9] P. Golle, J. Staddon, and B. Waters, ―Secure Conjunctive Keyword Search over Encrypted Data,‖ Proc. Applied Cryptography and Network Security, pp. 31-45, 2004.
[10] R. Curtmola, J.A. Garay, S. Kamara, and R.
Ostrovsky, ―Searchable Symmetric Encryption:
Improved Definitions and Efficient Constructions,‖ Proc. 13th ACM Conf. Computer and Comm. Security (CCS ’06), 2006.
[11] S. Yu, C. Wang, K. Ren, and W. Lou,
―Achieving Secure, Scalable, and Fine-Grained Data Access Control in Cloud Computing,‖ Proc.
IEEE INFOCOM, 2010.
