Semantic Non-Assembly: Privacy by Architectural Inertness Under Component Exposure

• URL: http://arxiv.org/abs/2606.22311v1
• Date: Sun, 21 Jun 2026 02:40:29 GMT
• Title: Semantic Non-Assembly: Privacy by Architectural Inertness Under Component Exposure
• Abstract summary: We introduce a class of privacy guarantee (Semantic Non-Assembly)<n>In SNA, privacy is characterized not by the difficulty of achieving exposure but by the information yield of exposure when it occurs.<n>This paper formalizes the guarantee and establishes four ProVerif-verified properties.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Existing privacy frameworks emphasize confidentiality, access control, appropriate information flow, or statistical disclosure limitation. We introduce a complementary class of privacy guarantee (Semantic Non-Assembly) in which privacy is characterized not by the difficulty of achieving exposure but by the information yield of exposure when it occurs. SNA prevents evaluation of a designated predicate by preventing any sub-threshold coalition from assembling a sufficient assignment to its input domain. An architecture satisfies Semantic Non-Assembly when no coalition of fewer than a defined threshold of components can assemble such an assignment: complete exposure and decryption of any sub-threshold component yields no actionable data. In the base protocol, the guarantee is structural: it operates through architecture, not policy, and its privacy properties degrade predictably under component compromise rather than collapsing at a single point. The reference instantiation combines this structural guarantee with audited organizational constraints, as characterized in Appendix A. This paper formalizes the guarantee and establishes four ProVerif-verified properties: Device Non-Correlation, Registry Observer Non-Identification, Submission Server Blindness, and Active Defense Gate correctness, the first three through a two-channel provenance architecture. The Birthmark Standard instantiates the guarantee on constrained capture hardware, demonstrating deployability where ZK-based approaches are computationally infeasible. All formal properties and scope limitations are documented in Appendix A.

Related papers

• A distribution-free certification framework for trustworthy crash-severity prediction [1.089614199781423]
  We develop a certification layer that wraps any severity model unmodified.<n>On 5.2 million Texas records across seven base models spanning four decades, the layer attaches identical validity.<n>The framework is released as an open-source package with theorem-level tests.
  arXiv  Detail & Related papers  (2026-09-10T14:20:08Z)
• REAL-OW: Rehearsal-free Open World Object Detection with Low-Rank Adaptation and Dual-Stage Objectness Modeling [56.888597798431704]
  Open-World Object Detection (OWOD) requires detectors to identify previously unseen objects as unknown and incrementally incorporate them into the set of known categories.<n>Existing frameworks rely heavily on exemplar replay to mitigate catastrophic forgetting, but in some real applications, storing raw data conflicts with data access restrictions and leads to data exposure risks.<n>We propose REAL-OW, a novel rehearsal-free framework that decouples incremental knowledge through a collaborative adapter architecture.
  arXiv  Detail & Related papers  (2026-07-03T06:38:54Z)
• A Formal Basis for Quantum Cryptographic Exposure Measurement under HNDL Threat [0.0]
  We show that the functional form of the answer is not merely a calibration choice.<n>It is structurally justified by three assumptions about adversarial production and value-decay dynamics.
  arXiv  Detail & Related papers  (2026-05-21T14:48:26Z)
• Toward Individual Fairness Without Centralized Data: Selective Counterfactual Consistency for Vertical Federated Learning [16.277579974537996]
  We propose a server-centric framework for enforcing selective counterfactual consistency ( SCC-VFL) at the individual level in vertical federated learning (VFL)<n> SCC-VFL maintains or improves predictive accuracy while sharply reducing decision flip rates by up to 98% relative to strong baselines.<n>It also lowers attribute-inference attack success and improves robustness, demonstrating favorable utility-fairness-privacy trade-offs in realistic VFL deployments.
  arXiv  Detail & Related papers  (2026-05-08T01:50:06Z)
