Chosen-ciphertext Research Articles

CLOUD DATA PROTECTION USING WEIBULL DISTRIBUTED RECURRENT NEURAL ERGODIC SIGNCRYPTION

Cloud computing has become an integral part of modern computing, offering scalable storage and processing resources. However, the security of data stored in the cloud remains a major concern, especially when dealing with sensitive information. Traditional encryption schemes, while effective, often face limitations in terms of computational overhead and vulnerability to advanced attacks. To address these challenges, we propose a novel Weibull Distributed Recurrent Neural Ergodic Skewed Certificateless Signcryption scheme aimed at enhancing data protection in cloud environments. The key problem addressed by this work is the inherent inefficiency of existing cryptographic solutions that either rely on certificate-based systems or suffer from high computational and communication costs. This is especially crucial in cloud systems where real-time data processing is essential. Our approach integrates Weibull distribution for key management and optimization, recurrent neural networks (RNNs) for secure data transmission prediction, and ergodic skewed signcryption to eliminate the need for certificate authorities. This results in improved security, reduced computational overhead, and efficient communication, ensuring that the data remains secure even in dynamic cloud environments. The proposed scheme was tested using various metrics, including encryption/decryption time, data throughput, and attack resistance. Results demonstrate a significant reduction in computational cost by approximately 28% compared to traditional certificateless encryption. Furthermore, encryption times decreased from an average of 1.8 ms to 1.2 ms, and the scheme showed robustness against man-in-the-middle and chosen-ciphertext attacks with a detection accuracy of 98.6%. These results confirm the efficacy of the proposed system for enhancing security in cloud computing environments while maintaining high performance.

A lightweight BRLWE-based post-quantum cryptosystem with side-channel resilience for IoT security

The rapid advancement of quantum computing poses a significant threat to conventional cryptographic systems, particularly in the context of Internet of Things (IoT) security. This paper introduces PQ-IoTCrypt, a lightweight post-quantum cryptosystem for resource-constrained IoT devices. PQ-IoTCrypt builds upon the binary ring learning with errors problem, incorporating optimizations for efficient implementation on 8-bit microcontrollers commonly found in IoT environments. We introduce a symmetric discrete uniform distribution and streamlined polynomial arithmetic to reduce computational overhead while maintaining a high-security level. Additionally, we present a comprehensive power side-channel analysis framework for lattice-based post-quantum cryptography, demonstrating PQ-IoTCrypt's resilience against various side-channel attacks, including advanced ciphertext selection criteria, IoT-optimized template creation, and a hierarchical chosen-ciphertext attack methodology tailored for IoT deployments. Experimental results show that PQ-IoTCrypt achieves a 9.9% reduction in total encryption time compared to the next best baseline at the 256-bit security level while requiring significantly fewer ciphertexts for successful attacks. PQ-IoTCrypt demonstrates superior performance in key generation, encryption, and decryption processes, with times reduced by 12.7 %, 9.1 %, and 9.2 %, respectively, compared to the closest competitor. This work contributes to the standardization efforts of post-quantum IoT security and offers valuable insights for real-world deployment of quantum-resistant cryptography in resource-limited settings.

An Attribute-Based End-to-End Policy-Controlled Signcryption Scheme for Secure Group Chat Communication

Secure instant communication is an important topic of information security. A group chat is a highly convenient mode of instant communication. Increasingly, companies are adopting group chats as a daily office communication tool. However, a large volume of messages in group chat communication can lead to message overload, causing group members to miss important information. Additionally, the communication operator’s server may engage in the unreliable behavior of stealing information from the group chat. To address these issues, this paper proposes an attribute-based end-to-end policy-controlled signcryption scheme, aimed at establishing a secure and user-friendly group chat communication mode. By using the linear secret sharing scheme (LSSS) with strong expressive power to construct the access structure in the signcryption technology, the sender can precisely control the recipients of the group chat information to avoid message overload. To minimize computational cost, a signcryption step with constant computational overhead is designed. Additionally, a message-sending mechanism combining “signcryption + encryption” is employed to prevent the operator server from maliciously stealing group chat information. Rigorous analysis shows that PCE-EtoE can resist adaptive chosen-ciphertext attacks under the standard model. Simulation results demonstrate that our theoretical derivation is correct, and that the PCE-EtoE scheme outperforms existing schemes in terms of computational cost, making it suitable for group chat communication.

