# Efficient Zero-Knowledge Proofs for Set Membership in Blockchain-Based Sensor Networks: A Novel OR-Aggregation Approach

Source: [Efficient Zero-Knowledge Proofs for Set Membership in Blockchain-Based Sensor Networks: A Novel OR-Aggregation Approach](<https://www.sota2.com/research/paper/68fa753a1e209131cea66948>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2026-04-14T05:00:04.234Z

Authors: Oleksandr Kuznetsov, Emanuele Frontoni, Marco Arnesano, Kateryna Kuznetsova

Published: 2024-10-11T18:16:34.000Z

## Abstract

Blockchain-based sensor networks offer promising solutions for secure and transparent data management in IoT ecosystems. However, efficient set membership proofs remain a critical challenge, particularly in resource-constrained environments. This paper introduces a novel OR-aggregation approach for zero-knowledge set membership proofs, tailored specifically for blockchain-based sensor networks. We provide a comprehensive theoretical foundation, detailed protocol specification, and rigorous security analysis. Our implementation incorporates optimization techniques for resource-constrained devices and strategies for integration with prominent blockchain platforms. Extensive experimental evaluation demonstrates the superiority of our approach over existing methods, particularly for large-scale deployments. Results show significant improvements in proof size, generation time, and verification efficiency. The proposed OR-aggregation technique offers a scalable and privacy-preserving solution for set membership verification in blockchain-based IoT applications, addressing key limitations of current approaches. Our work contributes to the advancement of efficient and secure data management in large-scale sensor networks, paving the way for wider adoption of blockchain technology in IoT ecosystems.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

- [Cryptographic Proof Performance on Synthetic Set Size 10,000 (test)](<https://www.sota2.com/research/sota/cryptographic-proof-performance-on-synthetic-set-size-10-000-test.md>): Cryptographic Proof Performance; Synthetic Set Size 10,000 (test); Proof Size (bytes): 160.

- [Cryptographic Proof Performance on Synthetic Set Size 100,000 (test)](<https://www.sota2.com/research/sota/cryptographic-proof-performance-on-synthetic-set-size-100-000-test.md>): Cryptographic Proof Performance; Synthetic Set Size 100,000 (test); Proof Size (bytes): 160.

- [Cryptographic Proof Performance on Synthetic Set Size 1,000,000 (test)](<https://www.sota2.com/research/sota/cryptographic-proof-performance-on-synthetic-set-size-1-000-000-test.md>): Cryptographic Proof Performance; Synthetic Set Size 1,000,000 (test); Proof Size (bytes): 160.

- [Membership Proofing on Synthetic Membership Proof Sets](<https://www.sota2.com/research/sota/membership-proofing-on-synthetic-membership-proof-sets.md>): Membership Proofing; Synthetic Membership Proof Sets; Proof Size (bytes): 160.

- [Cryptographic Proof Performance on Synthetic Set Size 1,000 (test)](<https://www.sota2.com/research/sota/cryptographic-proof-performance-on-synthetic-set-size-1-000-test.md>): Cryptographic Proof Performance; Synthetic Set Size 1,000 (test); Proof Size (bytes): 160.

- [Batch Verification on 300,000,000 element set 1000 elements batch](<https://www.sota2.com/research/sota/batch-verification-on-300-000-000-element-set-1000-elements-batch.md>): Batch Verification; 300,000,000 element set 1000 elements batch; Total Proof Size: 160.

- [Batch Verification on Synthetic set (300,000,000 elements)](<https://www.sota2.com/research/sota/batch-verification-on-synthetic-set-300-000-000-elements.md>): Batch Verification; Synthetic set (300,000,000 elements); Proof Size: 160.

- [Cryptographic Proof Performance on Synthetic sets of varying sizes (100 to 1,000,000 elements)](<https://www.sota2.com/research/sota/cryptographic-proof-performance-on-synthetic-sets-of-varying-sizes-100-to-1-000-000-elements.md>): Cryptographic Proof Performance; Synthetic sets of varying sizes (100 to 1,000,000 elements); Avg. Generation Time (s): 0.026569.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2410.09169>)

[PDF](<https://arxiv.org/pdf/2410.09169.pdf>)