Sublinear Zero-Knowledge Proofs Democratize Verifiable Computation on Constrained Devices
A new space-efficient tree algorithm reduces ZK proof memory from linear to square-root, unlocking verifiable computation for all devices.
Optimal Linear-Time ZK Proofs Unlock Mass Verifiable Computation
Achieving optimal linear prover time for zero-knowledge proofs fundamentally solves the scalability bottleneck for verifiable computation and ZK-Rollups.
Practical Verifiable Computation over Homomorphically Encrypted Data
A novel transformation for Interactive Oracle Proofs enables efficient verification of computations on encrypted data in the plaintext space.
Formally Verifying Sumcheck Protocol Enhances Cryptographic Proof System Security
This research formally verifies the foundational Sumcheck protocol, ensuring cryptographic proof system integrity and enabling more secure, modular blockchain architectures.
Formalizing Optimistic Rollup Fraud Proofs for Enhanced Security
This research establishes a rigorous framework for fraud proofs, ensuring the integrity of off-chain computations and unlocking scalable blockchain architectures.
Quantum Advantage Tied to Cryptographic Security via One-Way Puzzles
Researchers establish a foundational equivalence between quantum computational superiority and cryptographic primitive security, redefining quantum advantage conditions.
Quantum Rewinding Secures Succinct Arguments against Quantum Threats
A novel quantum rewinding strategy enables provably post-quantum secure succinct arguments, safeguarding cryptographic protocols from future quantum attacks.
Polynomial Commitment Schemes and Interactive Oracle Proofs Build SNARKs
Integrating Polynomial Commitment Schemes and Interactive Oracle Proofs constructs efficient zk-SNARKs, enabling scalable verifiable computation.
Generalizing Zero-Knowledge Proofs for Streaming Data with Robust Security
This research introduces advanced zero-knowledge streaming proofs, enabling secure verification of complex computations on data streams with unprecedented robustness against information leakage.
Witness Encryption Indispensable for Resettable Statistical Zero-Knowledge Arguments
This research establishes the fundamental equivalence between resettable statistical zero-knowledge arguments and witness encryption, resolving a longstanding open problem.
