VA-DAR: A PQC-Ready, Vendor-Agnostic Deterministic Artifact Resolution for Serverless, Enumeration-Resistant Wallet Recovery

• URL: http://arxiv.org/abs/2603.02690v1
• Date: Tue, 03 Mar 2026 07:33:10 GMT
• Title: VA-DAR: A PQC-Ready, Vendor-Agnostic Deterministic Artifact Resolution for Serverless, Enumeration-Resistant Wallet Recovery
• Abstract summary: VA-DAR is a keyed-discovery protocol for ACE-GF-based wallets.<n>It supports cross-device recovery using only a user-provided identifier and a single recovery passphrase.
• Score: 1.7429038786735553
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Serverless wallet recovery must balance portability, usability, and privacy. Public registries enable decentralized lookup but naive identifier hashing leaks membership through enumeration. We present VA-DAR, a keyed-discovery protocol for ACE-GF-based wallets that use device-bound passkeys for day-to-day local unlock while supporting cross-device recovery using only a user-provided identifier (e.g., email) and a single recovery passphrase. As a discovery-and-recovery layer over ACE-GF, VA-DAR inherits ACE-GF's context-isolated, algorithm-agile derivation substrate, enabling non-disruptive migration to post-quantum algorithms at the identity layer. The design introduces a decentralized discovery-and-recovery layer that maps a privacy-preserving discovery identifier to an immutable content identifier of a backup sealed artifact stored on a decentralized storage network. Concretely, a user derives passphrase-rooted key material with a memory-hard KDF, domain-separates keys for artifact sealing and discovery indexing, and publishes a registry record keyed by a passphrase-derived discovery identifier. VA-DAR provides: (i) practical cross-device recovery using only identifier and passphrase, (ii) computational resistance to public-directory enumeration, (iii) integrity of discovery mappings via owner authorization, and (iv) rollback/tamper detection via monotonic versioning and artifact commitments. We define three sealed artifact roles, two update-authorization options, and three protocol flows (registration, recovery, update). We formalize security goals via cryptographic games and prove, under standard assumptions, that VA-DAR meets these goals while remaining vendor-agnostic and chain-agnostic. End-to-end post-quantum deployment additionally requires a PQ-secure instantiation of registry authorization.

Related papers

• KeyPooling: Measuring Where LLM API Relay Paths Collapse Prompt Cache Isolation [53.952294884822955]
  Large language model (LLM) API relays authenticate customers separately but often forward requests through shared provider credentials.<n>We present KeyPooling, a measurement method that traces customer identity through cache lookup and write.<n>We derive a defense contract: every customer must enter a provider-enforced domain.
  arXiv  Detail & Related papers  (2026-08-18T08:12:34Z)
• Vaulted Passkeys: A Device-Bound Proposal for Authenticated Credential Export and Import [0.6091702876917279]
  Existing guidance for device-bound credentials commonly reduces recovery risk by registering an additional authenticator before failure.<n>This paper addresses the resulting recovery gap by exporting protected credential state while the source is available and restoring it to hardware acquired later.<n>We propose Vaulted Passkeys, a device-bound architecture in which a random 256-bit Kvault protects authenticated PKV1 credential envelopes through HKDF-separated keys and four explicit AEAD profiles.
  arXiv  Detail & Related papers  (2026-08-13T22:32:49Z)
• Send the Key in Cleartext: Halving Key Consumption while Preserving Unconditional Security in QKD Authentication [59.664950447941386]
  Quantum Key Distribution (QKD) protocols require Information-Theoretically Secure (ITS) authentication of the classical channel to preserve the unconditional security of the distilled key.<n>Since QKD requires mutual authentication, two independent one-time keys are typically consumed per round, imposing a non-trivial overhead on the net secure key rate.<n>We present a novel ITS authentication scheme based on $varepsilon$-Almost Strongly Universal$ ($varepsilon$-ASU$)
  arXiv  Detail & Related papers  (2026-03-26T14:36:05Z)
• 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)
• Condition-Triggered Cryptographic Asset Control via Dormant Authorization Paths [1.7429038786735553]
  Control of encrypted digital assets is traditionally equated with permanent possession of private keys.<n>We introduce Condition-Triggered Dormant Authorization Paths (CT-DAP)<n>CT-DAP is a cryptographic asset control method built on destructible authorization factors.
  arXiv  Detail & Related papers  (2026-03-09T03:57:06Z)
• A Privacy Protocol Using Ephemeral Intermediaries and a Rank-Deficient Matrix Power Function (RDMPF) [0.0]
  This paper presents a private transfer architecture for the Internet Computer (ICP)<n>It decouples deposit and retrieval through two short-lived intermediaries, with sealed storage and attested by an ephemeral witness.<n>The protocol uses a non-interactive RDMPF-based encapsulation to derive per-transfer transport keys.
  arXiv  Detail & Related papers  (2025-12-29T15:19:09Z)