Optical double-image cryptosystem based on a joint transform correlator in a linear canonical domain

In this work, we present a new optical double-image encryption method based on a joint transform correlator (JTC) and the linear canonical domain for the simultaneous authentication of two images. This new extension of the encryption system overcame the vulnerability of the method based on the JTC and the conventional 4f-optical processor in the Fourier domain. Although the simultaneous authentication process is satisfied in the Fourier domain, the data content is partially disclosed in false validation. Therefore, we introduce a quadratic phase encryption system of the linear canonical transform (LCT) domain in this method. The linear canonical transform domain adds more degrees of freedom to the security method due to the six LCT orders. In addition, the double-image encryption scheme became secure against intruder attacks, and it was difficult to recognize confidential information during the negative validation process. A cryptanalysis is performed in terms of a chosen-plaintext attack (CPA) and chosen-ciphertext attack (CCA). Numerical simulations demonstrate the feasibility, security, and effectiveness of the proposed system.

Enhancing Efficiency and Fine-Grained Control in Redactable Blockchains with EPBCHF

Blockchain technology has presented a promising decentralized paradigm to preclude trusted thirdparties' dominancy. It is a transparent and distributed ledger initially designed for digital cryptocurrencies whilecurrently extended to serve various industries. However, Blockchain immutability presents challenges, as it can bemisused for storing illicit content, violating privacy regulations, and limiting data management flexibility. PolicyBased Chameleon Hash Function (PBCH) has transformed blockchain rewriting contents concept via permittingmodifiers to amend certain transaction since they possessed fundamental privileges satisfying certain access policy.However, PBCHF suffers from efficiency issues due to its reliance on Chameleon Hash ephemeral Trapdoor (CHET)and Attribute-Based Encryption (ABE), significantly impacting overall efficiency. We propose the Efficient PolicyBased Chameleon (EPBCHF) construction by replacing CHET with Chameleon-Hashes by Dual Long-TermTrapdoors (CHDLTT) to address these challenges. Additionally, we introduce an enhanced encryption schemeresilient against chosen-ciphertext attacks (CCA) without compromising overall efficiency. Modelling EPBCHFproves practical instantiation accompanied by rigorous security proofs. Our construction provides a fine-grainedredactable blockchain in comparison to the currently proposed solutions. The evaluated results confirm that theproposed EPBCHF is scalable and efficient due to having the ability to handle unlimited transaction volumesadditionally, data is efficiently processed without further overhead meanwhile data size consistency reflects a robustmemory management due to predicted memory size, network bandwidth and storage requirement for future growththereby, EPBCHF is proven to be reliable and scalable.

Side-channel and Fault-injection attacks over Lattice-based Post-quantum Schemes (Kyber, Dilithium): Survey and New Results

In this work, we present a systematic study of Side-Channel Attacks (SCA) and Fault Injection Attacks (FIA) on structured lattice-based schemes, with main focus on Kyber Key Encapsulation Mechanism (KEM) and Dilithium signature scheme, which are leading candidates in the NIST standardization process for Post-Quantum Cryptography (PQC). Through our study, we attempt to understand the underlying similarities and differences between the existing attacks while classifying them into different categories. Given the wide variety of reported attacks, simultaneous protection against all the attacks requires to implement customized protections/countermeasures for both Kyber and Dilithium. We therefore present a range of customized countermeasures, capable of providing defenses/mitigations against existing SCA/FIA, and incorporate several SCA and FIA countermeasures within a single design of Kyber and Dilithium. Among the several countermeasures discussed in this work, we present novel countermeasures that offer simultaneous protection against several SCA- and FIA-based chosen-ciphertext attacks for Kyber KEM. We implement the presented countermeasures within two well-known public software libraries for PQC: (1) pqm4 library for the ARM Cortex-M4-based microcontroller and (2) liboqs library for the Raspberry Pi 3 Model B Plus based on the ARM Cortex-A53 processor. Our performance evaluation reveals that the presented custom countermeasures incur reasonable performance overheads on both the evaluated embedded platforms. We therefore believe our work argues for usage of custom countermeasures within real-world implementations of lattice-based schemes, either in a standalone manner or as reinforcements to generic countermeasures such as masking.

Data Transmission Security on Cloud Computing using Algorithm

