Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 15 of 24.

Add to Quick Collection   All 24 Results

Sort:
 Add All Items to Quick Collection
Date: 2016
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1151908
Description: Quantitative information flow aims to assess and control the leakage of sensitive information by computer systems. A key insight in this area is that no single leakage measure is appropriate in all op ... More
Reviewed: Reviewed
Date: 2015
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1049188
Description: Hidden Markov Models, HMM's, are mathematical models of Markov processes whose state is hidden but from which information can leak via channels. They are typically represented as 3-way joint probabili ... More
Reviewed: Reviewed
Date: 2015
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/328102
Description: 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 pro ... More
Reviewed: Reviewed
Date: 2014
Subject Keyword: 080300 Computer Software
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/303620
Description: The observable output of a probabilistic system that processes a secret input might reveal some information about that input. The system can be modelled as an information-theoretic channel that specif ... More
Reviewed: Reviewed
Date: 2014
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/339851
Description: Protecting sensitive information from improper disclosure is a fundamental security goal. It is complicated, and difficult to achieve, often because of unavoidable or even unpredictable operating cond ... More
Reviewed: Reviewed
Date: 2014
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/303641
Description: Electronic voting is rich with paradoxes. How can a voter verify that his own vote has been correctly counted, but at the same time be prevented from revealing his vote to a third party? Not only is t ... More
Reviewed: Reviewed
Date: 2012
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/190328
Description: We propose a novel domain-theoretic model for nondeterminism, probability and hidden state, with relations on it that compare information flow. One relation is Smyth-like, based on a structural, refin ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148088
Description: We give a quantitative sequential model for noninterference security with probability (but not demonic choice), and a novel refinement order that we prove to be the greatest compositional relation con ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1228448
Description: We present a constraint-based method for automatically generating quantitative invariants for linear probabilistic programs, and we show how it can be used, in combination with proof-based methods, to ... More
Reviewed: Reviewed
Date: 2009
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/148619
Description: Security and probability are both artefacts that we hope to bring increasingly within the reach of refinement-based Formal Methods; although we have worked on them separately, in the past, the goal ha ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/25042
Description: The μ-calculus is a powerful tool for specifying and verifying transition systems, including those with both demonic (universal) and angelic (existential) choice; its quantitative generalization qMμ e ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/9656
Description: The quantitative μ-calculus qMμ extends the applicability of Kozen's standard μ-calculus [D. Kozen, Results on the propositional μ-calculus, Theoretical Computer Science 27 (1983) 333–354] to probabil ... More
Reviewed: Reviewed
Date: 2006
Language: eng
Resource Type: book chapter
Identifier: http://hdl.handle.net/1959.14/10711
Description: As explained in Chapter 1, Dijkstra’s guarded-command language, which we call <i>GCL</i>, was introduced as an intellectual framework for rigorous reasoning about imperative sequential programs; one o ... More
Date: 2005
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1129909
Description: 7 page(s)
Reviewed: Reviewed
Date: 2005
Language: eng
Resource Type: book
Identifier: http://hdl.handle.net/1959.14/6448
Description: The book is a focused survey on probabilistic program semantics, conceived to tell a coherent story with a uniform notation. It is grouped into three themes: Part I is for 'users' of the techniques wh ... More