Managing Credible Anonymous Identities in Web 3.0 Services: A Scalable On-Chain Admission Framework with Recursive Proof Aggregation
🤖 AI Summary
This work addresses a central challenge in decentralized identity systems for Web 3.0: enabling efficient on-chain admission while preserving user privacy and resisting Sybil attacks. The authors propose ZK-AMS, the first system to integrate recursive zero-knowledge proofs (based on Nova) with multi-key homomorphic encryption, constructing a privacy-preserving folding pipeline that maps real-world human credentials to anonymous on-chain accounts. By leveraging permissionless batch submissions and recursive proof aggregation, ZK-AMS achieves constant on-chain verification overhead, decoupling admission cost from batch size. Experimental results on the Ethereum testnet demonstrate that ZK-AMS significantly outperforms non-recursive baselines, exhibiting scalable, efficient, and predictable performance in throughput, latency, and gas consumption for large-scale admission.
Application Category
📝 Abstract
Open Web 3.0 platforms increasingly operate as \emph{service ecosystems} (e.g., DeFi, DAOs, and decentralized social applications) where \emph{admission control} and \emph{account provisioning} must be delivered as an always-on service under bursty demand. Service operators face a fundamental tension: enforcing Sybil resistance (one-person-one-account) while preserving user privacy, yet keeping on-chain verification cost and admission latency predictable at scale. Existing credential-based ZK admission approaches typically require per-request on-chain verification, making the provisioning cost grow with the number of concurrent joiners. We present \textbf{ZK-AMS}, a scalable admission and provisioning layer that bridges real-world \emph{Personhood Credentials} to anonymous on-chain service accounts. ZK-AMS combines (i) zero-knowledge credential validation, (ii) a \emph{permissionless} batch submitter model, and (iii) a decentralized, privacy-preserving folding pipeline that uses Nova-style recursive aggregation together with multi-key homomorphic encryption, enabling batch settlement with \emph{constant} on-chain verification per batch. We implement ZK-AMS end-to-end on an Ethereum testbed and evaluate admission throughput, end-to-end latency, and gas consumption. Results show stable verification cost across batch sizes and substantially improved admission efficiency over non-recursive baselines, providing a practical and cost-predictable admission service for large-scale Web 3.0 communities.
Problem
Research questions and friction points this paper is trying to address.
Sybil resistance
anonymous identity
Web 3.0 admission control
on-chain verification
privacy-preserving
Innovation
Methods, ideas, or system contributions that make the work stand out.
zero-knowledge proofs
recursive proof aggregation
Sybil resistance
privacy-preserving admission
on-chain scalability
🔎 Similar Papers
No similar papers found.
