Efficient Transparent Zero-Knowledge Proofs Eliminate Trusted Setup for Scalability
A new recursive polynomial commitment scheme, LUMEN, achieves the efficiency of trusted-setup SNARKs while maintaining full transparency, unlocking truly scalable and trustless rollups.
Black-Box Succinct Proofs Achieve Statistical Zero-Knowledge Security
A new polynomial commitment scheme enables succinct zero-knowledge proofs from minimal assumptions, establishing a theoretically optimal foundation for verifiable computation.
Constant-Cost Randomness Beacons Decouple Security from Network Scale
A new cryptographic protocol achieves constant *O(1)* on-chain gas cost for decentralized randomness, making leader election and sharding truly scalable.
ZKPoT Consensus Secures Decentralized Learning against Privacy and Centralization
A Zero-Knowledge Proof of Training consensus mechanism leverages zk-SNARKs to validate machine learning model performance privately, securing decentralized AI.
Unified Framework Achieves Private Scalable Verifiable Machine Learning
The new proof-composition framework casts verifiable machine learning as succinct matrix computations, delivering linear prover time and architecture privacy for decentralized AI.
Certificateless Proxy Re-Encryption Enables Private Decentralized Data Access Control
Certificateless Proxy Re-Encryption (CL-PRE) securely delegates data access on-chain by eliminating PKI overhead and private key exposure, enabling privacy-preserving data markets.
Sublinear Transparent Commitment Scheme Unlocks Efficient Data Availability Sampling
A new transparent polynomial commitment scheme with sublinear proof size radically optimizes data availability for stateless clients, resolving a core rollup bottleneck.
Democratic Randomness Protocol Eliminates Leader Bottlenecks for Scalability
Kleroterion, a democratic random beacon using Pinakion PVSS, achieves linear complexity by distributing input sharing, enabling scalable, bias-resistant randomness.
Vector Oblivious Linear Evaluation Unlocks Efficient Zero-Knowledge Proof Systems
VOLE-ZK leverages MPC primitives to construct highly efficient, CPU-friendly zero-knowledge proofs for complex computation.
