CONSTRUCTION OF LATTICE-BASED VECTOR COMMITMENTS FOR VERKLE STRUCTURES

2026

Full text Open access: Gold Metadata (CSL-JSON)
DOI 10.56132/2791-3368-2026-2-66-75-85
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

This paper addresses the problem of constructing post-quantum authenticated data structures for secure distributed information systems operating under potential quantum and cyber threats. The primary focus is on the development of a Verkle tree based on lattice vector commitments, providing compact proof structures, support for local updates, and resistance to quantum attacks. Particular attention is given to the local update propagation mechanism, which enables modification of commitments and proofs without full recomputation of the tree. The proposed approach reduces computational overhead during data updates and improves the efficiency of distributed storage systems operating under limited computational resources and unstable communication channels. The proposed scheme can be applied in secure distributed storage systems, cyber defense infrastructures, and protected communication environments requiring post-quantum security guarantees.