• Structural Enforcement of Goal Integrity in AI Agents via Separation-of-Powers Architecture [0.10152838128195464]
  Policy-Execution-Authorization (PEA) architecture is a "separation-of-powers" design that enforces safety at the system level.<n>PEA decouples intent generation, authorization, and execution into independent, isolated layers connected via cryptographically constrained capability tokens.
  arXiv  Detail & Related papers  (2026-04-26T10:31:13Z)
• Rethinking Visual Privacy: A Compositional Privacy Risk Framework for Severity Assessment with VLMs [58.7856837806126]
  Existing visual privacy benchmarks largely treat privacy as a binary property, labeling images as private or non-private based on visible sensitive content.<n>We argue that privacy is fundamentally compositional. Attributes that are benign in isolation may combine to produce severe privacy violations.<n>We introduce the Compositional Privacy Risk Taxonomy (CPRT), a regulation-aware framework that organizes visual attributes according to standalone identifiability and compositional harm potential.
  arXiv  Detail & Related papers  (2026-03-23T04:48:42Z)
• Informationally Compressive Anonymization: Non-Degrading Sensitive Input Protection for Privacy-Preserving Supervised Machine Learning [0.0]
  This paper introduces Informationally Compressive Anonymization (ICA) and the VEIL architecture, a privacy-preserving machine learning framework.<n>ICA embeds a supervised, multi-objective encoder within a trusted Source Environment to transform raw inputs into low-dimensional, task-aligned latent representations.<n>The VEIL architecture enforces strict trust boundaries, supports scalable multi-region deployment, and naturally aligns with privacy-by-design regulatory frameworks.
  arXiv  Detail & Related papers  (2026-03-16T19:17:51Z)
• Proving Circuit Functional Equivalence in Zero Knowledge [4.301822791698451]
  We propose ZK- CEC, the first privacy-preserving framework for hardware formal verification.<n>By combining formal verification and zero-knowledge proof (ZKP), ZK- CEC establishes a foundation for formally verifying IP correctness and security.<n>ZK- CEC successfully verifies practical designs, such as the AES S-Box, within practical time limits.
  arXiv  Detail & Related papers  (2026-01-16T10:43:30Z)
• VoxGuard: Evaluating User and Attribute Privacy in Speech via Membership Inference Attacks [51.68795949691009]
  We introduce VoxGuard, a framework grounded in differential privacy and membership inference.<n>For attributes, we show that simple transparent attacks recover gender and accent with near-perfect accuracy even after anonymization.<n>Our results demonstrate that EER substantially underestimates leakage, highlighting the need for low-FPR evaluation.
  arXiv  Detail & Related papers  (2025-09-22T20:57:48Z)
• Certifiably Byzantine-Robust Federated Conformal Prediction [49.23374238798428]
  We introduce a novel framework Rob-FCP, which executes robust federated conformal prediction effectively countering malicious clients. We empirically demonstrate the robustness of Rob-FCP against diverse proportions of malicious clients under a variety of Byzantine attacks.
  arXiv  Detail & Related papers  (2024-06-04T04:43:30Z)
• Unified Mechanism-Specific Amplification by Subsampling and Group Privacy Amplification [54.1447806347273]
  Amplification by subsampling is one of the main primitives in machine learning with differential privacy. We propose the first general framework for deriving mechanism-specific guarantees. We analyze how subsampling affects the privacy of groups of multiple users.
  arXiv  Detail & Related papers  (2024-03-07T19:36:05Z)
• Is Vertical Logistic Regression Privacy-Preserving? A Comprehensive Privacy Analysis and Beyond [57.10914865054868]
  We consider vertical logistic regression (VLR) trained with mini-batch descent gradient. We provide a comprehensive and rigorous privacy analysis of VLR in a class of open-source Federated Learning frameworks.
  arXiv  Detail & Related papers  (2022-07-19T05:47:30Z)

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.