CDA Generation and Integration for Health Information Exchange Based on Cloud Computing System

CDA Generation and Integration for Health Information Exchange Based on Cloud Computing System

CDA Generation and Integration for Health Information Exchange Based on Cloud Computing System

ABSTRACT:

CDA Generation and Integration for Health Information Exchange Based on Cloud Computing System

Successful deployment of Electronic Health Record helps improve patient safety and quality of care, but it has the prerequisite of interoperability between Health Information Exchange at different hospitals. The Clinical Document Architecture (CDA) developed by HL7 is a core document standard to ensure such interoperability, and propagation of this document format is critical for interoperability. Unfortunately, hospitals are reluctant to adopt interoperable HIS due to its deployment cost except for in a handful countries. A problem arises even when more hospitals start using the CDA document format because the data scattered in different documents are hard to manage. In this paper, we describe our CDA document generation and integration Open API service based on cloud computing, through which hospitals are enabled to conveniently generate CDA documents without having to purchase proprietary software. Our CDA document integration system integrates multiple CDA documents per patient into a single CDA document and physicians and patients can browse the clinical data in chronological order. Our system of CDA document generation and integration is based on cloud computing and the service is offered in Open API. Developers using different platforms thus can use our system to enhance interoperability.

OUTPUT VIDEO:

EXISTING SYSTEM:

  • Effective health information exchange needs to be standardized for interoperable health information exchange between hospitals. Especially, clinical document standardization lies at the core of guaranteeing interoperability.
  • It takes increasing amount of time for the medical personnel as the amount of exchanged CDA document increases because more documents means that data are distributed in different documents. This significantly delays the medical personnel in making decisions. Hence, when all of the CDA documents are integrated into a single document, the medical personnel is empowered to review the patient’s clinical history conveniently in chronological order per clinical section and the follow-up care service can be delivered more effectively. Unfortunately for now, a solution that integrates multiple CDA documents into one does not exist yet to the best of our knowledge and there is a practical limitation for individual hospitals to develop and implement a CDA document integration technology.

DISADVANTAGES OF EXISTING SYSTEM:

  • The HIS development platforms for hospitals vary so greatly that generation of CDA documents in each hospital invariably requires a separate CDA generation system. Also, hospitals are very reluctant to adopt a new system unless it is absolutely necessary for provision of care. As a result, the adoption rate of EHR is very low except for in a few handful countries.
  • Unfortunately for now, a solution that integrates multiple CDA documents into one does not exist yet to the best of our knowledge and there is a practical limitation for individual hospitals to develop and implement a CDA document integration technology.
  • To establish confidence in HIE interoperability, more HIS’s need to support CDA. However, the structure of CDA is very complex and the production of correct CDA document is hard to achieve without deep understanding of the CDA standard and sufficient experience with it.

PROPOSED SYSTEM:

  • In this paper we present (1) a CDA document generation system that generates CDA documents on different developing platforms and (2) a CDA document integration system that integrates multiple CDA documents scattered in different hospitals for each patient.
  • CDA Generation API generates CDA documents on cloud.
  • CDA Generation Interface uses the API provided by the cloud and relays the input data and receives
  • CDA documents generated in the cloud.
  • Template Manager is responsible for managing the CDA documents generated in the cloud server. Our system uses CCD document templates.
  • CDA Generator collects patient data from hospitals and generates CDA documents in the template formats as suggested by the Template Manager.
  • CDA Validator inspects whether the generated CDA document complies with the CDA schema standard.

ADVANTAGES OF PROPOSED SYSTEM:

  • Hospital systems can simply extend their existing system rather than completely replacing it with a new system. Second, it becomes unnecessary for hospitals to train their personnel to generate, integrate, and view standard-compliant CDA documents.
  • The cloud CDA generation service produces documents in the CDA format approved by the National Institute of Standards and Technology (NIST).
  • If this service is provided for free at low price to hospitals, existing EHR are more likely to consider adoption of CDA in their practices.
  • Interoperability between hospitals not only helps improve patient safety and quality of care but also reduce time and resources spent on data format conversion.

SYSTEM ARCHITECTURE:

cda Generation and Integration ieee 2016

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

 

  • System : Pentium Dual Core.
  • Hard Disk : 120 GB.
  • Monitor : 15’’ LED
  • Input Devices : Keyboard, Mouse
  • Ram : 1 GB

SOFTWARE REQUIREMENTS:

  • Operating system : Windows 7.
  • Coding Language : JAVA/J2EE
  • Tool : Netbeans 7.2.1
  • Database : MYSQL

REFERENCE:

Sung-Hyun Lee, Joon Hyun Song, and Il Kon Kim, “CDA Generation and Integration for Health Information Exchange Based on Cloud Computing System”, IEEE TRANSACTIONS ON SERVICES COMPUTING, VOL. 9, NO. 2, MARCH/APRIL 2016.

An Efficient Privacy-Preserving Ranked Keyword Search Method

An Efficient Privacy-Preserving Ranked Keyword Search Method

An Efficient Privacy-Preserving Ranked Keyword Search Method

