Collaborative SNARKs Enable Private Shared State Computation without Revealing Secrets
Collaborative SNARKs merge ZKPs and MPC to allow distributed parties to jointly prove a statement over private inputs, unlocking secure data collaboration.
Multi-Party Computation Circumvents Impossibility in Decentralized Mechanism Design for Fair Fees
Cryptographic Multi-Party Computation enables collusion-resistant transaction fee mechanisms, transforming a game-theoretic impossibility into a secure computation problem.
Transparent Recursive Proofs Secure Quantum-Resistant Decentralized State
Fractal introduces a hash-based, transparent SNARK, enabling recursive proofs for quantum-secure, constant-size verification of entire blockchain history.
Formalizing Practical Security Risks in Zero-Knowledge Proof Implementations
This work shifts focus from theoretical SNARK security to a taxonomy of 141 real-world vulnerabilities, enabling robust, end-to-end ZK system design.
Lattice Verifiable Delay Function Achieves Practical Post-Quantum Consensus Security
Papercraft introduces the first practical lattice-based VDF, securing decentralized randomness and leader election against the imminent threat of quantum adversaries.
