Probabilistic and nondeterministic aspects of anonymity
From MaRDI portal
Publication:2852344
zbMATH Open1273.68268MaRDI QIDQ2852344FDOQ2852344
Authors: Catuscia Palamidessi
Publication date: 8 October 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066106001873
Recommendations
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Internet topics (68M11)
Cited In (12)
- Title not available (Why is that?)
- Anonymity from Asymmetry: New Constructions for Anonymous HIBE
- Probabilistic and nondeterministic aspects of anonymity
- Conditional anonymity with non-probabilistic adversary
- Title not available (Why is that?)
- Weak probabilistic anonymity
- Analyzing anonymity attacks through noisy channels
- CONCUR 2005 – Concurrency Theory
- Probabilistic anonymity via coalgebraic simulations
- Anonymity and k-Choice Identities
- Title not available (Why is that?)
- Non-determinism and Probabilities in Timed Concurrent Constraint Programming
This page was built for publication: Probabilistic and nondeterministic aspects of anonymity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2852344)