An Efficient Privacy-Preserving Ranked Keyword Search Method

ABSTRACT:

Cloud data owners prefer to outsource documents in an encrypted form for the purpose of privacy preserving. Therefore it is essential to develop efficient and reliable ciphertext search techniques. One challenge is that the relationship between documents will be normally concealed in the process of encryption, which will lead to significant search accuracy performance degradation. Also the volume of data in data centers has experienced a dramatic growth. This will make it even more challenging to design ciphertext search schemes that can provide efficient and reliable online information retrieval on large volume of encrypted data. In this paper, a hierarchical clustering method is proposed to support more search semantics and also to meet the demand for fast ciphertext search within a big data environment. The proposed hierarchical approach clusters the documents based on the minimum relevance threshold, and then partitions the resulting clusters into sub-clusters until the constraint on the maximum size of cluster is reached. In the search phase, this approach can reach a linear computational complexity against an exponential size increase of document collection. In order to verify the authenticity of search results, a structure called minimum hash sub-tree is designed in this paper. Experiments have been conducted using the collection set built from the IEEE Xplore. The results show that with a sharp increase of documents in the dataset the search time of the proposed method increases linearly whereas the search time of the traditional method increases exponentially. Furthermore, the proposed method has an advantage over the traditional method in the rank privacy and relevance of retrieved documents.

PROJECT OUTPUT VIDEO: (Click the below link to see the project output video):

EXISTING SYSTEM:

  • In the recent years, researchers have proposed many ciphertext search schemes by incorporating the cryptography techniques. In addition, the relationship between documents is concealed in the above methods. The relationship between documents represents the properties of the documents and hence maintaining the relationship is vital to fully express a document. For example, the relationship can be used to express its category. If a document is independent of any other documents except those documents that are related to sports, then it is easy for us to assert this document belongs to the category of the sports.
  • Due to the blind encryption, this important property has been concealed in the traditional methods. Therefore, proposing a method which can maintain and utilize this relationship to speed the search phase is desirable.
  • Sun et al. use Merkle hash tree and cryptographic signature to create a verifiable MDB-tree. However, their work cannot be directly used in our architecture which is oriented for privacy-preserving multiple keyword search. Thus, a proper mechanism that can be used to verify the search results within big data scenario is essential to both the CSPs and end users.

DISADVANTAGES OF EXISTING SYSTEM:

  • Existing methods have been proven with provable security, but their methods need massive operations and have high time complexity. Therefore, former methods are not suitable for the big data scenario where data volume is very big and applications require online data processing.
  • Song et al. method has a high searching cost due to the scanning of the whole data collection word by word.
  • Due to the lack of rank mechanism, users have to take a long time to select what they want when massive documents contain the query keyword. Thus, the order-preserving techniques are utilized to realize the rank mechanism,
  • Sun et al. give a new architecture which achieves better search efficiency. However, at the stage of index building process, the relevance between documents is ignored.

An Efficient Privacy-Preserving Ranked Keyword Search Method

PROPOSED SYSTEM:

  • In this paper, a vector space model is used and every document is represented by a vector, which means every document can be seen as a point in a high dimensional space. Due to the relationship between different documents, all the documents can be divided into several categories.
  • Instead of using the traditional sequence search method, a backtracking algorithm is produced to search the target documents. Cloud server will first search the categories and get the minimum desired sub-category. Then the cloud server will select the desired k documents from the minimum desired sub-category. The value of k is previously decided by the user and sent to the cloud server. If current sub-category can not satisfy the k documents, cloud server will trace back to its parent and select the desired documents from its brother categories. This process will be executed recursively until the desired k documents are satisfied or the root is reached.
  • To verify the integrity of the search result, a verifiable structure based on hash function is constructed.

ADVANTAGES OF PROPOSED SYSTEM:

  • The search time can be largely reduced by selecting the desired category and abandoning the irrelevant categories.
  • Comparing with all the documents in the dataset, the number of documents which user aims at is very small. Due to the small number of the desired documents, a specific category can be further divided into several sub-categories.
  • A virtual root is constructed to represent all the data and categories. The virtual root is denoted by the hash result of the concatenation of all the categories located in the first level. The virtual root will be signed so that it is verifiable. To verify the search result, user only needs to verify the virtual root, instead of verifying every document.

SYSTEM ARCHITECTURE:

An Efficient Privacy-Preserving Ranked Keyword Search Method

An Efficient Privacy-Preserving Ranked Keyword Search Method

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

 

  • System : Pentium Dual Core.
  • Hard Disk : 120 GB.
  • Monitor : 15’’ LED
  • Input Devices : Keyboard, Mouse
  • Ram : 1 GB

SOFTWARE REQUIREMENTS:

  • Operating system : Windows 7.
  • Coding Language : JAVA/J2EE
  • Tool : Netbeans 7.2.1
  • Database : MYSQL

REFERENCE:

