ACE-GF-based Attestation Relay for PQC - Lightweight Mempool Propagation Without On-Path Proofs

• URL: http://arxiv.org/abs/2603.07982v1
• Date: Mon, 09 Mar 2026 05:41:31 GMT
• Title: ACE-GF-based Attestation Relay for PQC - Lightweight Mempool Propagation Without On-Path Proofs
• Abstract summary: In post-quantum blockchain settings, objects that require validity proofs must be broadcast through mempool and relay networks.<n> STARKs have been proposed to aggregate such proofs so that each node forwards one proof per tick plus objects without proofs, capping per-node proof bandwidth at roughly 128 KB degree per tick.<n>We observe that propagation does not inherently require validity proofs on the path-only a lightweight assurance that an object is eligible for relay.<n>Only the builder (or final verifier) performs a single aggregated validity proof over the set of objects it includes.
• Score: 1.7429038786735553
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In post-quantum blockchain settings, objects that require validity proofs (e.g., blob roots, execution-layer or consensus-layer signature aggregates) must be broadcast through mempool and relay networks. Recursive STARKs have been proposed to aggregate such proofs so that each node forwards one proof per tick plus objects without proofs, capping per-node proof bandwidth at roughly 128 KB degree per tick. We observe that propagation does not inherently require validity proofs on the path-only a lightweight assurance that an object is eligible for relay. We present AR-ACE (ACE-GF-based Attestation Relay for PQC), in which relay nodes forward objects plus compact attestations (e.g., identity-bound signatures or commitments) and do not generate, hold, or forward any full validity proof. Only the builder (or final verifier) performs a single aggregated validity proof over the set of objects it includes. This proof-off-path design removes proof overhead from the propagation path entirely, yielding an order-of-magnitude reduction in proof-related relay bandwidth relative to proof-carrying propagation. When instantiated with ACE-GF-derived attestation keys, AR-ACE preserves a unified identity story with on-chain authorization and is PQC-ready. We specify a protocol model, state design goals and security considerations, define security games, and provide a structural bandwidth comparison with recursive-STARK-based propagation.

Related papers

• From Transient Prompts to Persistent Control: Scientific Poster Generation via Recursive Semantic-Geometric Contracts [67.34566880931716]
  PosterVisor is a control framework that shifts poster generation from transient prompts to persistent control.<n>An Orchestrator grounds rubrics in the paper and visual assets, compiling them into a Semantic-Geometric Contract.<n>Recursive Contract Enforcement (RCE) dynamically triggers checks across stages as evidence emerges.
  arXiv  Detail & Related papers  (2026-09-15T15:32:07Z)
• A Threshold Homomorphic Blockchain Architecture for Secure and Scalable IoT Sensor Data Aggregation [0.9059656093018312]
  This work introduces Phi-PHE-BC, a topology-aware homomorphic blockchain architecture for secure and privacy-preserving IoT sensor data aggregation.<n>Results across topology scaling, validator sensitivity, threshold decryption, and Byzantine-load experiments indicate that Phi-PHE-BC is a practical architecture for secure, privacy-preserving, and topology-aware IoT sensor aggregation.
  arXiv  Detail & Related papers  (2026-08-24T15:41:18Z)
• CUSTOS: Toward Forensic-Ready Zero Trust at the Capture-Containment Boundary [1.1458853556386797]
  CUSTOS is a forensic-ready ZT reference architecture centered on a Forensic Management Point (FMP)<n>An always-on decision record is captured and hash-chained on the gateway at a 1.9-3.0% throughput cost.<n>Results show that forensic-ready ZT requires both an always-on evidentiary floor and bounded reactive capture.
  arXiv  Detail & Related papers  (2026-08-17T19:17:15Z)
• Privacy-Preserving Compliance on Public Ledgers via Selective Disclosure Authorization Schemes [9.133320151595084]
  We develop a cryptographic primitive for granular and revocable compliance checks on public ledgers without revealing the underlying witness.<n>We implement the sender-binding component using a 14-constraint Circom circuit that anchors the zero-knowledge proof to the executing on-chain address.<n>Our Sepolia evaluation confirms practical viability: browser-based proof generation executes in under 200 ms, and on-chain verification costs 240,512 gas, neutralizing proof reuse by different callers while preserving strict attribute privacy.
  arXiv  Detail & Related papers  (2026-06-18T09:38:13Z)
• GoAT-X: A Graph of Auditing Thoughts for Securing Token Transactions in Cross-Chain Contracts [52.51342355102833]
  Cross-chain bridges, the critical infrastructure of the multi-chain ecosystem, have become a primary target for attackers.<n>Existing defenses, such as bytecode-level static analysis, are ill-equipped to handle the semantic complexity of cross-chain interactions.<n>We propose GoAT-X, a framework that shifts automated cross-chain smart contracts auditing from pattern matching toward systematic first-principles verification.
  arXiv  Detail & Related papers  (2026-04-27T11:34:21Z)
