First-Price Auction with Equal Sharing Secures Leaderless Blockchain Transaction Fees
A novel first-price auction mechanism for leaderless blockchains ensures fair transaction fee distribution, fostering robust, decentralized block production.
Formalizing MEV with an Abstract Model for Enhanced Blockchain Security
This research establishes a foundational theory of Maximal Extractable Value using an abstract blockchain model, enabling rigorous security proofs against economic manipulation.
Decentralized Accountable Private Threshold Signatures Enhance System Trust
DeTAPS introduces decentralized, dynamically accountable, and private threshold signatures, enabling robust, privacy-preserving operations for distributed systems.
Formalizing Permissionless Consensus Economic Security with Attack Cost Metrics
This research introduces a novel economic security framework, the EAAC property, to rigorously quantify attack costs in permissionless blockchains, ensuring protocol resilience.
Redactable Blockchains: Bridging Immutability with Dynamic Data Management
This research introduces redactable blockchains, leveraging chameleon hash functions to enable controlled, auditable data modification while preserving ledger integrity for regulatory compliance and error correction.
TrustDefender: Verifiable Deepfake Detection with Privacy-Preserving Zero-Knowledge Proofs
A novel framework merges real-time CNN deepfake detection with zero-knowledge proofs, enabling privacy-preserving verification for extended reality applications.
Hierarchical Vector Commitments Enable Scalable Dynamic Data Authenticity
This work introduces Hierarchical Vector Commitments, a cryptographic primitive enabling constant-sized proofs for dynamic data authenticity across complex decentralized architectures.
Voting Consensus Enhances Performance for Consortium Blockchain Applications
This paper introduces an efficient voting-based consensus for consortium blockchains, boosting performance and expanding decentralized application utility.
Optimizing Communication for Secure Multi-Party Computation with Aborts
New protocols drastically reduce communication overhead in secure multi-party computation with selective aborts, enhancing practicality for decentralized applications.
