Information Security as a Resource

A workshop held on 13 – 15.x.2011 at the Department of Computer Science, Oxford University

University of Oxford

Workshop info:

Abstracts of talks
Special issue

General links:

CS Department
Oxford University
I&C journal
EPSRC project


Ed Blakey
Bob Coecke
Mike Mislove
Dusko Pavlovic


Thursday 13 – Saturday 15 October, 2011
Oxford University Department of Computer Science, Oxford, UK

Special issue:

There is a special issue (Information and Computation, vol. 226, pp. 1 – 116, May 2013) addressing the topic of this workshop (see ‘Scope’). The guest editors of the issue are the four organizers of the workshop.


The traditional resources consumed during computational processes are time and space. These suffice for complexity analyses of standard computers such as Turing machines, but are not exhaustive for certain non-standard (quantum, chemical, analogue, …) systems, which may for example consume energy or precision. Non-standard resources arise naturally, then, in the context of unconventional computation; this is addressed in work relating to EPSRC grant EP/G003017/1 and by a previous workshop.

Non-standard resources arise also in the context of cryptography. Specifically, it is desirable to model as a resource the notion of security of cryptographic protocols, for then security can be reasoned about with existing but previously inapplicable complexity-theoretic techniques. Exactly how security can and should be modelled as a resource is the topic of this workshop.

The workshop brings together researchers with relevant interests, including but by no means limited to:

  • cryptographic primitives;
  • non-standard resources, especially as arising in cryptography/informatics; and
  • category- and domain-theoretic techniques suitable for abstracting the relevant properties of security from the incidental details of protocols’ implementation.

Talks (abstracts):

Resources in cryptography    Ed Blakey (Oxford)    [slides]
Why does visual analytics work and what is the underlying theory?    Min Chen (Oxford)    [slides]
Structural resources for quantum crypto    Bob Coecke (Oxford)    [slides]
Creation vs. conservation of security    Simon Gay (Glasgow)    [slides]
Security as a resource in process-aware information systems    Michael Huth (Imperial)    [slides]
The expectation monad    Bart Jacobs (Radboud)    [slides]
Algebraic foundations for quantitative information flow    Pasquale Malacaria (Queen Mary)    [slides]
From classical channels towards abstract models of computation    Mike Mislove (Tulane)    [slides]
Logical complexity in security    Dusko Pavlovic (Royal Holloway)    [slides]
Trust as a resource    Peter Ryan (Luxembourg)    [slides]
Min-entropy as a resource    Geoff Smith (Florida International)    [slides]
Bridging the gap between two views of security    Bogdan Warinschi (Bristol)    [slides]
Winning strategies in concurrent games    Glynn Winskel (Cambridge)    [slides]


This workshop is funded by the EPSRC grant Complexity and Decidability in Unconventional Computational Models (EP/G003017/1).

This website was last updated on 16.iv.2013.