scholarly journals Multi-Keyword Ranked Search in Cloud Storage using Homomorphic Indexing

2018 ◽  
Vol 7 (2.24) ◽  
pp. 243
Author(s):  
K Renugha ◽  
P Shanthi ◽  
A Umamakeswari
Keyword(s):  
Search Algorithm ◽  
Homomorphic Encryption ◽  
Cloud Service ◽  
Security And Privacy ◽  
Cloud Service Provider ◽  
Secure Information ◽  
Data Owner ◽  
Ranked Search ◽  
The Given ◽  
Is Outsourcing

In the cloud environment, the main issue is outsourcing of the information to the cloud service provider and outsider. Consider this, the cloud tenant store data in an encrypted form to achieve data security and privacy. The data owner needs the secure information sharing from the cloud and without leak of access pattern to the eavesdroppers. XOR homomorphic encryption searchable algorithm along with ranking is proposed to provide the security over the network. In addition our scheme provides secure Multi-keyword ranked search over encrypted data. Efficient ranked search algorithm returns the relevant document based on the results for the given multiple keywords. The experimental results prove that the system is efficient. 

scholarly journals Privacy Preserving Outsourced Calculations With Symmetric Fully Homomorphic Encryption

2019 ◽  
Vol 8 (10) ◽  
pp. 3012-3015
Keyword(s):  
Service Providers ◽  
Homomorphic Encryption ◽  
Cloud Service ◽  
New Paradigm ◽  
Fully Homomorphic Encryption ◽  
Privacy And Security ◽  
Cloud Service Provider ◽  
Privacy Concerns ◽  
Private Data ◽  
Cloud Storage Service

Cloud computing is a new paradigm which provides cloud storage service to manage, maintain and back up private data remotely. For privacy concerns the data is kept encrypted and made available to users on demand through cloud service provider over the internet. The legacy encryption techniques rely on sharing of keys, so service providers and end users of the cloud have exclusive rights on the data thus the secrecy may loss. Homomorphic Encryption is a significant encryption technique which allows users to perform limited arithmetic on the enciphered data without loss of privacy and security. This paper addresses a new simple and non-bootstrappable Fully Homomorphic Encryption Scheme based on matrices as symmetric keys with access control.

scholarly journals User Prediction in a Role for Secure Data Sharing Through Cloud

2019 ◽  
Vol 8 (10) ◽  
pp. 162-166
Keyword(s):  
Data Sharing ◽  
Cloud Service ◽  
Searchable Encryption ◽  
Security Issue ◽  
Cloud Service Provider ◽  
Insider Attack ◽  
Data Owner ◽  
User Request ◽  
Secure Data ◽  
Role Based

Nowadays cloud is being used by both individuals and organizations to store and share the data without establishing their own data center. The outsourcings of these data are becoming a major security issue for businesses. Searchable encryption is one of the prominent techniques which allow the data owner to securely store the data and then share the data for their growth in business. With this technique, Cloud Service Provider can process the user request by searching on encrypted stored data without decrypting the data. In this paper we analyze different searchable encryption techniques for secure data sharing and their preventive attacks. We also proposed a method named “User Prediction in Role” to reduce the insider attack possibility in Role Based Data Sharing (RBDS), which is based on user p

scholarly journals Two-Party Privacy-Preserving Set Intersection with FHE

Entropy ◽  
2020 ◽  
Vol 22 (12) ◽  
pp. 1339
Author(s):  
Yunlu Cai ◽  
Chunming Tang ◽  
Qiuxia Xu
Keyword(s):  
Private Information ◽  
Homomorphic Encryption ◽  
Bloom Filter ◽  
Cloud Service ◽  
Fully Homomorphic Encryption ◽  
Cloud Service Provider ◽  
Set Size ◽  
Set Intersection ◽  
Learning With Errors ◽  
Private Set Intersection

A two-party private set intersection allows two parties, the client and the server, to compute an intersection over their private sets, without revealing any information beyond the intersecting elements. We present a novel private set intersection protocol based on Shuhong Gao’s fully homomorphic encryption scheme and prove the security of the protocol in the semi-honest model. We also present a variant of the protocol which is a completely novel construction for computing the intersection based on Bloom filter and fully homomorphic encryption, and the protocol’s complexity is independent of the set size of the client. The security of the protocols relies on the learning with errors and ring learning with error problems. Furthermore, in the cloud with malicious adversaries, the computation of the private set intersection can be outsourced to the cloud service provider without revealing any private information.

scholarly journals Achieving Lightweight Verifiable Privacy Preserving Search Over Encrypted Data

2019 ◽  
Vol 3 (3) ◽  
Author(s):  
Selasi Kwame Ocansey ◽  
Charles Fynn Oduro
Keyword(s):  
Service Provider ◽  
Homomorphic Encryption ◽  
Bloom Filter ◽  
Cloud Service ◽  
Privacy Preserving ◽  
Data Sets ◽  
Cloud Service Provider ◽  
Encrypted Data ◽  
Security Proofs

When cloud clients outsource their database to the cloud, they entrust management operations to a cloud service provider who is expected to answer the client’s queries on the cloud where database is located. Efficient techniques can ensure critical requirements for outsourced data’s integrity and authenticity. A lightweight privacy preserving verifiable scheme for outsourcingdatabase securely is proposed, our scheme encrypts data before outsourcing and returned query results are verified with parameters of correctness and completeness. Our scheme is projected on lightweight homomorphic encryption technique and bloom filter which are efficiently authenticated to guarantee the outsourced database’s integrity, authenticity, and confidentiality. An ordering challenge technique is proposed for verifying top-k query results. We conclude by detailing our analysis of security proofs, privacy, verifiability and the performance efficiency of our scheme. Our proposed scheme’s proof and evaluation analysis show its security and efficiency for practical deployment. We also evaluate our scheme’s performances over two UCI data sets.

scholarly journals A Decentralized Accountability Framework For Enhancing Secure Data Sharing Through Icm In Cloud

2019 ◽  
Vol 8 (11) ◽  
pp. 3446-3452
Keyword(s):  
Data Sharing ◽  
Cloud Service ◽  
The Internet ◽  
Public Cloud ◽  
Private Cloud ◽  
Cloud Service Provider ◽  
Actual Usage ◽  
Outsourced Data ◽  
Integrity Checking ◽  
Data Owner

The Cloud substitutes a computing criterion where shared configurable resources are afforded as an on-demand service over the Internet. Moreover, the cloud environment provides resources to the users on the basis of services like SaaS, PaaS and IaaS. Generally, a cloud can be referred as private cloud or public cloud. When a Cloud Service Provider (CSP) imposes upon public cloud resources to compile their private cloud, the result is demonstrated as a virtual private cloud. Private or public, the imperious intent of cloud computing is to provide simplistic, reliable usage of various computing resources. One of the significant features of cloud is that the outsourced data are accessed through any anonymous machines over the Internet. On the other hand, it creates an issue that user’s fear of unknown access of data, which can become a major difficulty to the wide implementation of cloud. In this paper, a decentralized accountability framework is developed to monitor the actual usage and access of the data that is shared on cloud. For that, a logging mechanism that includes authentication for each user to access the data has also been provided. Moreover, some procedures for providing the data under the control of data owner includes Integrity Checking Mechanism (ICM) have also been developed. The overall process strengthens the security constraints over cloud. And the experimental results reveal that the approach affords secure and scalable data sharing with reduced memory utilization and processing time

Identification of Various Privacy and Trust Issues in Cloud Computing Environment

2019 ◽  
pp. 992-1013
Author(s):  
Shivani Jaswal ◽  
Manisha Malhotra
Keyword(s):  
Cloud Computing ◽  
Service Provider ◽  
Cloud Service ◽  
Security And Privacy ◽  
Computing Environment ◽  
Cloud Service Provider ◽  
Cloud Computing Environment ◽  
Security Issues

Cloud computing is a rising paradigm in today's world. In this, users can send his or her request to any CSP, i.e., cloud service provider, of their choice. In return, the CSP reverts him back with that particular service. Now, while communicating from various two locations, the data transferred is not passed through that much amount of security and privacy as expected. So, there are lots of parameters in the environment that are taken care of while sending, receiving or just passing data over the network. This chapter presents various security issues that are underlying in cloud computing. This chapter has illustrated various issues such as Trust, Encryption, Authenticity, Confidentiality and Multi Tenancy. Also, some of the proposed solutions have also been discussed later in the chapter.

Identification of Various Privacy and Trust Issues in Cloud Computing Environment

2018 ◽  
pp. 95-121
Author(s):  
Shivani Jaswal ◽  
Manisha Malhotra
Keyword(s):  
Cloud Computing ◽  
Service Provider ◽  
Cloud Service ◽  
Security And Privacy ◽  
Computing Environment ◽  
Cloud Service Provider ◽  
Cloud Computing Environment ◽  
Security Issues

Cloud computing is a rising paradigm in today's world. In this, users can send his or her request to any CSP, i.e., cloud service provider, of their choice. In return, the CSP reverts him back with that particular service. Now, while communicating from various two locations, the data transferred is not passed through that much amount of security and privacy as expected. So, there are lots of parameters in the environment that are taken care of while sending, receiving or just passing data over the network. This chapter presents various security issues that are underlying in cloud computing. This chapter has illustrated various issues such as Trust, Encryption, Authenticity, Confidentiality and Multi Tenancy. Also, some of the proposed solutions have also been discussed later in the chapter.

scholarly journals RHEA: resource hypervisor and efficient allocator in cloud

2018 ◽  
Vol 7 (1.7) ◽  
pp. 21
Author(s):  
G Soniya Priyatharsini ◽  
N Malarvizhi
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Resource Utilization ◽  
Virtual Machines ◽  
Cloud Service ◽  
Modern World ◽  
Cloud Service Provider ◽  
Long Duration ◽  
Data Owner ◽  
Enormous Number

In this modern world, people are not ready to waste their time in waiting for long duration. That’s why cloud computing is such an enormous number of fans that it can be rented and also pay per use. The cloud service provider is concern about the data owner’s satisfaction in cloud usage. The main area they concentrate will be the security of the owner’s data and the resource allocation as per the request. This paper explains how the resources are efficiently allocated and scheduled to the clients. It follows four steps; firstly it identifies the active PMs. Next it defragments the identified machines. Then it balances the load along with the threshold feature to enhance the usage of the resource utilization. Finally it allocates the efficient Virtual Machines (VM) to the data owner as per the request. This is done using cloudsim along with java.

scholarly journals Outsourcing Hierarchical Threshold Secret Sharing Scheme Based on Reputation

2019 ◽  
Vol 2019 ◽  
pp. 1-8
Author(s):  
En Zhang ◽  
Jun-Zhe Zhu ◽  
Gong-Li Li ◽  
Jian Chang ◽  
Yu Li
Keyword(s):  
Secret Sharing ◽  
Homomorphic Encryption ◽  
Cloud Service ◽  
Third Party ◽  
Secret Sharing Schemes ◽  
Basic Tool ◽  
Cloud Service Provider ◽  
Threshold Secret Sharing ◽  
Sharing Scheme ◽  
Different Levels

Secret sharing is a basic tool in modern communication, which protects privacy and provides information security. Among the secret sharing schemes, fairness is a vital and desirable property. To achieve fairness, the existing secret sharing schemes either require a trusted third party or the execution of a multiround protocol, which are impractical. Moreover, the classic scheme requires expensive computing in the secret verification phase. In this work, we provide an outsourcing hierarchical threshold secret sharing (HTSS) protocol based on reputation. In the scheme, participants from different levels can fairly reconstruct the secret, and the protocol only needs to run for one round. A cloud service provider (CSP) uses powerful computing resources to help participants complete homomorphic encryption and complex verification operations, and the CSP cannot be aware of any valuable information. The participants can obtain the secret with a small number of operations. To avoid collusion, we suppose that participants have their own reputation value, and they are punished or rewarded according to their behavior. The reputation value of a participant who deviates from the protocol will decrease; therefore, the participant will choose a cooperative strategy to obtain better payoffs. Lastly, our scheme is proved to be secure, and experiments indicate that our scheme is feasible and efficient.

scholarly journals Enhanced Security for Dynamic Multi Keyword Ranked Search Using Greedy Best First Search

2019 ◽  
pp. 74-78
Author(s):  
Bibin Baby ◽  
Sharmila Banu
Keyword(s):  
Keyword Search ◽  
Search Algorithm ◽  
Security And Privacy ◽  
Index Structure ◽  
Sensitive Data ◽  
Cloud Data ◽  
Encryption Schemes ◽  
Query Generation ◽  
Ranked Search ◽  
Best First Search

Today, due to the enormous growth of data technology in cloud computing, the data owners are stimulated to outsource their data in data management to reduce cost and for the convenient. Data confidentiality, in general, can be obtained by encrypting the data before it is outsourced. The client stores the encrypted data to the cloud using Searchable encryption schemes and applies keyword search techniques over cipher text domain. But the main problem in outsourcing is the lack of security and privacy for the sensitive data. So, to overcome this, for privacy requirement, the sensitive data can be encrypted before it is outsourced. Various methods were proposed to preserve the privacy and to provide security to the cloud data which are encrypted. Here in this paper, we proposed a tree-based search method over the encrypted datain the cloud that supports dynamic operation and multi-keyword ranked search. Clearly, the commonly used “inverse document frequency (IDF) term frequency (TF)” model and the vector space method are joined in the query generation and index creation to give multi-keyword ranked search. To get high search efficiency, a tree-type index structure, “Greedy Best-first Search” algorithm is proposed based on the tree- index.

Sign in / Sign up

Export Citation Format

Share Document