NTRU-Based Fully Homomorphic Signature

Li, Ruonan; Wang, Fuqun; Zhang, Renjun; Chen, Kefei

doi:10.1155/2022/9942717

Cited by 5 publications

(4 citation statements)

References 36 publications

(45 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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%

See 1 more Smart Citation

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

Section: Homomorphic Signaturesmentioning

confidence: 99%

“…In addition, we compare the performance differences between different schemes in the Extract-Private-Key Phase. We select the private key generation schemes of Li's [53] and Qiu's [56] schemes and compare the time cost. Our default key length is 256 bits.…”

Section: Extract-private-key Phasementioning

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

show abstract

“…It is worth pointing out that the homomorphic multiplication is difficult to work out as we must encrypt each element of the signature matrix, resulting in the FHSC scheme is not practical. It may be possible to improve the efficiency of the scheme by utilizing other FHSes [6], [7], [8], [9] and FHEs [10], [11], [12], [13], however this must overcome the difficulties of homomorphic multiplication.…”

Section: A Contributionmentioning

confidence: 99%

“…Afterwards, Tsabary [6] testified the equivalence between the homomorphic signature and attributebased signature. Li et al [9] built an NTRU-Based FHS scheme. Then Wang et al [15] designed a leveled stronglyunforgeable identity-based fully homomorphic signature (IBFHS) scheme in 2015.…”

Section: Related Workmentioning

confidence: 99%

Leveled Fully Homomorphic Signcryption From Lattices

et al. 2023

Self Cite

View full text Add to dashboard Cite

With the continuous and rapid development of Cloud Computing, Big Data and Internet of Things, it is extremely critical to protect data with homomorphism, privacy and integrity. For this, Rezaeibagha et al. proposed a new cryptographic primitive, called homomorphic signcryption. However, the current homomorphic signcryption schemes either only support linear computation or are built on nonstandard assumption. Therefore, it is interesting to design a leveled fully homomorphic signcryption (FHSC) scheme from the standard assumption. In this work, we present a leveled FHSC scheme from lattices. For this, we exert classical sign-then-encrypt method and surmount the difficulty of homomorphic multiplicative evaluation in the way of encrypting every elements. Moreover, we prove its indistinguishability against chosen plaintext attacks (IND-CPA) and strong unforgeability (SUF) under hard problems of standard lattices.INDEX TERMS Fully homomorphic signcryption, learning with errors, short integer solution.

show abstract

A Publicly Verifiable Leveled Fully Homomorphic Signcryption Scheme

Bian,

Wang,

Zhang

et al. 2023

IET Information Security

View full text Add to dashboard Cite

With the deepening of research, how to construct a fully homomorphic signcryption scheme based on standard assumptions is a problem that we need to solve. For this question, recently, Jin et al. proposed a leveled fully homomorphic signcryption scheme from standard lattices. However, when verifying, it is supposed to unsigncrypt first as they utilize sign-then-encrypt method. This leads to users being unable to verify the authenticity of the data first, which resulting in the waste of resources. This raises another question of how to construct an fully homomorphic signcryption (FHSC) scheme with public verifiability. To solve this problem, we propose a leveled fully homomorphic signcryption scheme that can be publicly verified and show its completeness, IND-CPA security, and strong unforgeability.

show abstract

NTRU-Based Fully Homomorphic Signature

Cited by 5 publications

References 36 publications

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

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

Leveled Fully Homomorphic Signcryption From Lattices

A Publicly Verifiable Leveled Fully Homomorphic Signcryption Scheme

Contact Info

Product

Resources

About