Bilinear Accumulators Enable Constant-Size Zero-Knowledge Batch Proofs
Zero-knowledge batch proofs using Bilinear Pairings achieve constant size and verification time, dramatically accelerating stateless blockchain and credential systems.
Batching Accumulators Enable Constant-Storage Stateless Blockchain Verification
New batching techniques for cryptographic accumulators allow nodes to verify the entire blockchain state with constant storage, solving state bloat.
Efficient Zero-Knowledge Accumulator Enables Private Scalable State
A novel Zero-Knowledge Dynamic Universal Accumulator leverages Bloom Filters and vector commitments to create private, succinct, and efficient state proofs for scalable blockchain architectures.
Oblivious Accumulators Achieve Private Set Commitments Hiding Elements and Size
Oblivious Accumulators introduce element hiding and update indistinguishability, enabling privacy-preserving set membership proofs for decentralized systems.
Eliminating Prime Hashing Makes RSA Accumulators Viable for Decentralized Systems
This new RSA accumulator construction bypasses the slow "hashing into primes" bottleneck, fundamentally enabling succinct, dynamic, and practical set membership proofs on-chain.
