Data Mining - Concepts and Techniques.

In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier) can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.A POR may be viewed as a kind of cryptographic proof of knowledge (POK), but one specially designed to handle a large file (or bitstring) F. We explore POR protocols here in which the communication costs, number of memory accesses for the prover, and storage requirements of the user (verifier) are small parameters essentially independent of the length of F. In addition to proposing new, practical POR constructions, we explore implementation considerations and optimizations that bear on previously explored, related schemes.In a POR, unlike a POK, neither the prover nor the verifier need actually have knowledge of F. PORs give rise to a new and unusual security definition whose formulation is another contribution of our work.We view PORs as an important tool for semi-trusted online archives. Existing cryptographic techniques help users ensure the privacy and integrity of files they retrieve. It is also natural, however, for users to want to verify that archives do not delete or modify files prior to retrieval. The goal of a POR is to accomplish these checks without users having to download the files themselves. A POR can also provide quality-of-service guarantees, i.e., show that a file is retrievable within a certain time bound.

PORs: Proofs of Retrievability for Large Files

This paper shows a generic and simple conversion from weak asymmetric and symmetric encryption schemes into an asymmetric encryption scheme which is secure in a very strong sense- indistinguishability against adaptive chosen-ciphertext attacks in the random oracle model. In particular, this conversion can be applied efficiently to an asymmetric encryption scheme that provides a large enough coin space and, for every message, many enough variants of the encryption, like the ElGamal encryption scheme.

Secure integration of asymmetric and symmetric encryption schemes

Molecular mechanisms of polymyxin resistance: knowns and unknowns

Cloud-centric IoT based disease diagnosis healthcare framework

https://cyberleninka.org/article/n/915923.pdf

Improvised Apriori Algorithm Using Frequent Pattern Tree for Real Time Applications in Data Mining

Cloud computing is a rising technology that is still unclear to many security issues. The most challenging issue today in cloud servers is to ensure data security and privacy of the users. The proposed schema presents HE-RSA or hybrid encryption RSA along with Advanced Encryption Standard or AES to ensure efficiency, consistency and trustworthiness in cloud servers. The goal of this paper is to use various cryptography concepts during communication along with its application in cloud computing and to enhance the security of ciphertext or encrypted data in cloud servers along with minimizing the consumption of time, cost and memory size during encryption and decryption.

Secure algorithm for cloud computing and its applications

Apriori Algorithm is one of the most important algorithm which is used to extract frequent itemsets from large database and get the association rule for discovering the knowledge. It basically requires two important things: minimum support and minimum confidence. First, we check whether the items are greater than or equal to the minimum support and we find the frequent itemsets respectively. Secondly, the minimum confidence constraint is used to form association rules. Based on this algorithm, this paper indicates the limitation of the original Apriori algorithm of wasting time and space for scanning the whole database searching on the frequent itemsets, and present an improvement on Apriori.

Improvised Apriori Algorithm using frequent pattern tree for real time applications in data mining

Cloud Computing is a rising field in the history of computing. It is a way to maximise the capacity and capabilities without spending a lot to buy a new infrastructure and software. When users are online, they can get faster access to their data due to the massive storage. Although Cloud computing has many advantages due to large number of organizations moving towards it, it comes up with lots of security issues and breaches faced by both cloud service providers and users which are addressed in this paper. An efficient framework is devised for dealing with such issues. Proposed framework can protect data while transferring, sharing and storing in data centers using classification of data, Hashed Message Authentication codes and Index Building. The data is divided into three sections and accordingly the user is asked for authentication. User is provided the digital signature which can be verified with cloud directory. Using indexing, search can be made on the encrypted data.

A framework for data security and storage in Cloud Computing

Antibiogram profile of 1590 clinical bacterial isolates based on thirteen different antimicrobial compounds showed that 1.6% of the bacterial isolates are multidrug resistant. Distribution pattern based on 16S rRNA sequence analysis showed that Pseudomonas aeruginosa constituted the largest group (83.6%) followed by Burkholderia pseudomallei sp. A191 (5.17%), Staphylococcus sp. A261 (3.45%). Among the various antibiotics used, colistin appeared to be the most effective against the Gram negative bacteria. Burkholderia pseudomallei sp. A191 and Pseudomonas aeruginosa sp. A111 showed resistance to 1500 μg/ml and 750 μg/ml of colistin respectively which constitutes 7.7% of the bacterial population. A functional genomics strategy was employed to discover the molecular support for colistin resistance in Burkholderia pseudomallei sp. A191. A pUC plasmid-based genomic expression library was constructed with an estimated library size of 2.1 × 107bp. Five colistin resistant clones were obtained after functional screening of the library. Analysis of DNA sequence of five colistin resistant clones showed homology to two component regularity systems (TCRS) encoding for a histidine kinase (mrgS) and its regulatory component (mrgR). Cross complementation assay showed that mutations in mrgS were sufficient enough to confer colistin resistant phenotype in a sensitive strain.

/pdf/functional-genome-screening-to-elucidate-the-colistin-2uaqdh22y6.pdf

Ashutosh Gupta

Papers

Improvised Apriori Algorithm Using Frequent Pattern Tree for Real Time Applications in Data Mining

Secure algorithm for cloud computing and its applications

Improvised Apriori Algorithm using frequent pattern tree for real time applications in data mining

A framework for data security and storage in Cloud Computing

Functional Genome Screening to Elucidate the Colistin Resistance Mechanism