Cloud computing enables businesses to efficiently store vast amounts of data in the cloud, which can be accessed seamlessly over the Internet without hardware compatibility constraints. However, the transmission of data over the Internet is susceptible to various security threats such as man-in-the-middle attacks, known plaintext attacks, chosen ciphertext attacks, related-key attacks, and pollution attacks. Uploading data to a single cloud service may heighten the risk of compromising confidential information. Prior research has explored several cryptography techniques like SA-EDS, RFDA, and EST to secure data storage across multiple cloud platforms. However, these existing methods exhibit vulnerabilities to various attacks. This article focuses on addressing data security challenges in multi-cloud environments and proposes an advanced approach called Proficient Security over Distributed Storage. PSDS has undergone rigorous testing against multiple attacks, demonstrating its resilience against related-key attacks, pollution attacks, chosen ciphertext attacks, and known plaintext attacks. Additionally, PSDS exhibits reduced computational time compared to existing encryption methods such as STTN and RFD.

Cryptanalyzing a bit-level image encryption algorithm based on chaotic maps

Recently, a bit-level image encryption algorithm based on chaotic maps (BCIEA) has been presented. BCIEA consists of diffusion and confusion, and its security performance mainly relies on the dynamic mechanisms introduced during diffusion and confusion, respectively. However, after a careful cryptanalysis, we found that BCIEA has fatal security issues. Although the bit-level diffusion formally employs complex chaining operations, there is a defect that the chaotic sequences can be used as an equivalent key. In addition, by analyzing its confusion, it is found that the dynamic mechanism adopted has obvious statistical characteristics, and it is especially difficult to resist all zero ciphertext attack. In addition, we also found that the BCIEA description is not rigorous, resulting in algorithm details that cannot be decrypted. On the basis of slightly reasonable modification, we propose a chosen-ciphertext attack method for cracking BCIEA. The method first uses the all-zero ciphertext to degrade it into a diffusion-only algorithm, and then chooses a cipher image with the same sum value as that of the target cipher image to break the confusion module possessing a dynamic mechanism. Theoretical analyses and experimental results verify the effectiveness and efficiency of the proposed attack method. This work can provide a reference for improving the security of image encryption schemes based on bit-level techniques.

Secure Task Distribution With Verifiable Re-Encryption in Mobile-Crowdsensing-Assisted Emergency IoT System

Extreme events (such as earthquakes, hurricanes, etc.) pose a dual challenge to the reliability and serviceability of IoT systems. With regard to this challenge, by publishing some tasks and then encouraging the public to assist in real-time data collection through their mobile terminals (namely, the mobile crowdsourcing-assisted IoT systems), is expected to play an important role in secondary disaster prevention and personnel rescue in extreme events. However, it has weaknesses in terms of security, flexibility, and efficiency. As an elegant solution, identity-based broadcast proxy re-encryption (PR-IBBE) enables flexible access authorization sharing and efficient broadcast distribution of encrypted tasks via the cloud. However, their security relies on fully-trusted or semi-trusted cloud assumptions, which are hard to be implemented in real-world scenarios. And the cloud is more vulnerable in an emergency event since there is a lack of effective management. Motivated by that, we propose the verifiable PR-IBBE (VPR-IBBE) scheme, which realizes a cross-domain identity-based broadcast task file secure authorization access, and empowers the verifiability and reputability of re-encrypted ciphertext under the untrusted cloud setting. This mechanism ensures that the relevance between the re-encrypted ciphertext and the original ciphertext can be publically verified, so the cloud can defend itself if there is a malicious accusation of forging the re-encrypted ciphertext. Through rigorous formal security proofs, we demonstrate that VPR-IBBE attains the indistinguishability of ciphertext against selective identity chosen ciphertext attack (IND-sID-CPA), and is also resistant to the collusion attack between the untrusted cloud and the cooperative performer. Theoretical comparison and experimental results demonstrate the practicability of our VPR-IBBE scheme, as well as the superiority over representative related works.

Secure Proxy Re-Encryption Protocol for FANETs Resistant to Chosen-Ciphertext Attacks

