EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC-ND 4.0

Verifiable geometric homomorphic secret sharing for outsourced polynomial evaluations

Minghao Yang, Liang Feng Zhang

Journal of King Saud University Computer and Information Sciences · 2026-08 · 38 (6)

DOI: 10.1007/s44443-026-00903-3 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of King Saud University Computer and Information Sciences, online erschienen am 05.06.2026. Verfasst von Minghao Yang und 1 weiteren Autor:innen. Die Arbeit nennt 51 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Homomorphic Secret Sharing (HSS) enables a client to outsource the evaluation of a function f on a private input x\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textbf{x}$$\end{document} to multiple servers. While Shamir’s Secret Sharing (SSS)-based HSS offers notable scalability and efficiency, existing constructions predominantly operate under the semi-honest assumption. Within SSS-based architectures, existing verifiable schemes against malicious servers are highly restricted, typically limited to evaluating homogeneous polynomials over Boolean inputs. In this paper, we formalize Verifiable Information-Theoretic HSS (vIT-HSS) as a standalone primitive that provides both unconditional privacy and unconditional verifiability against malicious servers. We propose a k-server construction that is t-private and t-secure for arbitrary constant-free multivariate polynomials over any finite field. The scheme ensures that any t colluding servers learn nothing about the input and cannot cause the client to accept incorrect results, tolerating up to t

Zitieren

APA

Yang, M., & Zhang, L. F. (2026). Verifiable geometric homomorphic secret sharing for outsourced polynomial evaluations. Journal of King Saud University Computer and Information Sciences, 38(6). https://doi.org/10.1007/s44443-026-00903-3

Vancouver

Yang M, Zhang LF. Verifiable geometric homomorphic secret sharing for outsourced polynomial evaluations. Journal of King Saud University Computer and Information Sciences. 2026;38(6). doi:10.1007/s44443-026-00903-3

BibTeX
@article{Yang2026,
  author = {Yang, Minghao and Zhang, Liang Feng},
  title = {Verifiable geometric homomorphic secret sharing for outsourced polynomial evaluations},
  journal = {Journal of King Saud University Computer and Information Sciences},
  year = {2026},
  volume = {38},
  number = {6},
  doi = {10.1007/s44443-026-00903-3}
}
Kostenlos starten →