Lattice-Based Publicly Verifiable Secret Sharing Achieves Post-Quantum Standard Model Security
Researchers constructed the first lattice-based Publicly Verifiable Secret Sharing scheme, achieving post-quantum security in the rigorous standard model, securing decentralized key management against future threats.
Zero-Knowledge Proof of Training Secures Private Decentralized Federated Learning
ZKPoT consensus verifiably proves model contribution quality via zk-SNARKs, fundamentally securing private, scalable decentralized AI.
Sublinear Vector Commitments Achieve Optimal Stateless Client Update Efficiency
A new vector commitment scheme achieves sublinear complexity for both global update size and local proof updates, solving the stateless client efficiency trade-off.
Incremental Proofs Maintain Constant-Size Sequential Work for Continuous Verification
This new cryptographic primitive enables constant-size proofs for arbitrarily long sequential computations, fundamentally solving the accumulated overhead problem for VDFs.
Sublinear Prover PlonK Cuts Verifiable Computation Cost by Proving Active Circuits
SublonK introduces a novel SNARK prover whose runtime scales only with the active circuit, fundamentally optimizing large-scale verifiable computation.
Decentralized Time-Lock Encryption Eliminates Single Point of Failure
This protocol introduces a Time-Lapse Cryptography Service using secret sharing to construct a decryption key, guaranteeing conditional information release without a trusted single party.
Efficient Lattice Commitments Secure Post-Quantum Verifiable Computation
Greyhound introduces the first concretely efficient lattice-based polynomial commitment scheme, providing quantum-resistant security for all verifiable computation.
FRI-IOP Establishes Quantum-Resistant Polynomial Commitments for Scalable Proofs
FRI-based polynomial commitments replace pairing-based cryptography with hash-based, quantum-resistant security, enabling transparent, scalable ZK-SNARKs and data availability.
Zero-Knowledge Proof of Training Secures Decentralized Federated Learning
ZKPoT consensus uses zk-SNARKs to verify machine learning contributions privately, resolving the privacy-verifiability trade-off for decentralized AI.
