Searching for "Modelling Unlinkability." – sorted by Relevance.
-
Does Additional Information Always Reduce Anonymity? ABSTRACT
- generally to model unlinkability. Proposals using other flavors of entropy have followed. Tóth et al. [18
- Cited by 2 (1 self) – Add To MetaCart
-
A-Ordered Tableaux
- of "Unlinked" by definition of J and by Proposition 1. By Herbrand's Theorem I [ J is as well a model
- Add To MetaCart
-
A-Ordered Tableaux
- of "Unlinked". In the clausal case I [ J clearly constitutes already a model of H. In the NNF case we show
- Cited by 20 (10 self) – Add To MetaCart
-
Revisiting a Combinatorial Approach Toward Measuring Anonymity ABSTRACT
- to model unlinkability [11] and in the context of disclosure attacks [1]. We revisit Edman et al.’s system
- Add To MetaCart
-
Formatting Structured Documents
- specified in [3] and in ODA and DSSSL). In addition, a physical structure model (unlinked with the DTD) can
- Add To MetaCart

