Revocable identity-based fully homomorphic signature scheme with signing key exposure resistance

Xie, Congge; Weng, Jian; Zhou, Dehua

doi:10.1016/j.ins.2022.02.027

Cited by 8 publications

(3 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As shown in "Con.1+ [30,31]," "Con.1+ [30]" and "Con.3+ [30,31]," we then used the technique of [30] and the lattice basis delegation [31] to reduce the size of the signature as well as the system master key to a constant size. |sk I D |( °Zm×m ) |uk t |( °Zm×m ) |S|( °Zm q ) XWW20 [13] O(l) O( 1) O(L) O(1) XWW20 [14] O(l) O( 1) O(L) O(1) XWZ22 [15] O(l) O( 1) O(L) O(1) Con.1+ [28,29] O(l + log T) O(log T) O(L) O(l) Con.1+ [30,31] O( 1) O(log T) O(L) O(1) Con.2+ [28] O(l + log T) O(log T) O(L) O(l + log T) Con.2+ [30] O( 1) O(log T) O(L) O(1) Con.3+ [28,29] O(l + log T) O(log T) O(L) O(l) Con.3+ [30,31] O( 1) O(log T) O(L) O(1)…”

Section: Comparisonmentioning

confidence: 99%

“…Later in the same year, Xie et al [14] proposed a scheme that can resist the exposure of the signature key. As recently as 2022, Xie et al [15] proposed a fully homomorphic RIBS (RIBFHS) scheme, which is homomorphic and is the frst RIBFHS scheme that considers signature key exposure on lattices. However, its security only is sID-EU-CMA and forward security cannot be guaranteed.…”

Section: Introductionmentioning

confidence: 99%

“…Subsequently, Wei et al [16] introduced a RIBS scheme based on the NTRU lattice that the update key can be updated on the open channel. In the next few years, Xie et al [13][14][15] proposed some RIBS schemes. Tese schemes all improve the security of the scheme in some cases.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Generic Construction of Forward-Secure Revocable Identity-Based Signature and Lattice-Based Instantiations

Qin

Gao

et al. 2022

Security and Communication Networks

View full text Add to dashboard Cite

Forward-secure revocation is a powerful cryptographic technique to alleviate key exposure attacks on identity-based cryptosystems. In recent years, quantum computers have made some breakthroughs, so in the foreseeable future, existing cryptographic systems will be subject to quantum attacks. However, known forward-secure revocable identity-based signature (FS-RIBS) schemes were designed over bilinear pairing groups and may suffer from quantum computing attacks. To address this issue, this paper proposes a generic method to construct FS-RIBS schemes, taking (hierarchical) IBS schemes as a basic component. By instantiating it with some post-quantum (hierarchical) IBS schemes, e.g., lattice-based (hierarchical) IBS, we immediately obtain six FS-RIBS schemes under the hardness of the small integer solution problem, which is secure against quantum computing attacks.

show abstract