• Compiling Activation Steering into Weights via Null-Space Constraints for Stealthy Backdoors [48.881343993730844]
  Safety-aligned large language models (LLMs) are increasingly deployed in real-world pipelines.<n> adversaries can distribute backdoored checkpoints that behave normally under standard evaluation but jailbreak when a hidden trigger is present.<n>Recent post-hoc weight-editing methods offer an efficient approach to injecting such backdoors.
  arXiv  Detail & Related papers  (2026-04-14T06:48:33Z)
• ZK-ACE: Identity-Centric Zero-Knowledge Authorization for Post-Quantum Blockchain Systems [1.7429038786735553]
  ZK-ACE is an authorization layer that replaces transaction-carried signature objects with identity-bound zero-knowledge authorization statements.<n>We formalize ZK-ACE with explicit game-based security definitions for authorization soundness, replay resistance, substitution resistance, and cross-domain separation.<n>A structural, protocol-level data accounting demonstrates an order-of-magnitude reduction in consensus-visible authorization data relative to direct post-quantum signature deployment.
  arXiv  Detail & Related papers  (2026-03-09T05:21:44Z)
• Proof of Trusted Execution: A Consensus Paradigm for Deterministic Blockchain Finality [0.391985484065646]
  We propose Proof of Trusted Execution (PoTE), a consensus paradigm where agreement emerges from verifiable execution rather than replicated re-execution.<n>Because the execution is deterministic and the proposer is uniquely derived from public randomness, PoTE avoids forks, eliminates slot.time bottlenecks, and commits blocks in a single round of verification.
  arXiv  Detail & Related papers  (2025-12-10T08:04:38Z)
• Quantum-Adversary-Resilient Evidence Structures and Migration Strategies for Regulated AI Audit Trails [0.0]
  Constant-size cryptographic evidence records are increasingly used to build audit trails for regulated AI workloads in clinical, pharmaceutical, and financial settings.<n>Existing instantiations, however, rely on classical signature schemes whose long-term security is threatened by quantum-capable adversaries.<n>This paper formalizes security notions for evidence structures in the presence of quantum adversaries and study post-quantum instantiations and migration strategies for deployed audit logs.
  arXiv  Detail & Related papers  (2025-11-27T12:57:44Z)
• A Fano-Style Accuracy Upper Bound for LLM Single-Pass Reasoning in Multi-Hop QA [65.38186593873313]
  Multi-Hop Question Answering (MHQA) requires integrating dispersed, interdependent evidence through sequential reasoning under noise.<n>We introduce a proof-of-concept multi-call framework for MHQA, InfoQA.<n>We construct a stringent and noise-rich benchmark to validate our theory and framework.
  arXiv  Detail & Related papers  (2025-09-25T14:11:57Z)
• Automated Proof Generation for Rust Code via Self-Evolution [69.25795662658356]
  We introduce SAFE, a framework that overcomes the lack of human-written snippets to enable automated proof generation of Rust code.<n> SAFE re-purposes the large number of synthesized incorrect proofs to train the self-ging capability of the fine-tuned models.<n>We achieve a 52.52% accuracy rate in a benchmark crafted by human experts, a significant leap over GPT-4o's performance of 14.39%.
  arXiv  Detail & Related papers  (2024-10-21T08:15:45Z)
• QuTE: decentralized multiple testing on sensor networks with false discovery rate control [93.1040521878626]
  This paper designs methods for decentralized multiple hypothesis testing on graphs equipped with provable guarantees on the false discovery rate (FDR)<n>We consider the setting where distinct agents reside on the nodes of an undirected graph, and each agent possesses p-values corresponding to one or more hypotheses local to its node.<n>Each agent must individually decide whether to reject one or more of its local hypotheses by only communicating with its neighbors, with the joint aim that the global FDR over the entire graph must be controlled at a predefined level.
  arXiv  Detail & Related papers  (2022-10-09T19:48:39Z)
• Interpretable Proof Generation via Iterative Backward Reasoning [37.03964644070573]
  We present IBR, an Iterative Backward Reasoning model to solve the proof generation tasks on rule-based Question Answering (QA) We handle the limitations of existed works in two folds: 1) enhance the interpretability of reasoning procedures with detailed tracking, by predicting nodes and edges in the proof path iteratively backward from the question; 2) promote the efficiency and accuracy via reasoning on the elaborate representations of nodes and history paths, without any intermediate texts that may introduce external noise during proof generation.
  arXiv  Detail & Related papers  (2022-05-22T02:44:14Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• Post-Quantum VRF and its Applications in Future-Proof Blockchain System [13.386254282693335]
  A verifiable random function (VRF) is a powerful pseudo-random function that provides a non-interactively public verifiable proof for the correctness of its output. We propose a generic compiler to obtain the post-quantum VRF from the simple VRF solution using symmetric-key primitives. We show potential applications of a quantum-secure VRF, such as quantum-secure decentralized random beacon and lottery-based proof of stake consensus blockchain protocol.
  arXiv  Detail & Related papers  (2021-09-05T07:10:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.