Zero-Knowledge Proof of Training Secures Private Decentralized Machine Learning
ZKPoT consensus uses zk-SNARKs to prove model accuracy privately, resolving the privacy-utility-efficiency trilemma for federated learning.
Inner Product Arguments Eliminate Trusted Setup for Data Availability Sampling
Inner Product Arguments enable trustless data availability sampling by replacing complex trusted setups with a transparent, discrete log-based commitment scheme.
Non-Interactive Verifiable Aggregation Secures Private Decentralized Data Computation
A new cryptographic primitive, NIVA, combines functional encryption and verifiable proofs to enable private, robust, and non-interactive data aggregation by untrusted servers.
Non-Delegatable Commitments Enforce Cryptographic Proof of Work and Identity
Non-Delegatable Commitments cryptographically bind action to private key possession, preventing outsourcing and enforcing honest participation in attestations.
Lattice-Based Functional Commitments Secure All Functions with Transparent Post-Quantum Setup
New lattice-based functional commitments secure all functions, enabling post-quantum verifiable computation without a trusted setup.
Decentralizing Attribute Encryption Eliminates Single Authority Trust Risk
A blockchain-based mechanism distributes key generation for CP-ABE, resolving the centralized trusted authority problem and securing outsourced data access.
Recursive Folding Unlocks Logarithmic Prover Time for Polynomial Commitments
PolyLog introduces a recursive folding primitive to reduce the zero-knowledge prover's commitment time from linear to logarithmic, enabling massive ZK-rollup scaling.
Threshold Cryptography Secures Decentralized Location Privacy
A dual-protection framework combines Shamir's secret sharing with a priority-response consensus to achieve provably secure location and query privacy.
Greyhound Achieves Post-Quantum Polynomial Commitments with Unprecedented Efficiency
A new lattice-based polynomial commitment scheme, Greyhound, delivers post-quantum security and 8000X smaller proofs, unlocking scalable verifiable computation.
