Distributed Verifiable Random Function Secures Decentralized Unpredictable Public Randomness
A Distributed Verifiable Random Function combines threshold cryptography and zk-SNARKs to generate public, unpredictable, and bias-resistant randomness.
Distributed Zero-Knowledge Proofs Scale Zkrollups with Constant Communication
A distributed Plonk protocol minimizes inter-prover communication to a constant factor, eliminating the zkRollup prover bottleneck and unlocking massive Layer 2 scalability.
Federated Distributed Key Generation Secures Open Decentralized Networks
Federated Distributed Key Generation enables optional participation in threshold cryptography, securing large, dynamic decentralized systems.
Revelation Mechanisms Enforce Truthful Consensus Equilibrium in Proof-of-Stake
A novel revelation mechanism uses game theory to guarantee truthful block proposals in Proof-of-Stake, simplifying consensus and boosting scalability.
Opening-Consistent IOPs Enable Trustless Erasure Code Commitments
This research introduces Erasure Code Commitments, a new primitive constructed via a novel IOP compiler, solving data availability without a trusted setup or high overhead.
Distributed Proving Protocol Unlocks Linear Scalability for Zero-Knowledge Rollups
Pianist distributes ZKP generation across multiple machines, achieving linear scalability with constant communication overhead, resolving the zkRollup proof bottleneck.
Constant-Size Zero-Knowledge Set Membership Proofs Secure Resource-Constrained Networks
A novel OR-aggregation protocol leverages Sigma protocols to achieve constant proof size and verification time, unlocking scalable, private IoT data integrity.
Two-Phase ZK-VM Architecture Secures Memory Integrity with Custom Accumulators
A novel two-phase ZK-VM architecture leverages a custom elliptic curve accumulator for memory integrity, drastically cutting proving cost and boosting verifiable computation efficiency.
Zero-Knowledge Proofs Enable Verifiable, Hidden Economic Mechanisms without Trusted Mediators
Cryptographic commitments hide mechanism rules while zero-knowledge proofs verify incentive compatibility, unlocking private, trustless economic design.
