Scaling zkSNARKs through Application and Proof System Co-Design
This research introduces "silently verifiable proofs" and a co-design approach to drastically reduce communication costs for scalable, privacy-preserving analytics.
SublonK: Sublinear Prover Time for Active Zero-Knowledge Circuits
SublonK introduces a novel SNARK achieving sub-linear prover runtime for conditional circuits, dramatically accelerating verifiable computation in applications like zkRollups.
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.
Sublinear ZKP Prover Revolutionizes Verifiable Computation for Constrained Devices
A novel zero-knowledge proof prover architecture drastically reduces memory requirements, enabling ubiquitous verifiable computation on resource-limited hardware.
Code-Based Zero-Knowledge Proofs for Post-Quantum Cryptographic Resilience
This research pioneers novel zero-knowledge proof protocols, including HammR and CROSS, leveraging coding theory to secure digital signatures against emerging quantum threats.
Hardware Acceleration Revolutionizes ZK-Friendly Hashing for Practical ZKP Applications
HashEmAll leverages FPGA-based hardware to dramatically accelerate ZK-friendly hash functions, unlocking real-time, scalable zero-knowledge applications.
Efficient Zero-Knowledge Proofs: Bridging Theory to Practical Blockchain Applications
This research introduces novel zero-knowledge proof protocols, significantly enhancing efficiency and scalability for secure, trustless blockchain and AI systems.
Plume Integrates EY-Assisted Nightfall for Institutional Real-World Asset Privacy
This strategic deployment enhances secure, compliant privacy infrastructure for real-world asset tokenization, enabling scalable private transactions on Ethereum-compatible blockchains.
Augmenting LLMs for Reliable Zero-Knowledge Proof Code Generation
A novel agentic framework empowers large language models to reliably synthesize complex zero-knowledge proof circuits, democratizing access to verifiable computation.
