Lightweight certificateless linearly homomorphic network coding signature scheme for electronic health system

Li, Yumei; Zhang, Futai; Sun, Yinxia

doi:10.1049/ise2.12011

Cited by 6 publications

(4 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although certificate management is simplified, key escrow issues are introduced. In response to this problem, researchers have successively proposed certificateless LHS [20,21]. Recently, multi-key HS has attracted attention [22][23][24][25][26][27][28][29].…”

Section: Related Workmentioning

confidence: 99%

A Linear Homomorphic Proxy Signature Scheme Based on Blockchain for Internet of Things

Wang¹,

Wu²

2023

Computer Modeling in Engineering &Amp; Sciences

View full text Add to dashboard Cite

The mushroom growth of IoT has been accompanied by the generation of massive amounts of data. Subject to the limited storage and computing capabilities of most IoT devices, a growing number of institutions and organizations outsource their data computing tasks to cloud servers to obtain efficient and accurate computation while avoiding the cost of local data computing. One of the most important challenges facing outsourcing computing is how to ensure the correctness of computation results. Linearly homomorphic proxy signature (LHPS) is a desirable solution to ensure the reliability of outsourcing computing in the case of authorized signing right. Blockchain has the characteristics of tamper-proof and traceability, and is a new technology to solve data security. However, as far as we know, constructions of LHPS have been few and far between. In addition, the existing LHPS scheme does not focus on homomorphic unforgeability and does not use blockchain technology. Herein, we improve the security model of the LHPS scheme, and the usual existential forgery and homomorphic existential forgery of two types of adversaries are considered. Under the new model, we present a blockchain-based LHPS scheme. The security analysis shows that under the adaptive chosen message attack, the unforgeability of the proposed scheme can be reduced to the CDH hard assumption, while achieving the usual and homomorphic existential unforgeability. Moreover, compared with the previous LHPS scheme, the performance analysis shows that our scheme has the same key size and comparable computational overhead, but has higher security.

show abstract

Section: Related Workmentioning

confidence: 99%

A Linear Homomorphic Proxy Signature Scheme Based on Blockchain for Internet of Things

Wang¹,

Wu²

2023

Computer Modeling in Engineering &Amp; Sciences

View full text Add to dashboard Cite

show abstract

“…With the development of IoT technology, more and more electronic healthcare systems apply this technology, which makes wireless smart healthcare treatment possible. At present, many various electronic healthcare systems have been proposed [9][10][11][12][13][14][15][16][17][18]. A typical EHS model is shown in Figure 1.…”

Section: Related Workmentioning

confidence: 99%

“…proposed a lightweight certificateless linearly homomorphic network coding signature scheme for EHS [9] which required a relatively low computational cost to sign and verify data packets. However, when the scale of the EHS is too large, the Medical-Server needs to verify the message signature from each patient one by one, which will inevitably increase the storage cost and bandwidth burden of the EHS.…”

Section: Related Workmentioning

confidence: 99%

Provably Secure Linearly Homomorphic Aggregate Signature Scheme for Electronic Healthcare System

Shen

Zhang

et al. 2022

Mathematics

Self Cite

View full text Add to dashboard Cite

In recent years, deploying Internet of Things (IoT) in electronic healthcare systems (EHS) has made great progress in healthcare detection. It is extremely important to reduce the cost of communication and ensure the authenticity and integrity of data. A linearly homomorphic signature scheme can solve the above problems. However, when the scale of EHS is too large, the transmission, storage and verification of signatures need a high cost. An aggregate signature can combine many signatures generated by many different users into a short one. Therefore, only one aggregate signature needs to be processed during verification, transmission and storage. Combining the advantages of aggregate signature and linearly homomorphic signature, this paper proposes an aggregate signature scheme based on a linearly homomorphic signature for EHS, which has both linear homomorphism and aggregation, and realizes double data compression. Moreover, our scheme can resist a potential real attack, named a coalition attack. The security of this scheme is rigorously demonstrated based on the computational Diffie–Hellman assumption in the random oracle model.

show abstract

“…Among them, the linearly homomorphic signature (LHS) ( Attrapadung, Libert & Peters, 2013 ) can well resist pollution attacks in network coding because it supports linear homomorphic operations on messages ( Zhao et al, 2007 ; Charles, Jain & Lauter, 2006 ; Yu et al, 2008 ; Yun, Cheon & Kim, 2010 ). With the development of homomorphic signature technology, LHS has also been used in scenarios such as electronic health systems ( Li, Zhang & Sun, 2021 ), blockchain ( Lin et al, 2018 ), and the Internet of Things (IoT) ( Li, Zhang & Liu, 2020 ).…”

Section: Introductionmentioning

confidence: 99%

A structure-preserving linearly homomorphic signature scheme with designated combiner

Zhou,

Tian,

Zhong

et al. 2024

PeerJ Computer Science

View full text Add to dashboard Cite

Linearly homomorphic signature (LHS) allows the acquisition of a new legal signature using the homomorphic operation of the original signatures. However, the public composability of LHS also prevents it from being used in some scenarios where the combiner needs to be designated. The LZZ22 scheme designates a combiner and preserves the signature structure by having the signer and the designated combiner share a secret. However, LZZ22 is not secure enough because the secret is constant. Here, we first prove that there is a polynomial time adversary that can crack the secret in LZZ22 through multiple signature queries. Then, we propose a new scheme, which realizes all the functions of LZZ22 and fixes the security problem by changing the secret with the message. The proposed scheme is shown to be secure against existential forgery on adaptively chosen subspace attacks under the random oracle model. Finally, we detail how to apply our scheme to the proxy signature and perform it on a personal computer, and the results show that our scheme is efficient.

show abstract

Lightweight certificateless linearly homomorphic network coding signature scheme for electronic health system

Cited by 6 publications

References 33 publications

A Linear Homomorphic Proxy Signature Scheme Based on Blockchain for Internet of Things

A Linear Homomorphic Proxy Signature Scheme Based on Blockchain for Internet of Things

Provably Secure Linearly Homomorphic Aggregate Signature Scheme for Electronic Healthcare System

A structure-preserving linearly homomorphic signature scheme with designated combiner

Contact Info

Product

Resources

About