Article · The Proceeding Bulletin MILF · June 30, 2026
CONSTRUCTION OF LATTICE-BASED VECTOR COMMITMENTS FOR VERKLE STRUCTURES
Kunbolat T. Algazy, Alimzhan Yerkebulan, Kairat Sakan
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.
More by Kairat Sakan
- Design of a New Lightweight Hash Function FLUX-128 and Experimental Evaluation of Its Diffusion and Statistical PropertiesComputers · 2026
- VERKLE АҒАШТАРЫНА АРНАЛҒАН ТОРЛЫҚ ВЕКТОРЛЫҚ МІНДЕТТЕМЕЛЕРNEWS OF THE NATIONAL ACADEMY OF SCIENCES OF THE REPUBLIC OF KAZAKHSTAN · 2026
- VERKLE АҒАШЫНА НЕГІЗДЕЛГЕН ЦИФРЛЫҚ ҚОЛТАҢБАНЫҢ ТИІМДІЛІГІН БАҒАЛАУ ЖӘНЕ САЛЫСТЫРМАЛЫ ТАЛДАУ ЖҮРГІЗУВестник Академии гражданской авиации · 2026
- СЫЗЫҚСЫЗ ТҮЙІН S-БЛОК ҮШІН ИЗОМОРФТЫ S-БЛОКТЫ АЛУ ӘДІСТЕРІ ЖӘНЕ ОЛАРҒА САЛЫСТЫРМАЛЫ КРИПТОГРАФИЯЛЫҚ ТАЛДАУЛАР ЖҮРГІЗУВестник КазАТК · 2026
