Optimal Prover Time and Succinct Zero-Knowledge Proofs Simultaneously Achieved
Libra achieves linear prover complexity with polylogarithmic verification time, unlocking practical, scalable zero-knowledge computation.
Dependency Graphs and LLMs Enhance Formal Smart Contract Verification
SmartHalo framework uses Dependency Graphs and Large Language Models to semantically enrich decompiled bytecode, making formal verification of deployed contracts scalable and precise.
Decentralized Trapdoor VDF Enables Accountable, Consistent Redactable Blockchains
Introducing the Decentralized Trapdoor VDF, this primitive resolves the immutability-redaction conflict, unlocking regulatory-compliant blockchain architectures.
Zero-Knowledge STARKs Secure Scalable Trustless Decentralized Identity Revocation
Integrating zk-STARKs with cryptographic accumulators creates a post-quantum, trustless framework for verifiable identity and scalable private credential revocation.
Threshold Cryptography and Blockchain Secure Decentralized Location and Query Privacy
A dual-protection framework integrates Shamir's secret sharing with a token-incentivized private chain to secure both location and query data in LBS.
Cryptographic Second Price Auctions Secure Transaction Ordering and Mitigate Adversarial MEV
Encrypting transaction bids via a Cryptographic Second Price Auction formally decouples miner revenue from user incentives, ensuring provably fair block construction.
Decoupling Commitment and Coding Secures Data Availability with Stronger Assurance
A new data availability sampling paradigm commits to uncoded data, using on-the-fly network coding to provide orders of magnitude stronger verification assurance.
Constant-Time Vector Commitment Decouples Prover Work from Circuit Size
This new Constant-Time Vector Commitment scheme shifts prover complexity to pre-processing, enabling $O(1)$ online proofs for massive circuits.
Logarithmic Accumulators Enable Constant-Size Stateless Blockchain Verification
A new cryptographic accumulator compresses massive state into a constant-size proof, unlocking efficient stateless clients and scalable data availability.
