TL;DR
This paper introduces ZK-AMS, a novel Web 3.0 admission system that allows users to gain access to platforms anonymously while ensuring unique identities. It achieves this by combining zero-knowledge proofs, recursive proof aggregation, and homomorphic encryption, enabling scalable, cost-predictable onboarding without compromising user privacy.
What Problem Does This Paper Address?
Web 3.0 platforms, from DeFi to decentralized social networks, need a robust way to onboard legitimate users at scale while preventing Sybil attacks (multiple fake identities from a single person). Traditional methods often force users to reveal sensitive personal information (like KYC), incur high on-chain verification costs per user, or rely on trusted intermediaries. This creates a trade-off between privacy, scalability, and cost. Existing solutions struggle to simultaneously offer verifiable uniqueness, user anonymity, and predictable costs/latency, especially under high demand. ZK-AMS aims to bridge this gap by providing a credibly anonymous admission infrastructure that maps real-world "personhood credentials" to anonymous on-chain "Soul Accounts."
Methods
ZK-AMS is built by composing several existing cryptographic primitives into a novel workflow:
- Personhood Credentials (PHCs): These act as the off-chain root of trust for verifying a user's real-world uniqueness. Users prove they possess a valid PHC without revealing its contents on-chain.
- Nova-style Recursive Proof Aggregation: This is the core scalability mechanism. It allows many admission requests (proofs) to be compressed into a single, verifiable proof off-chain. This dramatically reduces the on-chain verification cost from per-user to per-batch.
- Multi-Key Homomorphic Encryption (MKHE): To preserve privacy during the batching process, computations are performed on encrypted data. This means an untrusted "Permissionless Batch Submitter" (PBS) can aggregate proofs without seeing individual user witnesses.
- Linkable Ring Signatures (MLSAGS): After successful admission, users can provision anonymous "Soul Accounts." MLSAGS ensures that each admitted identity can only provision one account, preventing duplicate account creation while maintaining anonymity.
The system integrates these components into a five-phase workflow: client-side credential processing, confidential off-chain batch aggregation, proof finalization by the PBS, on-chain batch admission, and anonymous account provisioning.
Datasets
Not discussed in the paper. The evaluation uses a simulated Ethereum testbed.
Key Insights and Ideas
- Batching is Key for Scalability and Predictability: The paper highlights how recursive batching fundamentally changes the cost model from linear (per-user) to amortized (per-batch), making onboarding costs predictable even under high concurrency.
- Confidentiality During Batching is Achievable: By using MKHE, ZK-AMS demonstrates that batch aggregation can be performed without revealing individual user secrets to the batch submitter, a significant privacy improvement over many existing batching schemes.
- Separation of Admission and Provisioning: Decoupling the admission process (verifying uniqueness) from account provisioning (creating an anonymous on-chain identity) allows for distinct security and privacy guarantees for each stage.
- Configuration Trade-offs are Explicit: ZK-AMS provides clear knobs (like batch size and ring size for MLSAGS) that allow platform operators to balance throughput, latency, and cost based on their specific needs.
Key Results
- Stable On-Chain Cost: Recursive proof aggregation keeps the on-chain verification gas cost nearly constant (around 934K gas) for batches up to 256 users, a significant improvement over the linear cost of non-recursive methods.
- Reduced Amortized Cost: The amortized on-chain cost per admitted user drops substantially with larger batch sizes, becoming dominated by account provisioning at scale.
- Latency Trade-offs: While confidential folding introduces latency (up to ~1800 seconds for a batch of 128 users), the system's design allows for configuration to balance this with throughput and cost.
- MLSAGS for Anonymous Provisioning: The system effectively uses MLSAGS to ensure one-to-one account provisioning with anonymity, with signing and verification times scaling linearly with ring size.
Limitations and Future Work
- Confidentiality Coalition Bound: The current prototype's confidentiality guarantee against the PBS is limited to scenarios where at least two participants remain outside the PBS coalition. If the PBS colludes with all but one participant, the last participant's contribution might be partially isolated.
- Confidential Folding Latency: The confidential folding process is currently the main bottleneck for admission-settlement latency.
- Decryption Share Dependency: The system relies on users providing decryption shares; malformed or missing shares can stall batch finalization. The current recovery mechanism is off-chain.
- No Post-Admission Lifecycle Management: ZK-AMS does not currently support PHC revocation, expiry, or account recovery after key loss.
Future work includes reducing folding latency through pipelining, improving permissionless finalization with verifiable share handling, and integrating credential lifecycle management and account recovery features.
Summary updated