Pages that link to "Item:Q2805152"
From MaRDI portal
The following pages link to Quantitative Notions of Leakage for One-try Attacks (Q2805152):
Displaying 15 items.
- Min-entropy as a resource (Q385717) (← links)
- Analyzing anonymity attacks through noisy channels (Q498398) (← links)
- Information hiding in probabilistic concurrent systems (Q549174) (← links)
- Searching secrets rationally (Q899474) (← links)
- An algebraic approach for reasoning about information flow (Q2024334) (← links)
- A better composition operator for quantitative information flow analyses (Q2167722) (← links)
- Quantifying leakage in the presence of unreliable sources of information (Q2361344) (← links)
- Quantitative information flow as safety and liveness hyperproperties (Q2453117) (← links)
- Worst- and average-case privacy breaches in randomization mechanisms (Q2517234) (← links)
- On the Relation between Differential Privacy and Quantitative Information Flow (Q3012909) (← links)
- Information Theory and Security: Quantitative Information Flow (Q3575030) (← links)
- Generalized Differential Privacy: Regions of Priors That Admit Robust Optimal Mechanisms (Q5418970) (← links)
- Asymptotic information leakage under one-try attacks (Q5740624) (← links)
- Hidden-Markov program algebra with iteration (Q5740625) (← links)
- Masking primal and dual models for data privacy in network revenue management (Q6112568) (← links)
