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.
Decentralized Private Computation Unlocks Programmable Privacy and Verifiability
Research introduces Decentralized Private Computation, a ZKP-based record model that shifts confidential execution off-chain, enabling verifiable, private smart contracts.
Fino Protocol Achieves MEV Protection on High-Throughput DAG Consensus
Fino embeds blind order-fairness into DAG-BFT with zero message overhead, securing high-throughput systems against transaction reordering attacks.
Generalizing MPC-in-the-head for Superposition-Secure Quantum Zero-Knowledge Proofs
We generalize MPC-in-the-head to create post-quantum zero-knowledge arguments, securing verifiable computation against quantum superposition attacks using LWE.
Partition Vector Commitments Optimize Data Availability and Communication Overhead
Partition Vector Commitments introduce a novel data structure to drastically reduce proof size and communication overhead, securing data availability for scalable decentralized architectures.
Cryptography Circumvents TFM Impossibility for Fair Decentralized Systems
Game theory proves a fundamental impossibility in transaction fee mechanisms, which is solved by cryptographic primitives that enforce fair ordering and privacy.
Verifiable Computation for Approximate Homomorphic Encryption Secures Private AI
New HE-IOP primitive solves the integrity problem for approximate homomorphic encryption, enabling verifiable, private, outsourced computation for AI models.
Collaborative zk-SNARKs Enable Private, Decentralized, Scalable Proof Generation
Scalable collaborative zk-SNARKs use MPC to secret-share the witness, simultaneously achieving privacy and $24times$ faster proof outsourcing.
Lattice-Based Arguments Achieve Succinct Post-Quantum Verification Using Homomorphic Commitments
This work delivers the first lattice-based argument with polylogarithmic verification time, resolving the trade-off between post-quantum security and SNARK succinctness.
