COMPATIBILITY WITH THE PROXY AGENT HAS BEEN TESTED THROUGH TRIAL AND TIME THAT WAS CHOSEN FOR EMAIL MESSAGES

B. Anusha, J. Vidya

Abstract


The Digital Health Record product is a unique application that provides great convenience in medical care. In this document, we offer a unique primitive cryptography called keyword search associated with a specific test function and proxy redirection agent proxy function, a type of SE plan based on the period. We designed a file encryption plan with unique search capability that supports Safe Search for the associated keywords and authorization function. The Searchable File Encryption (SE) plan is in fact a technology that includes both security protection and operational functions that can play an important role in the eHealth registration system. Unlike current systems, the work is able to time to encrypt proxy files with effective deauthorization. The security and privacy of private confidential information will be key user concerns that can hinder further development and broad adoption of systems. Patients may be allowed to delegate legal rights to partially access others to search functions to work on their records within a short period of time. You can control the size of the time frame for that delegate to monitor and decrypt the encrypted documents of the delegate. Comparison and overall simulation indicate that they represent a low burden of calculation and storage. We have modeled a method with a security model for the proposed Re-dtPECK plan to prove that it is a competent plan that has been proven to be safe in the standard model. Experimental and security analysis results suggest that our plan is more secure than current solutions with reasonable costs for applications in the cloud.


Keywords


Searchable Encryption; Time Control; Conjunctive Keywords; Designated Tester; E-Health.

References


Yang Yang and Maode Ma, Senior Member, IEEE, “Conjunctive Keyword Search With DesignatedTester and Timing Enabled Proxy Re-EncryptionFunction for E-Health Clouds”, ieee transactions on information forensics and security, vol. 11, no. 4, april 2016.

L. Guo and W. C. Yau, “Efficient secure-channel free public key encryption with keyword search for EMRs in cloud storage,” J. Med. Syst., vol. 39, no. 2, pp. 1–11, 2015.

J. W. Byun and D. H. Lee, “On a security model of conjunctive keyword search over encrypted relational database,” J. Syst. Softw., vol. 84, no. 8, pp. 1364–1372, 2011.

Q. Liu, G. Wang, and J. Wu, “Time-based proxy re-encryption scheme for secure data sharing in a cloud environment,” Inf. Sci., vol. 258, pp. 355–370, Feb. 2014.

L. Fang, W. Susilo, C. Ge, and J. Wang, “Public key encryption with keyword search secure against keyword guessing attacks without random oracle,” Inf. Sci., vol. 238, pp. 221–241, Jul. 2013.

X. A. Wang, X. Huang, X. Yang, L. Liu, and X. Wu, “Further observation on proxy re-encryption with keyword search,” J. Syst. Softw., vol. 85, no. 3, pp. 643–654, 2012.


Full Text: PDF

Refbacks

  • There are currently no refbacks.




Copyright © 2012 - 2021, All rights reserved.| ijitr.com

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.