Results 1 -
4 of
4
A Note on Two Schemes for Secure Outsourcing of Linear Programming
"... Abstract Recently, Wang et al. [IEEE INFOCOM 2011, 820-828], and Nie et al. [IEEE AINA 2014, 591-596] have proposed two schemes for secure outsourcing of linear programming (LP). They did not consider the standard form: minimize c T x, subject to Ax = b, x ≥ 0. Instead, they studied a peculiar for ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract Recently, Wang et al. [IEEE INFOCOM 2011, 820-828], and Nie et al. [IEEE AINA 2014, 591-596] have proposed two schemes for secure outsourcing of linear programming (LP). They did not consider the standard form: minimize c T x, subject to Ax = b, x ≥ 0. Instead, they studied a peculiar form: minimize c T x, subject to Ax = b, Bx ≥ 0, where B is a non-singular matrix. In this note, we stress that the proposed peculiar form is unsolvable and meaningless. The two schemes have confused the functional inequality constraints Bx ≥ 0 with the nonnegativity constraints x ≥ 0 in the linear programming model. But the condition x ≥ 0 is indispensable to LP. Thus, both two schemes failed.
Access Control Based Resource Allocation in Cloud Computing Environment
"... Abstract In this paper, we propose a new dynamic resource allocation scheme -Access Control-based Resource Allocation (ACRA) for cloud users in order to address some deficiencies of the current resources allocation mechanisms in some free cloud computing environment. The proposed scheme comprehensi ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract In this paper, we propose a new dynamic resource allocation scheme -Access Control-based Resource Allocation (ACRA) for cloud users in order to address some deficiencies of the current resources allocation mechanisms in some free cloud computing environment. The proposed scheme comprehensively analyses behavior characteristics of cloud users and evaluates user behavior trust using fuzzy analytic hierarchy process (FAHP), and then dynamically adjusts the resources permission of cloud users according to their behavior trust values, thus effectively controlling user resource utilization. Experimental results show that the ACRA scheme can provide basis for allocating resources dynamically and reasonably to cloud users with different behaviors and improve resource utilization in cloud computing systems.
A New Security Cloud Storage Data Encryption Scheme Based on Identity Proxy Re-encryption
"... Abstract In the process of cloud data storage, data owner will encrypt data and upload it to the cloud, however, this method cannot support for encrypted data sharing. Especially, when data is shared with many users, the scalability is very weak. In order to solve this problem, we put forward a new ..."
Abstract
- Add to MetaCart
Abstract In the process of cloud data storage, data owner will encrypt data and upload it to the cloud, however, this method cannot support for encrypted data sharing. Especially, when data is shared with many users, the scalability is very weak. In order to solve this problem, we put forward a new security cloud storage data encryption scheme based on identity proxy re-encryption in this article. This scheme can flexibility share data with other users security without fully trusted cloud. For the detailed structure, we use a strong unforgeable signature scheme to make the transmuted ciphertext have publicly verification combined identity-based encryption. Furthermore, the transformed ciphertext has chosen-ciphertext security under the standard model. Because this new scheme can support fine-grained access control without using public key certificate and has better extensibility, so this scheme can be better applied into security cloud data sharing.
On Two Kinds of Flaws in Some Server-aided Verification Schemes
"... Abstract At Asiacrypt'05, Girault and Lefranc introduced the primitive of server-aided verification (SAV). In the proposed model, the server is assumed to be untrusted but is supposed to not collude with the legitimate prover. At ProvSec'08, Wu et al. have generalized the GiraultLefranc S ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract At Asiacrypt'05, Girault and Lefranc introduced the primitive of server-aided verification (SAV). In the proposed model, the server is assumed to be untrusted but is supposed to not collude with the legitimate prover. At ProvSec'08, Wu et al. have generalized the GiraultLefranc SAV model by allowing the server to collude with the legitimate prover, and presented two corresponding SAV signature schemes, SAV-BLS-1 and SAV-BLS-2. In this paper, we argue that the SAV-BLS-1 scheme is somewhat artificial because the computational gain in the scheme is at the expense of additional communication costs. This is a common flaw in most outsourcing computation proposals which have neglected the comparisons between the computational gain and the incurred communication costs. We show also that the SAV-BLS-2 scheme is insecure against collusion attacks. It is another common flaw to have the verifier delegate most computations to the server in a way that prevent the verifier to confirm that the returned values are really bound to the signer's public key.