In emergency situations, ensuring the secure transmission of medical information is critical. While existing schemes address on-road emergencies, off-road scenarios present unique challenges due to hazardous locations inaccessible to conventional vehicles. This research introduces a protocol for off-road emergencies, leveraging flying ad hoc networks (FANETs) formed by drones. The protocol, designed for users receiving emergency treatment, employs cryptographic techniques to protect sensitive information. To overcome the challenge of decrypting user medical records at emergency centers without the healthcare provider’s key, proxy re-encryption is employed. The control center (CC) securely generates encryption and decryption keys, facilitating the re-encryption process by the cloud server (CS) and transmission to the emergency center (E). The proposed protocol, free from pairing functions, underwent security and efficiency analyses, demonstrating resilience against chosen-ciphertext attacks (CCA) and collusion resistance (CR). Execution times of approximately 0.02 and 0.0 s for re-encryption and decryption processes, respectively, for a message size of 2000 bytes highlighted the efficiency of the protocol. The research contributes a secure and efficient proxy re-encryption protocol for off-road emergency medical information transmission within FANETs.

A lightweight attribute-based signcryption scheme based on cloud-fog assisted in smart healthcare.

In the environment of big data of the Internet of Things, smart healthcare is developed in combination with cloud computing. However, with the generation of massive data in smart healthcare systems and the need for real-time data processing, traditional cloud computing is no longer suitable for resources-constrained devices in the Internet of Things. In order to address this issue, we combine the advantages of fog computing and propose a cloud-fog assisted attribute-based signcryption for smart healthcare. In the constructed "cloud-fog-terminal" three-layer model, before the patient (data owner)signcryption, it first offloads some heavy computation burden to fog nodes and the doctor (data user) also outsources some complicated operations to fog nodes before unsigncryption by providing a blinded private key, which greatly reduces the calculation overhead of resource-constrained devices of patient and doctor, improves the calculation efficiency. Thus it implements a lightweight signcryption algorithm. Security analysis confirms that the proposed scheme achieves indistinguishability under chosen ciphertext attack and existential unforgeability under chosen message attack if the computational bilinear Diffie-Hellman problem and the decisional bilinear Diffie-Hellman problem holds. Furthermore, performance analysis demonstrates that our new scheme has less computational overhead for both doctors and patients, so it offers higher computational efficiency and is well-suited for application scenarios of smart healthcare.

Fuzzy Perspective of Online Games by Using Cryptography and Cooperative Game Theory

In this paper, we mathematically associate crypto-cloud computing with cooperative game theory in the presence of fuzzy uncertainty. For this purpose, we retrieve information from the database of Amazon Web Service. Then we construct a secure crypto-cloud game theoretical model and apply this model to online games under fuzzy uncertainty. Further, we suggest some fuzzy game theoretical solutions by proposing a novel twisted Edwards curve pairing-based scheme over finite fields having the property of indistinguishable under chosen ciphertext attacks. Finally, it is seen that costs of the numerical fuzzy solutions are reduced and their efficiency is increased compared with the numerical crisp ones.

Old School, New Primitive: Toward Scalable PUF-Based Authenticated Encryption Scheme in IoT

The Internet of Things (IoT) facilitates the information exchange between people and smart devices. It needs cryptographic measures to secure its communications and interconnected objects. However, cyber-physical attacks pose a great challenge to the protection of secret keys inside. Physically Unclonable Function (PUF) is a promising hardware primitive with unclonable structures providing tamper evidence for a device. Moreover, a PUF instance has a unique set of randomized challenge-response pairs. Although it can be integrated into a security scheme to replace long-term keys, designing a dedicated PUF-based cryptographic algorithm that supports peer-to-peer communication remains a challenging field to explore. In this paper, we propose SPEAR, a scalable PUF-based authenticated encryption scheme that uses no cryptographic primitives other than PUF and hash functions. SPEAR can be deployed on peer IoT devices that have performed a handshake protocol to obtain shared credentials. Its security under the chosen ciphertext attack is formally proved using the game-playing technique, and it is still secure when attackers physically extract the credentials. In addition, we give a variant, xSPEAR, to involve associated data and avoid the nonce reuse problem. Compared to other PUF-based ciphers, it performs better in terms of storage overhead and PUF evaluation times. SPEAR first realizes scalable authenticated encryption based on PUF and can be a practical solution for IoT.

Possibility of decryption speed-up by parallel processing in CCA secure hashed ElGamal.

