Transparent Zero-Knowledge Proofs Achieve Optimal Prover Computation and Succinct Verification
The Libra proof system introduces a transparent zero-knowledge scheme achieving optimal linearithmic prover time, unlocking universally scalable private computation.
Data Tumbling Layer Enables Composable, Non-Interactive Smart Contract Unlinkability
Research introduces the Data Tumbling Layer, a new cryptographic primitive for non-interactive data mixing that ensures strong data unlinkability and theft prevention in smart contracts.
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.
Efficient Lattice Polynomial Commitments Secure Post-Quantum ZK Systems
A novel lattice-based polynomial commitment scheme achieves post-quantum security with 8000x smaller proofs, enabling practical, scalable ZK-rollups.
ZK Proof of Training Secures Private Federated Learning Consensus
ZKPoT uses zk-SNARKs to verify model contributions without revealing data, solving the privacy-efficiency trade-off for decentralized AI.
Novel Recursive Commitment Scheme Achieves Transparent, Efficient Zero-Knowledge Proofs
LUMEN introduces a recursive polynomial commitment scheme and PIOP protocol, eliminating the trusted setup while maintaining zk-SNARK efficiency, securing rollup scalability.
Zero-Knowledge Proof of Training Secures Decentralized AI Consensus Privacy
The ZKPoT mechanism leverages zk-SNARKs to cryptographically verify model training contribution, solving the privacy-centralization dilemma in decentralized AI.
Zero-Knowledge Authenticator Secures Complex Policy Privacy for On-Chain Transactions
Introducing the Zero-Knowledge Authenticator, a new primitive that enables private, complex authentication policies, securing user privacy on public ledgers.
Plonky2 Proves SHA-256 Integrity for Scalable Zero-Knowledge Blockchains
A new Plonky2-based methodology efficiently generates zero-knowledge proofs for SHA-256, solving a core computational integrity bottleneck for scaling ZK-Rollups.
