Publicly Verifiable Polynomial Outsourcing Computation based on Secret Sharing

Outsourced computation allows clients with limited computational resources to offload function-based computations to more powerful but potentially untrusted servers.In this context, secret sharing can be used to protect the privacy of input data.Verifiable secret sharing, on the other hand, allows participants to verify the correctness of the results returned by the server, thus enhancing the security and reliability of the process.However, existing verifiable homomorphic secret sharing schemes have several limitations, including low computational efficiency, lack of public verifiability, and poor compactness.To address these issues, we propose a public-verifiable polynomial outsourced computation scheme based on secret sharing, which improves efficiency and allows users to publicly verify the results through secret sharing and verification techniques.The proposed scheme offers the following advantages: 1) it eliminates the need to encrypt secret shares, and improves computational efficiency; 2) it ensures public verifiability of the computation results.

Authors

Institutions

Publication Details

Published
2024-12-27
DOI
https://doi.org/10.1145/3731867.3731887
Citations
1
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Publicly Verifiable Polynomial Outsourcing Computation based on Secret Sharing

Fengyin Li, Zhang Ji-tao, Chen Zhang, Yuhong Sun et al.
1 citations
Cryptography and Data Security
0.35
article

Publicly Verifiable Polynomial Outsourcing Computation based on Secret Sharing

Fengyin Li, Zhang Ji-tao, Chen Zhang, Yuhong Sun, Yining Liu
article en
1 citations

Abstract

Outsourced computation allows clients with limited computational resources to offload function-based computations to more powerful but potentially untrusted servers.In this context, secret sharing can be used to protect the privacy of input data.Verifiable secret sharing, on the other hand, allows participants to verify the correctness of the results returned by the server, thus enhancing the security and reliability of the process.However, existing verifiable homomorphic secret sharing schemes have several limitations, including low computational efficiency, lack of public verifiability, and poor compactness.To address these issues, we propose a public-verifiable polynomial outsourced computation scheme based on secret sharing, which improves efficiency and allows users to publicly verify the results through secret sharing and verification techniques.The proposed scheme offers the following advantages: 1) it eliminates the need to encrypt secret shares, and improves computational efficiency; 2) it ensures public verifiability of the computation results.

Qufu Normal University (CN)
Openalex Percentile: Top 29%
Cryptography and Data Security
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Publicly Verifiable Polynomial Outsourcing Computation based on Secret Sharing — Fengyin Li, Zhang Ji-tao, et al. · (2024) | TGRS Research Map | TGRS