Scalable Zero-Knowledge Proofs: Optimizing Delegation and Private Aggregation
This research introduces novel proof systems and architectures that fundamentally scale zero-knowledge proofs, reducing server communication costs for privacy-preserving applications.
OR-Aggregation: Constant-Size ZKPs for Resource-Constrained Networks
This research introduces a novel OR-aggregation technique, fundamentally transforming privacy and verifiable computation efficiency in resource-constrained environments.
Accelerating Zero-Knowledge Proofs for Practical Blockchain Adoption
This research introduces novel zero-knowledge proof protocols, dramatically enhancing proof generation speed and unlocking widespread privacy-preserving technology adoption.
SLAP Achieves Efficient Post-Quantum Polynomial Commitments under Standard Lattice Assumptions
SLAP introduces a lattice-based polynomial commitment scheme, enabling post-quantum secure verifiable computation with polylogarithmic efficiency.
Novel OR-aggregation Enhances Zero-Knowledge Set Membership for blockchain-IoT
Novel OR-aggregation enables efficient, constant-size zero-knowledge set membership proofs for blockchain-IoT, advancing privacy and scalability.
Sublinear-Space Zero-Knowledge Proofs Revolutionize Verifiable Computation Efficiency
A novel zero-knowledge prover reduces memory from linear to sublinear, unlocking verifiable computation for resource-constrained devices and massive tasks.
Eliminating Latency in Blockchain Threshold Cryptosystems for Enhanced Consensus
This research eliminates latency overhead for tight threshold cryptosystems, enhancing BFT blockchain efficiency and formalizing unavoidable delays.
OR-Aggregation Achieves Constant-Size ZKPs for Resource-Constrained Networks
OR-Aggregation introduces a novel ZKP mechanism, ensuring constant proof size and verification time, transforming privacy in IoT and blockchain environments.
HyperNova Enhances Practical Zero-Knowledge Virtual Machine Efficiency
HyperNova introduces a recursive zero-knowledge proof system that significantly reduces overhead for high-degree constraint computations, enabling more practical verifiable virtual machines.
