Abstract: Medical applications are fast growing in popularity, both for professional use and for patient-centered apps. The current Health record and IoT data sharing systems however have a fair amount of problems associated with privacy and security. The major of it is the inability of sharing medical records from one hospital to another directly. Also, the unavailability of past medical records of a patient at critical times has been a very serious yet underestimated problem. The secure and privacy-aware E-Health record proposes a mechanism using Blockchain and IPFS (Inter Planetary File System) which offers a solution to all these problems. My solution proposes a system that will upload all the medical records of a patient on the IPFS network, which is decentralized. After uploading the medical records on the IPFS network, it will generate a Hash for every item uploaded on the network and store it in the database, corresponding to an id that will be unique to that patient. The IPFS data will be dispersed among the nodes. Use of IPFS (Interplanetary File System) to store health records, which has the benefit of being distributed which in turn makes records tamper-free. In addition, the proposed model keeps track of disease statistics without invading any patient's privacy. The presence of all the medical records of the patient on the IPFS network will ensure that all the medical records are easily accessible to any hospital across the globe, readily at any time, with the proper authorization from the patient itself. Any hospital will be able to access the medical records of a patient by visiting the IPFS network through their private gateway using the hash that was stored in the database at the time of uploading the records
Description:FIG1: Depicts the functioning of both the client side and server side during the uploading of a file on the IPFS network. When a health facility wants to upload a file to the server it has to enter the unique Health ID of the patient in our software (MedBlock) which then looks for a linked phone number to the unique ID and sends an OTP to the mobile number. After the OTP authentication is done the health facility is given permission to upload the files to the IPFS network.
FIG2: Depicts the functioning of both the client side and server side during the retrieval of records of a patient from the IPFS network. A health facility has to enter the unique health ID of a patient into the system which will then start the OTP authentication process. Every hospital will have their dedicated IPFS gateway through which the main IPFS server can be accessed. From where hospitals can retrieve records of that patient to their local system and has the option to download it. , Claims:We Claim,
1. This mechanism will ensure easy sharing of Electronic Health Records of patients to all the health facilities around the world.
2. Using IPFS as the backend mechanism for the storage of records makes it more energy efficient as compared to storing it in a Blockchain, keeping in check the immutability factor.
3. This system will enable health facilities to track the complete medical history of a patient with proper timestamps and will ensure the authentication of each record as the IPFS network is tamper-proof.
4. No health facilities will be given access to the medical records of any patient without the patient’s authorization.
5. The metadata of the uploaded medical records will be stored in our databases corresponding to the unique Health ID of the patient.
6. The decentralized storage mechanism ensures that no medical records will be ever lost to time.
| # | Name | Date |
|---|---|---|
| 1 | 202331066477-REQUEST FOR EXAMINATION (FORM-18) [04-10-2023(online)].pdf | 2023-10-04 |
| 2 | 202331066477-FORM 18 [04-10-2023(online)].pdf | 2023-10-04 |
| 3 | 202331066477-FORM 1 [04-10-2023(online)].pdf | 2023-10-04 |
| 4 | 202331066477-DRAWINGS [04-10-2023(online)].pdf | 2023-10-04 |
| 5 | 202331066477-COMPLETE SPECIFICATION [04-10-2023(online)].pdf | 2023-10-04 |
| 6 | 202331066477-FORM-5 [11-11-2025(online)].pdf | 2025-11-11 |