The document discusses security issues with cloud computing including trust, confidentiality, privacy, and integrity. Trust issues arise because users must rely on cloud providers to securely handle outsourced data. Confidentiality can be breached through data persistence and remanence allowing unauthorized access. Privacy is a challenge due to varying laws across countries and the diffuse nature of cloud environments. Integrity ensures only authorized people and processes can manipulate data and software. The document proposes using encryption schemes like fully homomorphic encryption to allow computing on encrypted data without decrypting to address these security issues.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
53 views2 pages
Proposed Approach: Loud Computing Security Issues
The document discusses security issues with cloud computing including trust, confidentiality, privacy, and integrity. Trust issues arise because users must rely on cloud providers to securely handle outsourced data. Confidentiality can be breached through data persistence and remanence allowing unauthorized access. Privacy is a challenge due to varying laws across countries and the diffuse nature of cloud environments. Integrity ensures only authorized people and processes can manipulate data and software. The document proposes using encryption schemes like fully homomorphic encryption to allow computing on encrypted data without decrypting to address these security issues.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2
PROPOSED APPROACH
II. CLOUD COMPUTING SECURITY ISSUES
1) Trust: when two parties are involved in a transaction then the trust can be described as follows: An entity A is said to trust another entity B when entity A believes that the entity B will behave exactly as expected and required [3]. The cloud service provider is required to provide sufficient security policy that guarantees the use of efficient activities are being deployed to mitigate the risk to the data when a user outsources the data to the cloud. This poses another risk as the security is here based on trusting the processes and the computing base implemented by the cloud owner. 2) Confidentiality: Data confidentiality in the cloud means isolating the data of individual users from one another. Data confidentiality can be breached, due to data persistence. Data remanence is the residual data that has been partially erased or removed. Due to virtual separation of logical drives and lack actual physical hardware separation between multiple users on a single infrastructure, data remanence may lead to the undesirable leakage of private data. Also a malicious user, may claim a large amount of disk space and then scavenge for sensitive data, which can lead to unprecedented loss of data Software confidentiality is also important aspect to meet overall system security. It refers to trusting that specific applications or processes will maintain and handle the users data in a secure manner[3]. 3) Privacy: privacy refers to the willingness of a user to control the disclosure of private information. The cloud presents a number of legal challenges towards the privacy breach due to fuzzy perimeter of the cloud environment and laws controlling the privacy in various countries differ. 4) Integrity: Integrity is associated with data, software and hardware and it maintains that these can only be manipulated by authorised persons and by authorised processes. Cloud service provider should also provide security against insider attacks on data. Cloud computing security issues can be resolved to a great extent if we can make sure that the data once outsourced to the cloud is never interpreted by any other user as well as the cloud service provider itself at any stage even during processing on the data in the cloud. To achieve this we require encryption schemes which can provide
secure encryption of data along with the ability to compute
the data without decrypting it at any stage. For computing blindfolded fully homomorphic encryption schemes are needed which are practical to implement with satisfactory efficiency. PROBLEM SOLUTION Attackers attack on data that is placed on same server. So that solution is do multiple copies of same data and data is placed on multiple servers. But data is encrypted by encrypted key. Attackers may be attack on key so that data is revealed to the attackers. The solution of this problem is instead of putting multiple copies of data on different server we are applying Shamirs secret sharing on key. The encrypted key is divided into number of parts and stored them on different server. But again if attackers attacks on one of the server that part of the key is lost but still we can reconstruct the key using Shamirs threshold scheme which uses threshold value it is applied on the key. The most famous perfect secret sharing scheme is the (k, n)-threshold scheme first proposed by Shamir in 1979 and hereafter referred to as a Shamir threshold scheme A key can be reconstructed again with minimum number of secret that are on different server there is no problem if attackers attack on one server The reaming server can reconstruct key. This Shamirs scheme overcome problem of key exchange .Shamirs scheme uses lag ranges of polynomial to divide the key in number of pieces Secret sharing refers to method for distributing a secret amongst a group of participants, each of whom is allocated a share of the secret. The secret can be reconstructed only when a sufficient number of shares are combined together; individual shares are of no use on their own. More formally, in a secret sharing scheme there are one dealer and n players. The dealer gives a secret to the players, but only when specific conditions are fulfilled. The dealer accomplishes this by giving each player a share in such a way that any group of t (for threshold) or more players can together reconstruct the secret but no group of fewer than t players can. Such a system is called a (k, n)-threshold scheme