A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Compositional Closure for Bayes Risk in Probabilistic Noninterference
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
closure-with respect to our semantics and an "elementary" order based on Bayes Risk. ...
Testing for security: Bayes Risk Our earlier Shadow semantics for noninterference and demonic choice [11, 12] showed that reconciling non-interference with refinement is tantamount to giving an adversary ...
Our technical contribution is that we (i) give a sequential semantics for probabilistic non-interference, (ii) define the order () based on Bayes Risk, (iii) show it is not compositional, (iv) identify ...
doi:10.1007/978-3-642-14162-1_19
fatcat:l6ol4exhcvhcdaify3mr4yb3aq
Compositional closure for Bayes Risk in probabilistic noninterference
[article]
2010
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
"elementary" order based on Bayes Risk --- a security measure already in widespread use. ...
The appropriateness of our model and order is supported by our showing that our refinement order is the greatest compositional relation --the compositional closure-- with respect to our semantics and an ...
In summary, our technical contribution is that we (i) give a sequential semantics for probabilistic noninterference, (ii) define the above order ( ) based on Bayes Risk, (iii) show it is not compositional ...
arXiv:1007.1054v1
fatcat:euvbk27envg3ddvysmh5o6jscu
Hidden-Markov program algebra with iteration
2014
Mathematical Structures in Computer Science
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2011 pre-print arXiv:1102.0333v1 fatcat:rbdfohc3irbermfmypdv2ymonq
We use Hidden Markov Models to motivate a quantitative compositional semantics for noninterference-based security with iteration, including a refinement- or "implements" relation that compares two programs ...
A selection of algebraic laws is given to support this view in the case of quantitative noninterference; and it is demonstrated on a simple iterated password-guessing attack. ...
Define analogously ( br ) for comparing conditional Bayes Risk of outputs, in the same way; it is not compositional either. 7 The refinement relation ( ) introduced earlier [27] , and extended here ...
doi:10.1017/s0960129513000625
fatcat:si5oy4w2w5gjzmd4m543c27ajm
Quantitative Security Analysis (Dagstuhl Seminar 12481)
2013
Dagstuhl Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Corresponding quantitative security analyses bear the potential of becoming an important tool for the rigorous development of practical systems, and a formal foundation for the management of security risks ...
Unfortunately, security is often in conflict with requirements on the functionality or the performance of a system, making perfect security an impossible or overly expensive goal. ...
URL http://dx.doi.org/10.1007/978-3-642-22110-1_47 1 McIver, AK, Meinicke, LA, Morgan CC.Compositional closure for Bayes Risk in probabilistic noninterference.Proc.ICALP 2010.http://dx.doi.org/10.1007/ ...
doi:10.4230/dagrep.2.11.135
dblp:journals/dagstuhl-reports/KopfMP12
fatcat:zlrdsjynqnfv3ehvlybivdnwre
Formal approaches to information hiding: An analysis of interactive systems, statistical disclosure control, and refinement of specifications
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
We apply quantitative approaches to information flow in the first two cases, and we propose improvements for the usual solutions based on process equivalences for the third case. ...
We show that, in the presence of nondeterminism, this approach may rely on the assumption that the scheduler "works for the benefit of the protocol", and this is often not a safe assumption. ...
and Bayes risk. ...
arXiv:1111.3013v3
fatcat:g65h6p4xsfe6xnxbhpwkksyjaq
SoK: Differential Privacy as a Causal Property
2020
2020 IEEE Symposium on Security and Privacy (SP)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We believe this characterization resolves disagreement and confusion in prior work about the consequences of differential privacy. ...
Acknowledgements: We thank Arthur Azevedo de Amorim, Deepak Garg, Ashwin Machanavajjhala, and Frank McSherry for comments on this work. ...
The opinions in this paper are those of the authors and do not necessarily reflect the opinions of any funding sponsor or the United States Government. ...
doi:10.1109/sp40000.2020.00012
dblp:conf/sp/TschantzSD20
fatcat:be6ydy22nvfktfv66ydtsizvga
Differential Privacy as a Causal Property
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2018 pre-print arXiv:1710.05899v2 fatcat:ot4jmx3jm5gdblqgact4ew3wguOther Versions
We believe this characterization resolves disagreement and confusion in prior work about the consequences of differential privacy. ...
We thank Arthur Azevedo de Amorim, Ashwin Machanavajjhala, and Frank McSherry for comments on earlier versions of this work. We thank Deepak Garg for conversations about causation. ...
The opinions in this paper are those of the authors and do not necessarily reflect the opinions of any funding sponsor or the United States Government. ...
arXiv:1710.05899v3
fatcat:bq7gyuyjbnc5jfwgrrficpoj6i
An Algebraic Approach for Reasoning About Information Flow
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Finally, we use the algebra to justify a new algorithm to compute leakage bounds for this protocol. ...
We address the problem of specifying and analyzing large systems in the (standard) channel model used in quantitative information flow (QIF). ...
In: Proc. of FOSSACS. Volume 5504 of LNCS., Springer (2009) 288-302 7. McIver, A., Meinicke, L., Morgan, C.: Compositional closure for bayes risk in probabilistic noninterference. In: Proc. of ICALP. ...
arXiv:1801.08090v4
fatcat:v57hfpv3rbb63lgwcpazllhn4i
Online) International Journal of Network Security is published both in traditional paper form (ISSN 1816-353X) and in Internet
2018
International Journal of Network Security
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Finally, we propose the future work of data hiding in compressed images. ...
Nowadays, data hiding in compressed images becomes more and more popular because of the rise of the social media. ...
He also thanks David Jao for suggestions (i) to formalize the definition of UBSS (ii) to give a careful thought to its applications (iii) to state the isogeny problems in a general form and (iv) to improve ...
fatcat:l5qol3fgizghrkdel7sgt3qz6q
Correct and Efficient Accelerator Programming (Dagstuhl Seminar 13142)
2013
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In the last part I also mention an algorithm of Drysdale, Rote, and Sturm [1] for smooth (tangent-continuous) approximation by biarcs. ...
We implemented our parallel algorithms on top of the probabilistic model checker PRISM. ...
Pointer Analysis for Probabilistic Noninterference Probabilistic noninterference (PN) is the established technical criterion for IFC of concurrent programs operating on shared memory. ...
fatcat:m7452gw4cvecbd2vi6w3uha5ai