5,436 research outputs found
Measuring Information Leakage using Generalized Gain Functions
International audienceThis paper introduces g-leakage, a rich general- ization of the min-entropy model of quantitative information flow. In g-leakage, the benefit that an adversary derives from a certain guess about a secret is specified using a gain function g. Gain functions allow a wide variety of operational scenarios to be modeled, including those where the adversary benefits from guessing a value close to the secret, guessing a part of the secret, guessing a property of the secret, or guessing the secret within some number of tries. We prove important properties of g-leakage, including bounds between min-capacity, g-capacity, and Shannon capacity. We also show a deep connection between a strong leakage ordering on two channels, C1 and C2, and the possibility of factoring C1 into C2 C3 , for some C3 . Based on this connection, we propose a generalization of the Lattice of Information from deterministic to probabilistic channels
Made Up: A Devised Short Film
I\u27ve explored and studied the use of devising in theatre, and decided to bring that process to the making of a short film. Devising is the process of an ensemble creating a piece together in a collaborative and creative environment. These devised works start without a final script and are formed through discussion, improvisation. and ensemble exercises. Film is a new medium for devising and allows for unlimited creative opportunity and exploration. My devised short film utilizes dramatic makeup as an artistic device to assist in the storytelling. The narrative focuses on the idea of how we present ourselves publicly versus how we are feeling internally
Cryptographic Randomized Response Techniques
We develop cryptographically secure techniques to guarantee unconditional
privacy for respondents to polls. Our constructions are efficient and
practical, and are shown not to allow cheating respondents to affect the
``tally'' by more than their own vote -- which will be given the exact same
weight as that of other respondents. We demonstrate solutions to this problem
based on both traditional cryptographic techniques and quantum cryptography.Comment: 21 page
Relating non-local quantum computation to information theoretic cryptography
Non-local quantum computation (NLQC) is a cheating strategy for
position-verification schemes, and has appeared in the context of the AdS/CFT
correspondence. Here, we connect NLQC to the wider context of information
theoretic cryptography by relating it to a number of other cryptographic
primitives. We show one special case of NLQC, known as -routing, is
equivalent to the quantum analogue of the conditional disclosure of secrets
(CDS) primitive, where by equivalent we mean that a protocol for one task gives
a protocol for the other with only small overhead in resource costs. We further
consider another special case of position verification, which we call coherent
function evaluation (CFE), and show CFE protocols induce similarly efficient
protocols for the private simultaneous message passing (PSM) scenario. By
relating position-verification to these cryptographic primitives, a number of
results in the cryptography literature give new implications for NLQC, and vice
versa. These include the first sub-exponential upper bounds on the worst case
cost of -routing of entanglement, the first example
of an efficient -routing strategy for a problem believed to be outside
, linear lower bounds on entanglement for CDS in the quantum setting,
linear lower bounds on communication cost of CFE, and efficient protocols for
CDS in the quantum setting for functions that can be computed with quantum
circuits of low depth
Hidden-Markov Program Algebra with iteration
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 with respect to
their information leakage; and we propose a program algebra for source-level
reasoning about such programs, in particular as a means of establishing that an
"implementation" program leaks no more than its "specification" program.
This joins two themes: we extend our earlier work, having iteration but only
qualitative, by making it quantitative; and we extend our earlier quantitative
work by including iteration. We advocate stepwise refinement and
source-level program algebra, both as conceptual reasoning tools and as targets
for automated assistance. 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
Compositional closure for Bayes Risk in probabilistic noninterference
We give a sequential model for noninterference security including probability
(but not demonic choice), thus supporting reasoning about the likelihood that
high-security values might be revealed by observations of low-security
activity. Our novel methodological contribution is the definition of a
refinement order and its use to compare security measures between
specifications and (their supposed) implementations. This contrasts with the
more common practice of evaluating the security of individual programs in
isolation.
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 "elementary" order based on
Bayes Risk --- a security measure already in widespread use. We also relate
refinement to other measures such as Shannon Entropy.
By applying the approach to a non-trivial example, the anonymous-majority
Three-Judges protocol, we demonstrate by example that correctness arguments can
be simplified by the sort of layered developments --through levels of
increasing detail-- that are allowed and encouraged by compositional semantics
- …