OR-Aggregation Secures Efficient Zero-Knowledge Set Membership Proofs
A novel OR-aggregation technique drastically reduces proof size and computation for set membership, enabling private, scalable data management in IoT.
Folding Schemes Enable Efficient Recursive Zero-Knowledge Computation
Introducing folding schemes, a novel cryptographic primitive, dramatically reduces recursive proof overhead, enabling practical, constant-cost verifiable computation.
Recursive Inner Product Arguments Enable Universal Transparent Polynomial Commitments
A novel recursive folding of polynomial commitments into Inner Product Arguments yields universal, transparent proof systems for highly scalable verifiable computation.
Verifiable Computation for Approximate FHE Unlocks Private AI Scalability
This new cryptographic framework efficiently integrates Verifiable Computation with approximate Homomorphic Encryption, enabling trustless, private AI computation at scale.
Constraint-Reduced Circuits Achieve Orders of Magnitude Faster Zero-Knowledge Proving
New Constraint-Reduced Polynomial Circuits (CRPC) primitives cut ZKP complexity from cubic to linear, unlocking practical verifiable AI and ZK-EVMs.
New Transparent Recursive Commitment Scheme Eliminates Trusted Setup Efficiency Trade-Off
LUMEN introduces a novel recursive polynomial commitment scheme, achieving transparent zk-SNARK efficiency on par with trusted-setup protocols.
Rondo Protocol Achieves Optimal Linear Complexity for Decentralized Randomness Beacon Sharing
Rondo introduces batched asynchronous verifiable secret sharing with partial output, cutting message complexity to linear for scalable, reconfigurable randomness beacons.
Zero-Knowledge Proof of Training Secures Decentralized Federated Learning Consensus
ZKPoT uses zk-SNARKs to verify decentralized model accuracy without revealing private data, solving the efficiency-privacy trade-off in federated learning.
Rondo Protocol Achieves Scalable, Dynamic Distributed Randomness Beacon
The Rondo protocol introduces Batched Asynchronous Verifiable Secret Sharing with Partial Output, enabling dynamic node membership and optimal $O(n)$ message complexity for scalable, unpredictable randomness.
