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

arXiv:2609.01192 · cs.FL, cs.CR · Submitted 2026-09-01 · Read on arXiv

cs.FL, cs.CR

Submitted: 2026-09-01

Updated: 2026-09-01

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Verification — 30× in this paper · explained in 2 episodes
• Abstraction — 1× in this paper · explained in 1 episode
• Accuracy — 1× in this paper · explained in 1 episode
• Verifier — 1× in this paper · explained in 2 episodes

Related papers

• Positive-Data Learning of Fixed-Observation Linear MCFGs from Working Binary Presentations