Universal accumulators are cryptographic primitives that can efficiently commit to a dynamic set of elements and later provide concise proofs of both membership and non-membership for any element. They offer a compact representation of a set while supporting updates and verifications. These accumulators are highly versatile.
Context
Universal accumulators hold considerable promise for enhancing the scalability and privacy of blockchain systems. They can be used to efficiently verify the existence or absence of transactions or accounts within a large dataset without revealing the entire set. Research in this area seeks to develop accumulators that are highly efficient in terms of proof size and computation time, supporting more capable decentralized applications.
This new RSA accumulator construction bypasses the slow "hashing into primes" bottleneck, fundamentally enabling succinct, dynamic, and practical set membership proofs on-chain.
Research introduces a Dynamic Universal Accumulator that compresses massive data sets into a constant-size cryptographic proof, enabling efficient, constant-time verification for scalable systems.
We use cookies to personalize content and marketing, and to analyze our traffic. This helps us maintain the quality of our free resources. manage your preferences below.
Detailed Cookie Preferences
This helps support our free resources through personalized marketing efforts and promotions.
Analytics cookies help us understand how visitors interact with our website, improving user experience and website performance.
Personalization cookies enable us to customize the content and features of our site based on your interactions, offering a more tailored experience.
