UGC Approved Journal no 63975(19)
New UGC Peer-Reviewed Rules

ISSN: 2349-5162 | ESTD Year : 2014
Volume 13 | Issue 3 | March 2026

JETIREXPLORE- Search Thousands of research papers



WhatsApp Contact
Click Here

Published in:

Volume 10 Issue 5
May-2023
eISSN: 2349-5162

UGC and ISSN approved 7.95 impact factor UGC Approved Journal no 63975

7.95 impact factor calculated by Google scholar

Unique Identifier

Published Paper ID:
JETIR2305910


Registration ID:
516105

Page Number

i665-i670

Share This Article


Jetir RMS

Title

Encryption of medical documents by using nearest neighbor search scheme

Abstract

The security and privacy of medical documents containing sensitive information about patients is of utmost importance. Encryption is a critical aspect of protecting these documents from unauthorized access, and the nearest neighbor search scheme is a promising method for improving the encryption process. This paper presents a detailed analysis of the use of the nearest neighbor search scheme for the encryption of medical documents. The nearest neighbor search scheme involves dividing the medical document into blocks and generating a key by applying the scheme to a database of documents. The key is used to encrypt and decrypt the document, making it difficult for attackers to access the confidential information. The scheme is highly efficient, requiring only the calculation of the cosine similarity between documents in the database, making it suitable for use in resource-constrained environments. The paper discusses the benefits of the nearest neighbor search scheme in the context of medical document encryption. The scheme provides a high level of security by generating a key from a random document in a large database, which makes it difficult for attackers to guess the key. The scheme also ensures efficient encryption and decryption because it does not require a large amount of computational power. The use of the nearest neighbor search scheme for the encryption of medical documents is a promising approach that can improve the security of these documents. Further research can be conducted to optimize the scheme for different scenarios. For example, the scheme can be optimized for use in scenarios where the database is limited, or where the medical documents have specific characteristics that may affect the performance of the scheme. The paper highlights the need for continued research to optimize the scheme and improve its effectiveness in different settings

Key Words

Encryption, Nearest Neighbor scheme

Cite This Article

"Encryption of medical documents by using nearest neighbor search scheme", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.10, Issue 5, page no.i665-i670, May-2023, Available :http://www.jetir.org/papers/JETIR2305910.pdf

ISSN


2349-5162 | Impact Factor 7.95 Calculate by Google Scholar

An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 7.95 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator

Cite This Article

"Encryption of medical documents by using nearest neighbor search scheme", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.10, Issue 5, page no. ppi665-i670, May-2023, Available at : http://www.jetir.org/papers/JETIR2305910.pdf

Publication Details

Published Paper ID: JETIR2305910
Registration ID: 516105
Published In: Volume 10 | Issue 5 | Year May-2023
DOI (Digital Object Identifier):
Page No: i665-i670
Country: BHIMAVARAM, West Godavari Dist, Andhra Pradesh, India .
Area: Engineering
ISSN Number: 2349-5162
Publisher: IJ Publication


Preview This Article


Downlaod

Click here for Article Preview

Download PDF

Downloads

000195

Print This Page

Current Call For Paper

Jetir RMS