Efficient and Universal Merkle Tree Inclusion Proofs via OR Aggregation
-
Published:2024-07-05
Issue:3
Volume:8
Page:28
-
ISSN:2410-387X
-
Container-title:Cryptography
-
language:en
-
Short-container-title:Cryptography
Author:
Kuznetsov Oleksandr123ORCID, Rusnak Alex1ORCID, Yezhov Anton1, Kanonik Dzianis1ORCID, Kuznetsova Kateryna1, Domin Oleksandr1ORCID
Affiliation:
1. Proxima Labs, 1501 Larkin Street, Suite 300, San Francisco, CA 94109, USA 2. Faculty of Engineering, eCampus University, Via Isimbardi 10, 22060 Novedrate, Italy 3. Department of Information and Communication Systems Security, V. N. Karazin Kharkiv National University, 4 Svobody Sq., 61022 Kharkiv, Ukraine
Abstract
Zero-knowledge proofs have emerged as a powerful tool for enhancing privacy and security in blockchain applications. However, the efficiency and scalability of proof systems remain a significant challenge, particularly in the context of Merkle tree inclusion proofs. Traditional proof aggregation techniques based on AND logic suffer from a high verification complexity and data communication overhead, limiting their practicality for large-scale applications. In this paper, we propose a novel proof aggregation approach based on OR logic, which enables the generation of compact and universally verifiable proofs for Merkle tree inclusion. By adapting and extending the concept of OR composition from Sigma protocols, we achieve a proof size that is independent of the number of leaves in the tree, and verification can be performed using any single valid leaf hash. This represents a significant improvement over AND aggregation, which requires the verifier to process all leaf hashes. We formally define the OR aggregation logic; describe the process of generating universal proofs; and provide a comparative analysis that demonstrates the advantages of our approach in terms of proof size, verification data, and universality. Furthermore, we discuss the potential of combining OR and AND aggregation logics to create complex acceptance functions, enabling the development of expressive and efficient proof systems for various blockchain applications. The proposed techniques have the potential to significantly enhance the scalability, efficiency, and flexibility of zero-knowledge proof systems, paving the way for more practical and adaptive solutions in large-scale blockchain ecosystems.
Reference37 articles.
1. Bowe, S., Gabizon, A., and Green, M.D. (March, January 26). A Multi-Party Protocol for Constructing the Public Parameters of the Pinocchio Zk-SNARK. Proceedings of the Financial Cryptography and Data Security: FC 2018 International Workshops, BITCOIN, VOTING, and WTSC, Nieuwpoort, Curaçao. 2. Ben-Sasson, E., Chiesa, A., Tromer, E., and Virza, M. (2014, January 20–22). Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA. 3. Goldwasser, S., Micali, S., and Rackoff, C. (1985, January 6–8). The Knowledge Complexity of Interactive Proof-Systems. Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, Providence, RI, USA. 4. Leveraging Zero Knowledge Proofs for Blockchain-Based Identity Sharing: A Survey of Advancements, Challenges and Opportunities;Zhou;J. Inf. Secur. Appl.,2024 5. An Anonymous Authentication Scheme with Conditional Privacy-Preserving for Vehicular Ad Hoc Networks Based on Zero-Knowledge Proof and Blockchain;Shahrouz;Ad Hoc Netw.,2024
|
|