EUVIMEDEUVIMED entdecken
Crossref

A Verifiable Multi-Secret Sharing Scheme Based on ℓ-Intersection Pair of Cyclic Codes

Md Ajaharul Hossain, Ramakrishna Bandi

International Journal of Foundations of Computer Science · 2024-12 · 35 (08) · 929-948

DOI: 10.1142/s0129054123500284 ↗

Kurz gefasst

Fachartikel in der Zeitschrift International Journal of Foundations of Computer Science, online erschienen am 29.11.2023. Verfasst von Md Ajaharul Hossain und 1 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 35 Literaturangaben. Gefördert von: National Board for Higher Mathematics.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A verifiable multi-secret sharing (VMSS) scheme addresses various security issues, helping in cheating detection and cheater identification. The dimension of the intersection of a given pair of cyclic codes over a finite field [Formula: see text] is represented by [Formula: see text]. In this paper, we propose a VMSS scheme based on an [Formula: see text]-intersection pair of cyclic codes. The proposed scheme is very useful for sharing a large number of secrets. If [Formula: see text] is the number of secrets in a threshold [Formula: see text] scheme, then for [Formula: see text], the computational complexity and the public values required in the reconstruction phase are much less compared to many existing schemes in the literature. Overall, the proposed scheme comprises nearly all the features, like being verifiable, testing participants’ integrity, checking Verifier frauds, and most importantly, it is of multi-use type.

Förderung

  • National Board for Higher Mathematics

Zitieren

APA

Hossain, M. A., & Bandi, R. (2024). A Verifiable Multi-Secret Sharing Scheme Based on ℓ-Intersection Pair of Cyclic Codes. International Journal of Foundations of Computer Science, 35(08), 929-948. https://doi.org/10.1142/s0129054123500284

Vancouver

Hossain MA, Bandi R. A Verifiable Multi-Secret Sharing Scheme Based on ℓ-Intersection Pair of Cyclic Codes. International Journal of Foundations of Computer Science. 2024;35(08):929-948. doi:10.1142/s0129054123500284

BibTeX
@article{Hossain2024,
  author = {Hossain, Md Ajaharul and Bandi, Ramakrishna},
  title = {A Verifiable Multi-Secret Sharing Scheme Based on ℓ-Intersection Pair of Cyclic Codes},
  journal = {International Journal of Foundations of Computer Science},
  year = {2024},
  volume = {35},
  number = {08},
  pages = {929--948},
  doi = {10.1142/s0129054123500284}
}
Kostenlos starten →