• Binding Agent ID: Unleashing the Power of AI Agents with accountability and credibility [46.323590135279126]
  BAID (Binding Agent ID) is a comprehensive identity infrastructure establishing verifiable user-code binding.<n>We implement and evaluate a complete prototype system, demonstrating the practical feasibility of blockchain-based identity management and zkVM-based authentication protocol.
  arXiv  Detail & Related papers  (2025-12-19T13:01:54Z)
• Beyond Inference Intervention: Identity-Decoupled Diffusion for Face Anonymization [55.29071072675132]
  Face anonymization aims to conceal identity information while preserving non-identity attributes.<n>We propose textbfIDsuperscript2Face, a training-centric anonymization framework.<n>We show that IDtextsuperscript2Face outperforms existing methods in visual quality, identity suppression, and utility preservation.
  arXiv  Detail & Related papers  (2025-10-28T09:28:12Z)
• Threat Modeling for Enhancing Security of IoT Audio Classification Devices under a Secure Protocols Framework [0.22369578015657954]
  We present a security protocol that treats the edge device, cellular network and cloud as three separate trust domains.<n>A STRIDE-driven threat model and attack-tree analysis guide the design.<n>Data in transit is protected by TLS 1.3 and hybridised with Kyber and Dilithium to provide post-quantum resilience.
  arXiv  Detail & Related papers  (2025-09-18T06:25:50Z)
• Wrangling Entropy: Next-Generation Multi-Factor Key Derivation, Credential Hashing, and Credential Generation Functions [47.715495058757824]
  We present a novel cryptanalytic technique designed to reveal pernicious leaks of entropy across multiple invocations of a cryptographic key derivation or hash function.<n>We show that it can be used to correctly identify each of the known vulnerabilities in the original MFKDF construction.<n>We propose a new construction for MFKDF2,'' a next-generation multi-factor key derivation function that can be proven to be end-to-end secure.
  arXiv  Detail & Related papers  (2025-09-07T02:01:53Z)
• Secret-Key Generation from Private Identifiers under Channel Uncertainty [26.670481652490267]
  This study investigates secret-key generation for device authentication using physical identifiers.<n>The system includes two legitimate terminals (encoder and decoder) and an eavesdropper (Eve)<n>Our contributions include deriving inner and outer bounds on the optimal trade-off among secret-key, storage, and privacy-leakage rates for general discrete sources.
  arXiv  Detail & Related papers  (2025-03-11T17:20:48Z)
• Towards Copyright Protection for Knowledge Bases of Retrieval-augmented Language Models via Reasoning [58.57194301645823]
  Large language models (LLMs) are increasingly integrated into real-world personalized applications.<n>The valuable and often proprietary nature of the knowledge bases used in RAG introduces the risk of unauthorized usage by adversaries.<n>Existing methods that can be generalized as watermarking techniques to protect these knowledge bases typically involve poisoning or backdoor attacks.<n>We propose name for harmless' copyright protection of knowledge bases.
  arXiv  Detail & Related papers  (2025-02-10T09:15:56Z)
• SLVC-DIDA: Signature-less Verifiable Credential-based Issuer-hiding and Multi-party Authentication for Decentralized Identity [21.498265818902464]
  Verifiable Credential techniques are used to facilitate decentralized DID-based access control across multiple entities.<n>Existing DID schemes generally rely on a distributed public key infrastructure that also causes challenges.<n>This paper proposes a Permanent-Hiding (PIH)-based DID-based multi-party authentication framework with a signature-less VC model, named SLVC-DIDA.
  arXiv  Detail & Related papers  (2025-01-19T13:58:01Z)
• Quantum Authenticated Key Expansion with Key Recycling [1.274819629555637]
  We present a quantum authentication key expansion protocol that integrates both authentication and key expansion within a single protocol. We analyse the security of the protocol in a QAKE framework adapted from a classical authentication key exchange framework.
  arXiv  Detail & Related papers  (2024-09-25T01:29:13Z)
• Publicly-Verifiable Deletion via Target-Collapsing Functions [81.13800728941818]
  We show that targetcollapsing enables publiclyverifiable deletion (PVD) We build on this framework to obtain a variety of primitives supporting publiclyverifiable deletion from weak cryptographic assumptions.
  arXiv  Detail & Related papers  (2023-03-15T15:00:20Z)
• 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)
• Open-set Adversarial Defense [93.25058425356694]
  We show that open-set recognition systems are vulnerable to adversarial attacks. Motivated by this observation, we emphasize the need of an Open-Set Adrial Defense (OSAD) mechanism. This paper proposes an Open-Set Defense Network (OSDN) as a solution to the OSAD problem.
  arXiv  Detail & Related papers  (2020-09-02T04:35:33Z)

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.