|
A Lattice-based Polynomial Commitment Scheme with Distributed Prover
|
Mohammad Sadegh Ahmadi1   , Taraneh Eghlidos *1 |
| 1- Sharif University of Technology |
|
|
Abstract: (20 Views) |
Polynomial commitment schemes are among the fundamental cryptographic primitives, playing a significant role in verifiable computation and non-interactive proof systems. Due to their resistance to quantum attacks on the one hand and their favorable efficiency on the other hand, lattice-based polynomial commitment schemes have attracted considerable attention. One of the main challenges in these schemes is the high computational overhead on the prover side. This issue limits their applicability in Internet of Things (IoT) environments, where computational resources are constrained. In this paper, we demonstrate that the efficiency of a lattice-based polynomial commitment scheme can be improved using a distributed prover approach. Based on our theoretical analysis, the computational overhead of the main prover is reduced by approximately 94%. Furthermore, the computational overhead of each subordinate prover is about 0.3% of that of a centralized prover. We also show that the proposed scheme satisfies the security properties of completeness and knowledge soundness.
|
|
| Keywords: polynomial commitment scheme, verifiable computation, lattice-based cryptography, distributed computation |
|
|
Full-Text [PDF 1128 kb]
(12 Downloads)
|
Type of Study: Research Article |
Subject:
Cryptology and Information Security
Received: 2026/05/8 | Accepted: 2026/09/18 | Published: 2026/09/20
|
|
|
|
|
|
|
| Send email to the article author |
|
|
|
| Add your comments about this article |
|
|
|
