Verification of $K$- and Infinite-Step Strong/Weak Anonymity Using Concurrent Compositions

• URL: http://arxiv.org/abs/2609.01192v1
• Date: Tue, 01 Sep 2026 13:03:52 GMT
• Title: Verification of $K$- and Infinite-Step Strong/Weak Anonymity Using Concurrent Compositions
• Abstract summary: In this paper, we lucubrate $K$- and infinite-step anonymity for partially-observed discrete-event systems modeled by non-deterministic finite-state automata.<n>First, we define two strong types and two weak types of $K$- and infinite-step anonymity that are fundamentally different from the existing notions of $K$- and infinite-step anonymity due to the consideration of strong and weak anonymous projections.
• Score: 38.32370955322664
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Anonymity is an information flow property that provides privacy protection in the sense of non-uniqueness of system information at certain moments with respect to observations. The notion of $K$-step anonymity in the context of discrete-event systems characterizes the scenario that the state estimates cannot be a singleton within at most $K$ observational steps prior to the current instant, while infinite-step anonymity is the same as $K$-step anonymity without considering the limit on $K$. In this paper, we lucubrate $K$- and infinite-step anonymity for partially-observed discrete-event systems modeled by non-deterministic finite-state automata. First, we define two strong types and two weak types of $K$- and infinite-step anonymity that are fundamentally different from the existing notions of $K$- and infinite-step anonymity due to the consideration of strong and weak anonymous projections. Then, we develop a new methodology by exploiting the concurrent-composition technique to verify these four types of anonymity. Based on the constructed concurrent compositions, verifiable necessary and sufficient conditions for the four types of anonymity are provided, along with their complexity analysis. Finally, the upper bounds on $K$ for $K$-step strong anonymity and weak anonymity are computed.

Related papers

• ε-Indistinguishability In Moving Target Defense: Framework, Algorithms, And Cloud Case Studies [4.514651886293108]
  Moving Target Defense assumes its pool of candidate configurations is safe to cycle among.<n>We formalize this pool-safety problem as finding the largestdistinguishvarepsilon-close subset of the Cartesian product of per-component implementation choices.
  arXiv  Detail & Related papers  (2026-07-15T04:52:47Z)
• DARTIC: Decentralized Anonymous Reputation at Scale for Trustworthy Crowdsourcing [3.7091556547212843]
  DARTIC is a decentralized, anonymous, and scalable reputation-driven framework for crowdsourcing.<n>We introduce zkSNARK-based set membership proofs, cryptographically binding all user pseudonyms to a single access token without revealing the linkage.<n>Results show that anonymity, robust reputation binding, and scalability can be jointly achieved in fully decentralized crowdsourcing systems.
  arXiv  Detail & Related papers  (2026-05-18T09:52:11Z)
• 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)
• Lattice-Based Dynamic $k$-Times Anonymous Authentication [12.008179370101539]
  $k$-times anonymous authentication ($k$-TAA) scheme allows members of a group to be authenticated anonymously by application providers up to $k$ times.<n>Considering quantum computing attacks, lattice-based $k$-TAA was introduced.<n>First lattice-based dynamic $k$-TAA offers limited times anonymous authentication, dynamic member management, and post-quantum security.
  arXiv  Detail & Related papers  (2025-09-26T02:42:31Z)
• Self-Refining Language Model Anonymizers via Adversarial Distillation [48.280759014096354]
  We introduce SElf-refining Anonymization with Language model (SEAL)<n>SEAL is a novel distillation framework for training small language models (SLMs) to perform effective anonymization without relying on external models at inference time.<n>Experiments on SynthPAI, a dataset of synthetic personal profiles and text comments, demonstrate that SLMs trained with SEAL achieve substantial improvements in anonymization capabilities.
  arXiv  Detail & Related papers  (2025-06-02T08:21:27Z)
• iFADIT: Invertible Face Anonymization via Disentangled Identity Transform [51.123936665445356]
  Face anonymization aims to conceal the visual identity of a face to safeguard the individual's privacy.<n>This paper proposes a novel framework named iFADIT, an acronym for Invertible Face Anonymization via Disentangled Identity Transform.
  arXiv  Detail & Related papers  (2025-01-08T10:08:09Z)
• Disentangle Before Anonymize: A Two-stage Framework for Attribute-preserved and Occlusion-robust De-identification [55.741525129613535]
  "Disentangle Before Anonymize" is a novel two-stage Framework(DBAF)<n>This framework includes a Contrastive Identity Disentanglement (CID) module and a Key-authorized Reversible Identity Anonymization (KRIA) module.<n>Extensive experiments demonstrate that our method outperforms state-of-the-art de-identification approaches.
  arXiv  Detail & Related papers  (2023-11-15T08:59:02Z)
• Guaranteeing Anonymity in Attribute-Based Authorization [3.2697504912958633]
  Attribute-based methods make decisions based on attributes possessed by a subject rather than the subject's identity. While this allows for anonymous authorization, it does not guarantee anonymity. Other approaches to achieving anonymity in attribute-based authorization do not address this attribute distribution problem.
  arXiv  Detail & Related papers  (2023-10-07T19:09:17Z)
• Smooth Anonymity for Sparse Graphs [69.1048938123063]
  differential privacy has emerged as the gold standard of privacy, however, when it comes to sharing sparse datasets. In this work, we consider a variation of $k$-anonymity, which we call smooth-$k$-anonymity, and design simple large-scale algorithms that efficiently provide smooth-$k$-anonymity.
  arXiv  Detail & Related papers  (2022-07-13T17:09:25Z)

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.