In order to prove the ElGamal CCA(Chosen Ciphertext Attack) security in the random oracle model, it is necessary to use the group where ICDH(Interactive Computational Diffie Hellman) assumption holds. Until now, only bilinear group with complex algebraic structure has been known as the ICDH group. In this paper, we introduce the ICDH group with simple algebraic structure. In other words, we prove that ICDH assumption holds in the integer group with composite modulus. On the basis of this, we propose the CCA secure hashed ElGamal and its fast variant to speed up decryption by parallel processing. Our parallel scheme has the fastest decryption among all CCA secure PKE(Public Key Encryption) schemes implemented in integer group and gives the possibility that ElGamal protocol could be practical when the big modulus numbers are used to resist the quantum attack.

Anonymous hierarchical identity-based encryption with delegated traceability for cloud-based data sharing systems

Cloud-based data sharing systems (DSS) have become prevalent due to their ample storage and convenient access control. To protect sensitive data privacy in DSS, anonymous identity-based encryption (IBE) is a promising approach, enabling encryption using a recipient’s identity as a public key, while preventing identity and data leaks out of ciphertexts. As complete anonymity risks abuse and illegal usage, Blazy et al. introduced the notion called anonymous IBE with traceable identities (AIBET) at ARES’19, allowing users with tracing keys to identify recipients from ciphertexts. Unfortunately, existing AIBET schemes lack tracing key delegation and only consider security in weaker models (i.e., selective-identity attacks and chosen-plaintext attacks), posing risks of inconvenience and user privacy leaks. In this paper, we introduce a novel notion called anonymous hierarchical identity-based encryption with delegated traceability (AHIBEDT) for DSS. We formalize its syntax and define security notions in stronger models (i.e., adaptive-identity attacks and chosen-ciphertext attacks). In addition, we demonstrate that a concrete AHIBEDT scheme can be simply obtained from a hierarchical IBE scheme and a one-time signature scheme. The comparison results indicate that, despite a substantial increase in communication and computational costs, our approach achieves better security and functionality.

PF-IBDA: Provably secure and pairing-free identity-based deniable authentication protocol for MANET environments

Mobile Adhoc Network (MANET) is used in various real-time applications, such as e-voting, army tactical communication, health-care applications, disaster rescue, online message exchange, etc. However, source authentication and deniability are essential properties in such applications. Typically, these properties can be achieved using a deniable authentication (DA) protocol. With the help of a DA protocol, a mobile receiver node can directly verify the source, another mobile node, of a message without consulting a trusted third party (TTP). Recently, many identity-based deniable authentication (IBDA) protocols have been proposed. Most of these protocols are insecure and computationally expensive since they use costly operations, such as bilinear pairing and map-to-point hash function. We proposed a pairing-free identity-based deniable authentication (PF-IBDA) protocol for MANET environments. We proved that the PF-IBDA protocol could provide indistinguishability against adaptive chosen ciphertext attack (IND-CCA2) in the random oracle model (ROM) based on the hardness assumption of the elliptic curve computational Diffie–Hellman (ECCDH) problem. We have computed the execution time of PF-IBDA protocol in different security levels: 80-bit, 112-bit, 128-bit, 192-bit, and 256-bit on a mobile device using the JPBC library and compared it with the state-of-the-art IBDA protocols. We found that the proposed PF-IBDA protocol is more efficient than the existing IBDA protocols.

MBP: Multi-channel broadcast proxy re-encryption for cloud-based IoT devices

The broadcast proxy re-encryption methods extend traditional proxy re-encryption mechanisms, where a single user shares the cloud data with multiple receivers. When the sender has different data to share with different sets of users, the existing broadcast proxy re-encryption schemes allow him/her to calculate distinct re-encryption keys for different groups in terms of additional computation time and overhead. To overcome these issues, we propose a scheme, named MBP, in IoT application scenario that allows the sender to calculate a single re-encryption key for all the groups of users, i.e., IoT devices. We use the multi-channel broadcast encryption concept in the broadcast proxy re-encryption method, so as single re-encryption key calculation and single re-encryption are done for different groups of IoT devices. It reduces the size of the security elements. However, it increases the computation time of the receiver IoT devices at the time of decryption of both the ciphertexts. To address this issue, we use the Rubinstein-Ståhl bargaining game approach. MBP is secure under a selective group chosen-ciphertext attack using the random oracle model. The implementation of MBP shows that it reduces the communication overhead from the data owner to the cloud server and from the cloud server to the receiver than existing algorithms.

