Provably Secure Linearly Homomorphic Aggregate Signature Scheme for Electronic Healthcare System

Gu, Yong; Shen, Limin; Zhang, Futai; Xiong, Jinbo

doi:10.3390/math10152588

Cited by 9 publications

(6 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the field of medical data, FHE also plays an important role not only in preventing attackers from obtaining user identity tags but also in providing high efficiency in data integration between sensors and server [36]. Gu et al [37] proposed an aggregate signature scheme based on a linearly homomorphic signature for electronic healthcare systems which realizes double data compression. The application of the homomorphic signature mechanism in medical data deserves the attention of cryptographers.…”

Section: Discussionmentioning

confidence: 99%

Concise and Efficient Multi-Identity Fully Homomorphic Encryption Scheme

Tu,

Liu,

Zhou

et al. 2024

IEEE Access

View full text Add to dashboard Cite

Combining multi-key fully homomorphic encryption (MKFHE) and identity-based encryption (IBE) to construct multi-identity based fully homomorphic encryption (MIBFHE) scheme can not only realize homomorphic operations and flexible access control on identity ciphertexts but also reduce the burden of public key certification management. However, MKFHE schemes used to construct MIBFHE usually have complex construction and large computational complexity, which also causes the same problem for MIBFHE schemes.To solve this problem, we construct a concise and efficient MIBFHE scheme based on the learning with errors (LWE) problem. Firstly, we construct an MKFHE scheme using a new method called "the decomposition method". Secondly, we make an appropriate deformation of the current IBE scheme. Finally, we combine the above MKFHE scheme with IBE scheme to construct our MIBFHE scheme and prove its IND-sID-CPA security under the LWE assumption in the random oracle model. The analysis results show that our MIBFHE scheme can generate the extended ciphertext directly from the encryption algorithm, without generating fresh ciphertext in advance. In addition, the noise expansion rate is reduced from the polynomial of lattice dimension n and modulus q to the constant K of the maximum number of users. The scale of introduced auxiliary ciphertexts is reduced from 44 () O n L to 24 () O n L when generating the extended ciphertext.

show abstract

Section: Discussionmentioning

confidence: 99%

Concise and Efficient Multi-Identity Fully Homomorphic Encryption Scheme

Tu,

Liu,

Zhou

et al. 2024

IEEE Access

View full text Add to dashboard Cite

show abstract

“…This restricts the agency's ability to sign. Second, fully homomorphic signatures from standard lattices provide a new identity-based homomorphic trapdoor function (IBHTDF), which is claw-free and collision-resistant [53][54][55]. Moreover, a homomorphic algorithm for the new IBHTDF was found where the noise level of the multiplication gate is the same as that of the addition gate.…”

Section: Homomorphic Signaturesmentioning

confidence: 99%

A Lightweight Identity-Based Network Coding Scheme for Internet of Medical Things

Wang,

Song,

Bian

et al. 2024

Electronics

View full text Add to dashboard Cite

Network coding is a potent technique extensively utilized in decentralized Internet of Things (IoT) systems, including the Internet of Medical Things (IoMT). Nevertheless, the inherent packet-mixing characteristics of network coding expose data transmission to pollution attacks, potentially compromising the integrity of original files. The homomorphic signature scheme serves as a robust cryptographic tool that can bolster network coding’s resilience against such attacks. However, current schemes are computationally intensive for signature verification, making them impractical for IoMT environments. In this study, we propose a lightweight identity-based network coding scheme (IBNS) that minimizes computational overhead during the signing and verification processes. This scheme has been demonstrated to be secure against adaptive chosen-message attacks and is well-suited for IoMT applications. Furthermore, we assess the performance of our IBNS through both theoretical and experimental analyses. Simulation outcomes confirm that our scheme outperforms previous ones in terms of practicality and efficiency.

show abstract

“…The proposed lightweight PKI can be used to secure IoT and WSN devices in a variety of industries, such as healthcare, industrial, transportation, and smart cities. An aggregate signature technique based on a linearly homomorphic signature for resource constrained electronic healthcare system has been proposed in [24]. By combining the advantages of aggregate signature and linearly homomorphic signature, this method offers benefits from both.…”

Section: Introductionmentioning

confidence: 99%

A Distance Vector Hop-Based Secure and Robust Localization Algorithm for Wireless Sensor Networks

et al. 2023

View full text Add to dashboard Cite

Location information of sensor nodes in a wireless sensor network is important. The sensor nodes are usually required to ascertain their positions so that the data collected by these nodes can be labeled with this information. On the other hand, certain attacks on wireless sensor networks lead to the incorrect estimation of sensor node positions. In such situations, when the location information is not correct, the data may be labeled with wrong location information that may subvert the desired operation of the wireless sensor network. In this work, we formulate and propose a distance vector hop-based algorithm to provide secure and robust localization in the presence of malicious sensor nodes that result in incorrect position estimation and jeopardize the wireless sensor network operation. The algorithm uses cryptography to ensure secure and robust operation in the presence of adversaries in the sensor network. As a result of the countermeasures, the attacks are neutralized and the sensor nodes are able to estimate their positions as desired. Our secure localization algorithm provides a defense against various types of security attacks, such as selective forwarding, wormhole, Sybil, tampering, and traffic replay, compared with other algorithms which provide security against only one or two types. Simulation experiments are performed to evaluate the performance of the proposed method, and the results indicate that our secure localization algorithm achieves the design objectives successfully. Performance of the proposed method is also compared with the performance of basic distance vector hop algorithm and two secure algorithms based on distance vector hop localization. The results reveal that our proposed secure localization algorithm outperforms the compared algorithms in the presence of multiple attacks by malicious nodes.

show abstract

Provably Secure Linearly Homomorphic Aggregate Signature Scheme for Electronic Healthcare System

Cited by 9 publications

References 40 publications

Concise and Efficient Multi-Identity Fully Homomorphic Encryption Scheme

Concise and Efficient Multi-Identity Fully Homomorphic Encryption Scheme

A Lightweight Identity-Based Network Coding Scheme for Internet of Medical Things

A Distance Vector Hop-Based Secure and Robust Localization Algorithm for Wireless Sensor Networks

Contact Info

Product

Resources

About