EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Identity-based linear homomorphic signature for a restricted combiners’ group for e-commerce

Yuan Tian, Weitao Song, Tanping Zhou, Bin Hu, Xuan Zhou iD, Yujie Ding, Weidong Zhong, Xiaoyuan Yang

PeerJ Computer Science · 04.08.2025 · 11 · e3068

DOI: 10.7717/peerj-cs.3068 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PeerJ Computer Science, online erschienen am 04.08.2025. Verfasst von Yuan Tian und 7 weiteren Autor:innen. Beteiligte Einrichtung: Information Engineering University, Zhengzhou, Henan, China. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 43 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Cryptologic Science Fund of China, National Key R&D Program of China, National Natural Science Foundation of China.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

As the volume of electronic transaction data increases and the demand for real-time processing grows, network coding techniques have become popular for improving performance. However, early implementations often overlooked critical data security issues, such as forgery and data leakage. While existing homomorphic signature schemes effectively ensure data integrity, they can unintentionally allow malicious actors to exploit intermediate signatures. This misuse can lead to unnecessary bandwidth consumption and hinder the verification processes for legitimate users. To address the problem of malicious combinations, we apply the Chinese Remainder theorem (CRT) to establish a layer of secret-sharing that restricts access to authorized users in conjunction with homomorphic signatures. Furthermore, we introduce a formal definition for an identity-based linear homomorphic signature for a restricted combiners’ group (IBLHS-RCG). This framework integrates linear homomorphic signatures with the CRT within the context of e-commerce, enabling us to develop a specialized scheme for IBLHS-RCG. We demonstrate that our scheme is unforgeable against adaptive chosen-message attacks. Additionally, simulations conducted using the Python Pairing-based Cryptography Library (PYPBC) show that the signing and verification costs of our approach are low.

Schlagwörter

Stichwörter der Autor:innen

Homomorphic signatureIdentity-based linear homomorphic signatureNetwork coding

Autor:innen und Institutionen

  • Information Engineering University, Zhengzhou, Henan, China.
  • Chinese People's Armed Police Force Engineering University, Xi'an, Shaanxi, China.

ORCID-Profile: Xuan Zhou

Förderung

  • National Cryptologic Science Fund of China
  • National Key R&D Program of China
  • National Natural Science Foundation of China
  • Natural Science Foundation of Shaanxi Province

Zitieren

APA

Tian, Y., Song, W., Zhou, T., Hu, B., Zhou, X., Ding, Y., Zhong, W., & Yang, X. (2025). Identity-based linear homomorphic signature for a restricted combiners’ group for e-commerce. PeerJ Computer Science, 11, e3068. https://doi.org/10.7717/peerj-cs.3068

Vancouver

Tian Y, Song W, Zhou T, Hu B, Zhou X, Ding Y, et al. Identity-based linear homomorphic signature for a restricted combiners’ group for e-commerce. PeerJ Computer Science. 2025;11:e3068. doi:10.7717/peerj-cs.3068

BibTeX
@article{Tian2025,
  author = {Tian, Yuan and Song, Weitao and Zhou, Tanping and Hu, Bin and Zhou, Xuan and Ding, Yujie and Zhong, Weidong and Yang, Xiaoyuan},
  title = {Identity-based linear homomorphic signature for a restricted combiners’ group for e-commerce},
  journal = {PeerJ Computer Science},
  year = {2025},
  volume = {11},
  pages = {e3068},
  doi = {10.7717/peerj-cs.3068}
}
Kostenlos starten →