International Journal of Science Engineering and Advance Technology (IJSEAT)
Not a member yet
1075 research outputs found
Sort by
Efficient cloud storage security scheme and data sharing in cloud
Get PDFWe propose the Secure Data Sharing in Clouds (SeDaSC) approach that gives: 1) information privacy and integrity; 2) get to control; 3) information sharing (sending) without utilizing register concentrated reencryption; 4) insider threat security; and 5) forward and in reverse access control. The SeDaSC strategy encodes a file with a solitary encryption key. Two distinctive key offers for every one of the clients are created, with the client just getting one offer. The ownership of a solitary offer of a key enables the SeDaSC system to counter the insider dangers. The other key offer is put away by a confided in outsider, which is known as the cryptographic server. The SeDaSC strategy is appropriate to traditional and portable cloud computing situations
A new architecture and energy efficient keyword search in cloud
Get PDFNormally with limited bandwidth capacity and limited battery life, these issues acquaint substantial overhead with registering and correspondence just as a higher power utilization for cell phone clients, which makes the encrypted search over mobile cloud very testing. In this paper, we propose TEES (Traffic and Energy saving Encrypted Search), a data transfer capacity and vitality effective encoded search design over mobile cloud. The proposed design offloads the calculation from cell phones to the cloud, and we further improve the correspondence between the versatile customers and the cloud. It is exhibited that the data security does not corrupt when the execution upgrade strategies are connected
The Secured Data Sharing For Multiauthority Access in Cloud Storage
Get PDFCloud record sharing indicates to a scope of cloud services that enables individuals to store and synchronize archives, photographs, recordings and different files in the cloud—and offer them with other individuals. These services additionally enable clients to share and synchronize data among different gadgets for a solitary proprietor. These services are open through work areas, scratch pad, advanced mobile phones and media tablets, and give a basic system to synchronizing data over numerous gadgets. In cloud computing, to shield data from spilling, clients need to scramble their data before being shared. In this paper we propose a proficient encryption plan based on layered model of the entrance structure is proposed in cloud computing, which is named document progression CP-ABE plan. FH-CP-ABE broadens normal CP-ABE with a various leveled structure of access approach, in order to accomplish basic, adaptable and fine-grained access control
A new dynamic access control technique to maintain PHRS in cloud
Get PDFWe propose another access control conspire for PHRs which can be given by different patients. The plan comprises of ABE layer and symmetric key layer. In ABE layer, the plan bolsters a multi-benefit get to control for PHRs from multi-patients. The plan joins the encryption of information from various patients where the information are under a similar access approach to take care of the issue of tedious procedure in encryptions of these information, with the goal that the expense of encryption and unscrambling can be diminished. The plan accomplishes a productive, adaptable, and fine-grained get to control on PHRs. In symmetric key layer, symmetric keys coordinate restorative specialists' entrance benefits and the keys with higher benefit can infer keys with lower benefit, not the a different way. The patients scramble each class of information with relating symmetric keys in symmetric key layer, and encode the symmetric keys in the ABE layer. We demonstrate our plan is secure dependent on security of CP-ABE
Mining Association Rule Summarization Techniques to prognosis Diabetic unknown patterns
Get PDFEarly detection of patients with lifted danger of creating diabetes mellitus is basic to the enhanced counteractive action and general clinical management of these patients. Data mining now-a-days assumes a critical part in expectation of diseases in human services industry. Data mining is the way toward choosing, investigating, and displaying a lot of data to find obscure examples or connections helpful to the data examiner. Therapeutic data mining has risen perfect with potential for investigating concealed examples from the data sets of medicinal area. These examples can be used for quick and better clinical basic leadership for preventive and suggestive medicine. However crude medicinal data are accessible generally appropriated, heterogeneous in nature and voluminous for common handling. Data mining and Statistics can altogether work better towards finding shrouded examples and structures in data. In this paper, two noteworthy Data Mining strategies v.i.z., FP-Growth and Apriori have been utilized for application to diabetes dataset and association rules are being created by both of these calculations
A Predictive Control Scheme for Enhancement of Active Power Filter Performance
Get PDFA dynamic power channel actualized with a four-leg voltage-source inverter utilizing a prescient control plot is exhibited. The utilization of a four-leg voltage-source inverter permits the pay of current consonant parts, and additionally lopsided current created by single-stage nonlinear burdens. A point by point yet basic numerical model of the dynamic power channel, including the impact of the comparable power framework impedance, is determined and used to plan the prescient control calculation. A fuzzy controller is intended to moderate the aggregate consonant mutilation. The remuneration execution of the proposed dynamic power channel and the related control conspire under unfaltering state and transient working conditions is shown through reproductions utilizing MATLAB/SIMULINK condition.
The Probabilistic Methodology for Distinguishing Node Failures in Mobile Wireless Networks
Get PDFThe Wireless Mobile Network is work of "nodes"- from a couple to a few hundreds or even thousands, where every node is associated with one mobile. A node in a wireless mobile network that is equipped for using out some procedure and assemble mobile data and speaking with other associated nodes in the network. The nodes to perform transmissions not effectively, there are some issues may emerge in that they are 1) if node failure will happen in any stage, 2) security issues emerges because of transmission includes number of nodes, 3) expanding transmission time because of more number of nodes will be dynamic at a time to finish a specific assignment. To take care of this issue we propose new calculations are 1) node detecting and node failure for movement location, 2) finding courses and give security utilizing neighborhood keys, 3) which node includes to play out the activity that present node just to be dynamic at a time other to rest mode utilizing node booking plan. The way toward identifying the fizzled or harmed nodes in the wireless network is excessively mind boggling due, making it impossible to its dynamic topology and exhibiting of gigantic number of nodes in it. Sometimes the association may get loss amid the time of recognition, it makes us to put in the troublesome position. So as to lessen these complexity and challenges, we approach the probabilistic strategy to supplant the fizzled node with great node to actuate the transmission of information and decrease the time complexity amid the time of correspondence
High Utility Itemsets Mining for Transactional Databases
Get PDFMainstream issue in data mining, which is called "high-utility itemset mining" or all the more for the most part utility mining. High Utility Itemsets which are itemsets having an utility gathering a client determined least utility edge value i.e min_util. The principle target of utility mining is to discover thing sets with highest utilities, by thinking about benefit, amount, cost or some other client inclinations. Research has been done in region of mining HUI's. Different procedures have been connected. The fundamental issue with setting edge value which is for the most part client particular, is it should be proper. In Order to set most fitting or right Threshold value for mining HUI's,user needs to do trial and mistake which thus is tedious and repetitive process, in light of the fact that if min_util is set too low, framework will bring about getting substantial data of HUI, which thus makes framework incapable with the end goal of HUI. In the event that we set min_util too high, this will bring about getting little sum or no HUI's. Consequently setting least edge value is troublesome. The proposed framework is following Top-k framework for mining top-k HUI's, which is utilizing two algorithms TKU (mining top-k utility itemsets) and TKO (mining top-k in one phase),without setting min_util edge
Performance Evaluation of Gene Based Ontology Using Attribute Selection Methods
Get PDFWith the mounting quantity of ageing-related data on model organisms obtainable on the web, in specific linked to the heredities of ageing, it is opportune to smear data mining methods to that data, in instruction to attempt to determine novel patterns that may backing ageing research. The foremost new facet of the proposed feature selection methods is that they adventure hierarchical relationships in the set of features Gene Ontology terms in order to progress the prognostic exactness of the Naive Bayes and 1-Nearest Neighbor (1-NN) classifiers, which are castoff to pigeonhole model organisms’ genes into pro-longevity or anti-longevity genes. The marks show that our hierarchical feature selection methods, when used organized with Naive Bayes and 1-NN classifiers, get advanced prognostic correctness than the normal deprived of feature selection
Enhanced aggregate signature scheme for secure data verification in wireless sensor network
Get PDFIn tangible, the wireless sensor networks have been approximately practical, such as target tracking and environment remote monitoring. But, data can be simply bargained by a huge of doses, such as data capture and data meddling, etc. In this paper, we chiefly effort on data integrity protection, give an identity-based aggregate signature outline with a voted verifier for wireless sensor networks. Bestowing to the improvement of aggregate signatures, our outline not only can preserve data integrity, but also can condense bandwidth and storage cost for wireless sensor networks. Moreover, the security of our identity-based aggregate signature organization is carefully open based on the computational Diffie-Hellman conjecture in unsystematic vision typical