Six Trust Primitives Formalize Security for the Autonomous Agentic Web
A new framework classifies inter-agent trust into six primitives—from cryptographic proof to economic stake—enabling secure, scalable AI agent protocols.
Constant-Size Zero-Knowledge Proofs for Scalable IoT Set Membership Verification
This new OR-aggregation technique yields constant-size zero-knowledge proofs, fundamentally unlocking scalable, privacy-preserving data integrity for IoT networks.
Efficient Byzantine Verifiable Secret Sharing Secures Decentralized Systems Foundationally
EByFTVeS introduces an Adaptive Share Delay Provision strategy to resolve consistency and efficiency burdens in BFT-based Verifiable Secret Sharing, strengthening core cryptographic primitives.
Verifiable Delay Functions Cryptographically Eliminate Frontrunning and Transaction Ordering Attacks
Verifiable Delay Functions Cryptographically Eliminate Frontrunning and Transaction Ordering Attacks
The FIRST framework uses Verifiable Delay Functions to enforce a mandatory pre-execution time lock, making transaction frontrunning probabilistically impossible.
Chameleon Hashing Re-Architects Blockchain Immutability for Scalability and Compliance
A trapdoor hash primitive enables controlled data redaction on-chain, resolving regulatory conflict and improving long-term storage efficiency.
Linear Prover Time Unlocks Scalable Zero-Knowledge Proof Generation
Orion achieves optimal linear prover time and polylogarithmic proof size, resolving the ZKP scalability bottleneck for complex on-chain computation.
Falcon Protocol Achieves Low Latency Asynchronous Byzantine Fault Tolerance
A novel Graded Broadcast mechanism bypasses the agreement stage in aBFT, delivering high throughput and low latency under network uncertainty.
Lookup-Only zkVM Architecture Fundamentally Simplifies and Accelerates Verifiable Computation
Lasso lookup arguments enable Jolt, a zkVM that shifts proving complexity from circuit constraints to efficient table lookups, unlocking new performance ceilings.
Fully Homomorphic Encryption Enables Private Smart Contracts with Offloaded Computation
FHE enables private smart contracts by allowing miners to compute on encrypted data, shifting the cryptographic burden from lightweight users.