Chi Chen, Member, IEEE, Xiaojie Zhu, Student Member, IEEE, Peisong Shen, Student Member, IEEE, Jiankun Hu, Member, IEEE, Song Guo, Senior Member, IEEE, Zahir Tari, Senior Member, IEEE, and Albert Y. Zomaya, Fellow, IEEE, “An Efficient Privacy-Preserving Ranked Keyword Search Method”, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 27, NO. 4, APRIL 2016.

An Efficient File Hierarchy Attribute-Based Encryption Scheme in Cloud Computing

An Efficient File Hierarchy Attribute-Based Encryption Scheme in Cloud Computing

An Efficient File Hierarchy Attribute-Based Encryption Scheme in Cloud Computing

ABSTRACT:

Ciphertext-policy attribute-based encryption (CP-ABE) has been a preferred encryption technology to solve the challenging problem of secure data sharing in cloud computing. The shared data files generally have the characteristic of multilevel hierarchy, particularly in the area of healthcare and the military. However, the hierarchy structure of shared files has not been explored in CP-ABE. In this paper, an efficient file hierarchy attribute-based encryption scheme is proposed in cloud computing. The layered access structures are integrated into a single access structure, and then, the hierarchical files are encrypted with the integrated access structure. The ciphertext components related to attributes could be shared by the files. Therefore, both ciphertext storage and time cost of encryption are saved. Moreover, the proposed scheme is proved to be secure under the standard assumption. Experimental simulation shows that the proposed scheme is highly efficient in terms of encryption and decryption. With the number of the files increasing, the advantages of our scheme become more and more conspicuous.

PROJECT OUTPUT VIDEO:

EXISTING SYSTEM:

  • Sahai and Waters proposed fuzzy Identity-Based Encryption (IBE) in 2005, which was the prototype of ABE. Latterly, a variant of ABE named CP-ABE was proposed.
  • Since Gentry and Silverberg proposed the first notion of hierarchical encryption scheme, many hierarchical CP-ABE schemes have been proposed. For example, Wang et al. proposed a hierarchical ABE scheme by combining the hierarchical IBE and CP-ABE.
  • Wan et al. proposed hierarchical ABE scheme. Later, Zou gave a hierarchical ABE scheme, while the length of secret key is linear with the order of the attribute set. A ciphertextpolicy hierarchical ABE scheme with short ciphertext is also studied.
  • In these schemes, the parent authorization domain governs its child authorization domains and a top-level authorization domain creates secret key of the next-level domain. The work of key creation is distributed on multiple authorization domains and the burden of key authority center is lightened.

DISADVANTAGES OF EXISTING SYSTEM:

  • In Existing System time and cost for encryption is high.
  • No any special multiple hierarchical files are used.
  • Decryption system time and computation cost are very high.

PROPOSED SYSTEM:

  • In this study, an efficient encryption scheme based on layered model of the access structure is proposed in cloud computing, which is named file hierarchy CP-ABE scheme (or FH-CP-ABE, for short). FH-CP-ABE extends typical CP-ABE with a hierarchical structure of access policy, so as to achieve simple, flexible and fine-grained access control.
  • The contributions of our scheme are three aspects.
  • Firstly, we propose the layered model of access structure to solve the problem of multiple hierarchical files sharing. The files are encrypted with one integrated access structure.
  • Secondly, we also formally prove the security of FH-CP-ABE scheme that can successfully resist chosen plaintext attacks (CPA) under the Decisional Bilinear Diffie-Hellman (DBDH) assumption.
  • Thirdly, we conduct and implement comprehensive experiment for FH-CP-ABE scheme, and the simulation results show that FH-CP-ABE has low storage cost and computation complexity in terms of encryption and decryption.

ADVANTAGES OF PROPOSED SYSTEM:

  • CP-ABE feasible schemes which has much more flexibility and is more suitable for general applications
  • Multiple hierarchical files sharing are resolved using layered model of access structure.
  • In proposed system both ciphertext storage and time cost of encryption are saved.
  • The proposed scheme has an advantage that users can decrypt all authorization files by computing secret key once. Thus, the time cost of decryption is also saved if the user needs to decrypt multiple files.
  • The computation cost of decryption can also be reduced if users need to decrypt multiple files at the same time.

SYSTEM ARCHITECTURE:

An Efficient File Hierarchy Attribute-Based Encryption Scheme in Cloud Computing

An Efficient File Hierarchy Attribute-Based Encryption Scheme in Cloud Computing

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

  • System : Pentium Dual Core.
  • Hard Disk : 120 GB.
  • Monitor : 15’’ LED
  • Input Devices : Keyboard, Mouse
  • Ram : 1 GB

SOFTWARE REQUIREMENTS:

  • Operating system : Windows 7.
  • Coding Language : JAVA/J2EE
  • Tool :         Netbeans 7.2.1
  • Database : MYSQL

REFERENCE:

Shulan Wang, Junwei Zhou, Member, IEEE, Joseph K. Liu, Member, IEEE, Jianping Yu, Jianyong Chen, and Weixin Xie, “An Efficient File Hierarchy Attribute-Based Encryption Scheme in Cloud Computing”, IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 11, NO. 6, JUNE 2016.

PROJECT OUTPUT VIDEO: