The following pages link to (Q4813520):
Displaying 18 items.
- Analyzing anonymity attacks through noisy channels (Q498398) (← links)
- On compositional reasoning about anonymity and privacy in epistemic logic (Q504214) (← links)
- Probabilistic and nondeterministic aspects of anonymity (Q843094) (← links)
- Probable innocence revisited (Q860902) (← links)
- Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security (Q1633451) (← links)
- Information theoretical cryptogenography (Q1698396) (← links)
- A universally composable framework for the privacy of email ecosystems (Q1710670) (← links)
- Conditional anonymity with non-probabilistic adversary (Q1750044) (← links)
- The complex shape of anonymity in cryptocurrencies: case studies from a systematic approach (Q2145387) (← links)
- A novel vertical fragmentation method for privacy protection based on entropy minimization in a relational database (Q2333930) (← links)
- An information-theoretic model of voting systems (Q2389797) (← links)
- Anonymity protocols as noisy channels (Q2482451) (← links)
- Formalization of Entropy Measures in HOL (Q3088009) (← links)
- An Active Global Attack Model for Sensor Source Location Privacy: Analysis and Countermeasures (Q3556630) (← links)
- Anonymity Protocols as Noisy Channels (Q3608463) (← links)
- A Framework for Automatically Checking Anonymity with μCRL (Q3608464) (← links)
- Compositional Methods for Information-Hiding (Q5458378) (← links)
- Evaluation of anonymity and confidentiality protocols using theorem proving (Q5962971) (← links)
