Efficient Database Outsource to Twin Cloud With Security and Privacy

Database is held and treated in cloud server, which is outside the control of data owners. For the numerical range query those arrangements cannot deliver adequate confidentiality defense in contradiction of practical challenges, e.g., confidentiality leakage of statistical properties, access design. Also, augmented number of queries will unavoidably leak more info to the cloud server. In this paper, we propose two-cloud building for secure database, with a series of connection protocols that deliver privacy preservation to numerous numeric-related range queries. Safety analysis demonstrates that confidentiality of arithmetical information is muscularly protected against cloud providers in our planned scheme

STC database for SQL Range Queries digital apps with Privacy Preserving

Businesses and people outsource database to realize helpful and low-cost applications and administrations. In arrange to supply adequate usefulness for SQL inquiries, numerous secure database plans have been proposed. In any case, such plans are helpless to protection leakage to cloud server. The most reason is that database is facilitated and handled in cloud server, which is past the control of information proprietors. For the numerical extend inquiry (“\u3e”, “\u3c”, etc.), those plans cannot give adequate protection security against viable challenges, e.g., security spillage of measurable properties, get to design. Besides, expanded number of questions will definitely spill more data to the cloud server. In this paper, we propose a two-cloud engineering for secure database, with a arrangement of crossing point conventions that give security conservation to different numeric-related extend questions. Security analysis shows that privacy of numerical information is strongly protected against cloud providers in our proposed scheme

Reusable garbled gates for new fully homomorphic encryption service

In this paper, we propose a novel way to provide a fully homomorphic encryption service, namely by using garbled circuits. From a high level perspective, garbled circuits and fully homomorphic encryption, both aim at implementing complex computation on ciphertexts. We define a new cryptographic primitive named reusable garbled gate, which comes from the area of garbled circuits, then based on this new primitive we show that it is very easy to construct a fully homomorphic encryption. However, the instantiation of reusable garbled gates is rather difficult, in fact, we can only instantiate this new primitive based on indistinguishable obfuscation. Furthermore, reusable garbled gates can be a core component for constructing the reusable garbled circuits, which can reduce the communication complexity of them from O(n) to O(1). We believe that reusable garbled gates promise a new way to provide fully homomorphic encryption and reusable garbled circuits service fast.Peer ReviewedPostprint (author's final draft

A Reliability-Aware Approach for Resource Efficient Virtual Network Function Deployment

OAPA Network function virtualization (NFV) is a promising technique aimed at reducing capital expenditures (CAPEX) and operating expenditures (OPEX), and improving the flexibility and scalability of an entire network. In contrast to traditional dispatching, NFV can separate network functions from proprietary infrastructure and gather these functions into a resource pool that can efficiently modify and adjust service function chains (SFCs). However, this emerging technique has some challenges. A major problem is reliability, which involves ensuring the availability of deployed SFCs, namely, the probability of successfully chaining a series of virtual network functions (VNFs) while considering both the feasibility and the specific requirements of clients, because the substrate network remains vulnerable to earthquakes, floods and other natural disasters. Based on the premise of users & #x2019; demands for SFC requirements, we present an Ensure Reliability Cost Saving (ER & #x005F;CS) algorithm to reduce the CAPEX and OPEX of telecommunication service providers (TSPs) by reducing the reliability of the SFC deployments. The results of extensive experiments indicate that the proposed algorithms perform efficiently in terms of the blocking ratio, resource consumption, time consumption and the first block

Verifiable Outsourced Database Model: A Game-Theoretic Approach

In the verifiable database (VDB) model, a computationally weak client (database owner) delegates his database management to a database service provider on the cloud, which is considered untrusted third party, while users can query the data and verify the integrity of query results. Since the process can be computationally costly and has a limited support for sophisticated query types such as aggregated queries, we propose in this research a framework that helps bridge the gap between security and practicality. The proposed framework remodels the verifiable database problem using Stackelberg security game. In the new model, the database owner creates and uploads to the database service provider the database and its authentication structure (AS). Next, the game is played between the defender (verifier), who is a trusted party to the database owner and runs scheduled randomized verifications using Stackelberg mixed strategy, and the database service provider. The idea is to randomize the verification schedule in an optimized way that grants the optimal payoff for the verifier while making it extremely hard for the database service provider or any attacker to figure out which part of the database is being verified next. We have implemented and compared the proposed model performance with a uniform randomization model. Simulation results show that the proposed model outperforms the uniform randomization model. Furthermore, we have evaluated the efficiency of the proposed model against different cost metrics