Composable Fairness Secures Transaction Ordering against Manipulation
A new Universally Composable framework formally defines transaction order fairness, enabling a YOSO-style protocol with constant-complexity decryption to mitigate systemic MEV.
Formalizing Zero-Knowledge Composition Requires Stronger Security Definitions for Scalability
Research proves composing zero-knowledge proofs requires stronger simulation properties, establishing the theoretical basis for secure, recursive proof systems.
SmallWood: Hash-Based Commitments Achieve Post-Quantum Zero-Knowledge for Small Instances
SmallWood introduces a post-quantum, hash-based commitment scheme, dramatically shrinking proof sizes for common, small-scale verifiable computation.
Efficient Post-Quantum Polynomial Commitments Unlock Scalable Zero-Knowledge Cryptography
Greyhound, a lattice-based polynomial commitment scheme, delivers post-quantum security and vastly smaller proof sizes, enabling practical, future-proof zk-SNARKs.
Distributed zk-SNARKs Achieve Massive Efficiency through Binary Field Delegation
FDzkS protocol utilizes binary fields and group signatures to enable near-offline proof delegation, eliminating network bottlenecks for scalable privacy.
Zero-Knowledge Authenticator Achieves Policy-Private Transaction Authentication on Public Blockchains
This new cryptographic primitive uses equivocable verification keys to privatize complex authentication policies, enhancing on-chain privacy.
Optimal Asynchronous Byzantine Agreement Achieves Minimum Communication Complexity
The new multi-valued Byzantine Agreement protocol achieves the theoretical minimum communication complexity, fundamentally improving decentralized system efficiency.
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.
New ZK Protocols Achieve Optimal Linear Prover Time and Distributed Proof Generation
Cryptographers introduced new zero-knowledge protocols that achieve optimal linear-time prover complexity and enable fully distributed proof generation, accelerating ZKP adoption for scalable privacy.
