Metraipolis › archive › dc_bb5f4759c86a

Cryptanalysis of a Class of Ideal Secret Sharing Schemes Based on the CRT for Polynomial Rings — arXiv:2610.06312

Source
arXiv
Original
https://arxiv.org/abs/2610.06312
License (as archived)
CC0-1.0
Archived
2026-10-06T05:29:57.808Z
SHA-256 of the archived text
77ed81faa9110f18cb8fa1cbba26ad71a850f72380b4f2c9370734866d81a1e3
Stable URL of this page
https://metraipolis.com/documento/dc_bb5f4759c86a

How to cite

Cryptanalysis of a Class of Ideal Secret Sharing Schemes Based on the CRT for Polynomial Rings — arXiv:2610.06312 — arXiv, https://arxiv.org/abs/2610.06312 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bb5f4759c86a (Metraipolis archive dc_bb5f4759c86a, sha256 77ed81faa9110f18cb8fa1cbba26ad71a850f72380b4f2c9370734866d81a1e3)
BibTeX
@misc{dcbb5f4759c86a,
  title = {Cryptanalysis of a Class of Ideal Secret Sharing Schemes Based on the CRT for Polynomial Rings — arXiv:2610.06312},
  howpublished = {arXiv},
  url = {https://arxiv.org/abs/2610.06312},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bb5f4759c86a; sha256 77ed81faa9110f18cb8fa1cbba26ad71a850f72380b4f2c9370734866d81a1e3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.06312. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Based on the CRT for polynomial rings, Yang, Zhu, Fu and Xia (ISIT 2026) proposed a compartmented secret sharing scheme for the compartmented access structure with lower bounds, claiming it can be ideal. We exhibit three families of unauthorized subsets that reconstruct the secret. The scheme is therefore insecure, except for a degenerate choice of parameters in which the only authorized subset is the whole participant set. The flaw in the security analysis is that it does not take all published polynomials into account. Similar flaws appear in the same first author's hierarchical schemes (ISIT 2024, 2026).

Tema degli esploratori: fiducia digitale e crittografia (elenco arXiv cs.CR, nuovi lavori del giorno).
Categorie arXiv: Cryptography and Security (cs.CR) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.06312 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T05:26:35.371Z dalla pagina https://arxiv.org/list/cs.CR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).