Zero-Knowledge Proof of Personhood Secures Decentralized Identity and Sybil Resistance
This research introduces Zero-Knowledge Proof of Personhood (ZK-PoP) to cryptographically enforce unique identity without compromising user privacy, solving the Sybil resistance challenge.
Black-Box Commit-and-Prove SNARKs Unlock Verifiable Computation Scaling
Artemis, a new black-box SNARK construction, modularly solves the commitment verification bottleneck, enabling practical, large-scale zero-knowledge machine learning.
Subspace Codes Enable Logarithmic Proof Size Constant Verification Time Commitment
A novel polynomial commitment scheme using subspace codes achieves logarithmic proof size and constant verification, enhancing rollup efficiency.
Practical Asynchronous BFT Protocol Achieves High Performance and Simplicity
Alea-BFT uses a two-stage pipeline with a designated leader to combine classical BFT efficiency with asynchronous network resilience, enabling practical adoption.
Obfuscation Enables Deterministic Asynchronous Consensus Defying FLP Impossibility
Program obfuscation and time-lock puzzles overcome the FLP impossibility, yielding a deterministic consensus for asynchronous networks.
Universal zk-SNARKs Achieve Linear Circuit Size Eliminating Per-Program Setup
MIRAGE introduces a linear-size universal circuit to eliminate the per-computation trusted setup, unlocking practical, general-purpose verifiable computation.
Erasure Coding Achieves Near-Optimal Byzantine Broadcast Communication Efficiency
Researchers deployed erasure-correcting codes and vector commitments to fragment messages, drastically reducing Byzantine Reliable Broadcast communication complexity to near-optimal bounds.
Poly-Universal Proofs Achieve Universal Setup and Updatable Security
This new polynomial commitment scheme decouples proof generation from circuit structure, enabling a single, secure, and continuously updatable universal setup.
Fuzzing Zero-Knowledge Proof Circuits Ensures Implementation Security and Reliability
Introducing fuzzing to ZKP circuits solves the oracle problem for soundness, establishing a scalable, practical security layer for verifiable computation.
