Payable Outsourced Decryption Secures Functional Encryption Efficiency and Incentives
Introducing Functional Encryption with Payable Outsourced Decryption (FEPOD), a new primitive that leverages blockchain to enable trustless, incentive-compatible payment for outsourced cryptographic computation, resolving a critical efficiency bottleneck.
Modular Proofs and Verifiable Evaluation Scheme Unlock Composable Computation
The Verifiable Evaluation Scheme enables chaining proofs for sequential operations, resolving the trade-off between custom efficiency and general-purpose composability.
Sublinear Prover Memory Unlocks Universal Zero-Knowledge Computation and Decentralization
Reframing ZKP generation as a tree evaluation problem cuts prover memory from linear to square-root complexity, enabling ubiquitous verifiable computation.
Selective Batched IBE Scales Threshold Cryptography by Decoupling Key Issuance
Selective Batched IBE introduces a public identity aggregation technique to make threshold decryption key issuance costs independent of batch size, fundamentally scaling private transactions.
Asynchronous Finality Gadget Secures Proof-of-Stake Safety
The $Phi$-Gadget introduces a two-phase threshold signature mechanism to decouple block ordering from finality, guaranteeing safety under asynchronous network conditions.
Lattice-Based Zero-Knowledge SNARKs Achieve Post-Quantum Security and Transparency
Labrador introduces a lattice-based zkSNARK that future-proofs blockchain privacy and scalability against the quantum computing threat.
Decentralized Functional Encryption Secures Multi-Party Private Computation without Trust
This new cryptographic primitive enables multiple independent parties to compute joint functions on encrypted data, eliminating the central authority trust bottleneck.
Vector Commitments Enable Sublinear State Verification for Stateless Clients
A new polynomial vector commitment scheme transforms light clients into secure, stateless verifiers, dramatically improving blockchain decentralization and user security.
Recursive Zero-Knowledge Proofs Unlock Verifiable Private Computation Scaling
zkAdHoc introduces recursive proof aggregation to generate a constant-size proof for arbitrarily complex computation, enabling scalable on-chain verification.