Lightweight Privacy-Preserving Distributed Recommender System Using Tag-Based Multikey Fully Homomorphic Data Encapsulation

Recommender systems facilitate personalized service provision through the statistical analysis and model training of user historical data (e.g. user profile based on keyword searches, browsing behavior, travel history, etc). To address the underpinning privacy implications associated with such systems, a number of privacy-preserving recommendation approaches have been presented in the literature. There are, however, limitations in many of these approaches. For example, approaches that apply public key (fully) homomorphic encryption (FHE) on different users' historical rating records under a unique public key (i.e. the public key of a predefined target user requesting recommendation) incur significant computational overheads on resource-constrained local users and may not be scalable. On the other hand, approaches without utilizing public key FHE can neither resist chosen ciphertext attack (CCA), nor be straightforwardly applied to the setting of distributed servers. In this paper, a lightweight privacy-preserving distributed recommender system is proposed. Specifically, we present a new cryptographic primitive (i.e. tag-based multikey fully homomorphic data encapsulation mechanism; TMFH-DEM) designed to achieve CCA security for both input privacy and result privacy. TMFH-DEM enables a set of distributed servers to collaboratively execute efficient privacy-preserving outsourced computation on multiple inputs encrypted under different secret keys from different data owners, without using public key FHE. The authorized receiver can successfully decrypt the plaintext of the function evaluation result. Building on TMFH-DEM, we propose a lightweight privacy-preserving distributed recommender system, which flexibly returns all the recommended items with certain predicted ratings for all target users. Formal security proof shows that our proposal achieves both user historical rating data privacy and recommendation result privacy. Findings from our evaluations demonstrate its practicability in terms of scalability, recommendation accuracy, computational and communication efficiency.

Two protocols for improving security during the authentication and key agreement procedure in the 3GPP networks

In the fifth generation of cellular networks (5G), data transmission with the highest possible speed and the lowest latency is one of the most essential 5G designing criteria. Furthermore, this generation is supposed to add new applications, features, and services to mobile phone networks with a high commitment to security and privacy. Hence, primitive protocols proposed for the 5G networks generally should be able to achieve the security requirements and also have low network overheads. In this paper, we focus on improving two primitive authentication and key agreement (AKA) protocols (5G AKA and EAP-AKA’). Our two improved protocols meet the security and performance requirements along with proper compatibility with the 3GPP security architecture. The paper’s security approach is to first construct a fixed-length key derivation scheme and show that it is strongly unforgeable under the adaptive chosen-ciphertext attack. Then, we demonstrate that, unlike the 3GPP AKA protocols, the message authentication codes (MACs) and session keys used in the improved protocols are also strongly unforgeable under the adaptive chosen-ciphertext attack. Moreover, we show that the improved protocols achieve some security requirements, such as mutual authentication, secure key agreement, and forward and backward secrecy of session keys. Furthermore, we explain informally that the improved protocols achieve other security requirements, such as following the 3GPP security architecture and resistance against known attacks. Finally, we compare the improved protocols with other AKA protocols regarding communication, computational, and storage overheads. This comparison shows that the improved protocols have appropriate overheads among other AKA protocols.

Secure Equality Test Technique Using Identity-Based Signcryption for Telemedicine Systems

For telemedicine, Wireless Body Area Network (WBAN) offers enormous benefits where a patient can be remotely monitored without compromising the mobility of remote treatments. With the advent of high capacity and reliable wireless networks, WBANs are used in several remote monitoring systems, limiting the COVID-19 spread. The sensitivity of telemedicine applications mandates confidentiality and privacy requirements. In this paper, we propose a secure WBAN-19 telemedicine system to overcome the pervasiveness of contagious deceases utilizing a novel aggregate identity-based signcryption scheme with an equality test feature. We demonstrate a security analysis regarding indistinguishable adaptive chosen-ciphertext attack (IND-CCA2), one-way security against adaptive chosen-ciphertext attack (OW-CCA2), and unforgeability against adaptive chosen-message attack (EUF-CMA) under the random oracle model. The security analysis of the scheme is followed by complexity evaluations where the computation cost and communication overhead are measured. The evaluation demonstrates that the proposed model is efficient and applicable in telemedicine systems with high-performance capacities.