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.
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.
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.
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.
Comparing Solidity and Move Formal Verification for Enhanced Smart Contract Security
This analysis reveals how smart contract language design fundamentally impacts formal verification efficacy, paving the way for more secure blockchain architectures.