Abstract:

The Authenticated Distributed Data Structures Model (ADDSM) is proposed as an extension of the Authenticated Data Structures (ADS) model to address issues such as the ADS model’s lack of composability and its inability to support complex data combination operations. However, previous approaches suffer from incomplete theoretical descriptions, a lack of data persistence solutions, and an absence of confidentiality protection. To address this challenge, this paper proposed a new composable authenticated distributed data structure model (NC-ADDSM). Firstly, this paper provided a complete theoretical description of the model, including its formal definition, property descriptions, and security definitions. Secondly, this paper designed algorithms for initialization, data insertion, data query, data verification, and data persistence to build the NC-ADDSM. Finally, this paper proposed communication protocols that supported data update and query verification, ensuring that only entities possessing the decryption key can access plaintext data. Theoretical analysis and experimental results show that the proposed model maintains security while exhibiting high execution efficiency.

Key words: distributed systems, authenticated data structures, data persistence, confidentiality