Pseudorandom Codes Enhance AI Watermarking with Provable Cryptographic Security

This research introduces novel pseudorandom error-correcting codes, a cryptographic primitive for provably secure and tamper-resistant watermarking of generative AI outputs.
Practical Distributed Broadcast Encryption Eliminates Centralized Key Escrow

This research introduces practical distributed broadcast encryption schemes, enabling secure group messaging without a trusted central authority.
Nova: Efficient Recursive Zero-Knowledge Proofs for Incremental Computation

Nova introduces a novel protocol for incrementally verifiable computation using folding schemes, dramatically reducing proof size and verifier overhead for sequential computations.
Sublinear-Space Zero-Knowledge Proofs Enable Efficient On-Device Verification

This research pioneers sublinear-space zero-knowledge proofs, transforming verifiable computation by enabling efficient on-device proving for resource-constrained environments.
VDFs Are Impossible in the Random Oracle Model

This research fundamentally redefines Verifiable Delay Functions, proving their non-existence in the Random Oracle Model, impacting future cryptographic primitive design.
Quantum-Resistant IBE Secures Blockchain Privacy with Delegated Decryption

Introduces a quantum-resistant Identity-Based Encryption scheme allowing private data sharing on blockchains with secure, delegated decryption, enhancing future privacy.
Blockchain-Secured Attribute Encryption for Verifiable, Payable Outsourced Decryption

Blockchain-based attribute encryption enables verifiable, fair outsourced decryption with zero-knowledge proofs, enhancing data privacy and efficiency.
Folding Schemes Enable Efficient Recursive Zero-Knowledge Arguments

Nova introduces novel folding schemes for incrementally verifiable computation, dramatically reducing prover time and recursion overhead for scalable trustless systems.
Affine One-Wayness: Post-Quantum Temporal Verification for Distributed Systems

A new cryptographic primitive, Affine One-Wayness, enables transparent, post-quantum verifiable temporal ordering in distributed systems without trusted clocks.
Verifiable Delay Functions: Cryptographic Sequentiality for Decentralized Systems

A novel cryptographic primitive, Verifiable Delay Functions, introduces guaranteed sequential computation, enabling trustless time-based operations in decentralized networks.
Optimal Zero-Knowledge Proofs: Faster Provers, Scalable Distributed Computation

Novel ZKP protocols dramatically accelerate proof generation, enabling practical, privacy-preserving computation and scalable blockchain architectures.