arXiv (All)
open access
Verification of $K$- and Infinite-Step Strong/Weak Anonymity Using Concurrent Compositions
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 estimat
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Copy-Protection with Correlated Challenges: Point Functions and More via Decisional Coset Monogamy#467076
- CQS: A formally-verified framework for fair and abortable synchronization#344765
- A-COMPASS: Formal Foundations for Anonymity Analysis in Microdata#290515
- New principles and instruments in the field of Data Protection Law#461920
- MultiBallot: Verifiable and privacy-preserving E-Collecting in the Swiss setting#204724
Record · ID 821157
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive