Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies. / Crampton, Jason; Farley, Naomi; Gutin, Gregory; Jones, Mark.

29th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy: DBSec 2015. Springer-Verlag, 2015.

Research output: Chapter in Book/Report/Conference proceedingChapter

Forthcoming

Standard

Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies. / Crampton, Jason; Farley, Naomi; Gutin, Gregory; Jones, Mark.

29th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy: DBSec 2015. Springer-Verlag, 2015.

Research output: Chapter in Book/Report/Conference proceedingChapter

Harvard

Crampton, J, Farley, N, Gutin, G & Jones, M 2015, Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies. in 29th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy: DBSec 2015. Springer-Verlag.

APA

Crampton, J., Farley, N., Gutin, G., & Jones, M. (Accepted/In press). Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies. In 29th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy: DBSec 2015 Springer-Verlag.

Vancouver

Crampton J, Farley N, Gutin G, Jones M. Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies. In 29th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy: DBSec 2015. Springer-Verlag. 2015

Author

Crampton, Jason ; Farley, Naomi ; Gutin, Gregory ; Jones, Mark. / Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies. 29th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy: DBSec 2015. Springer-Verlag, 2015.

BibTeX

@inbook{f0572d79ef1b43bd89a1690f5c739a63,
title = "Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies",
abstract = "The simple security property in an information flow policy can be enforced by encrypting data objects and distributing an appropriate secret to each user.A user derives a suitable decryption key from the secret and publicly available information.A chain-based enforcement scheme provides an alternative method of cryptographic enforcement that does not require any public information, the trade-off being that a user may require more than one secret.For a given information flow policy, there will be many different possible chain-based enforcement schemes.In this paper, we provide a polynomial-time algorithm for selecting a chain-based scheme which uses the minimum possible number of secrets.We also compute the number of secrets that will be required and establish an upper bound on the number of secrets required by any user.",
author = "Jason Crampton and Naomi Farley and Gregory Gutin and Mark Jones",
year = "2015",
language = "English",
booktitle = "29th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy",
publisher = "Springer-Verlag",

}

RIS

TY - CHAP

T1 - Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies

AU - Crampton, Jason

AU - Farley, Naomi

AU - Gutin, Gregory

AU - Jones, Mark

PY - 2015

Y1 - 2015

N2 - The simple security property in an information flow policy can be enforced by encrypting data objects and distributing an appropriate secret to each user.A user derives a suitable decryption key from the secret and publicly available information.A chain-based enforcement scheme provides an alternative method of cryptographic enforcement that does not require any public information, the trade-off being that a user may require more than one secret.For a given information flow policy, there will be many different possible chain-based enforcement schemes.In this paper, we provide a polynomial-time algorithm for selecting a chain-based scheme which uses the minimum possible number of secrets.We also compute the number of secrets that will be required and establish an upper bound on the number of secrets required by any user.

AB - The simple security property in an information flow policy can be enforced by encrypting data objects and distributing an appropriate secret to each user.A user derives a suitable decryption key from the secret and publicly available information.A chain-based enforcement scheme provides an alternative method of cryptographic enforcement that does not require any public information, the trade-off being that a user may require more than one secret.For a given information flow policy, there will be many different possible chain-based enforcement schemes.In this paper, we provide a polynomial-time algorithm for selecting a chain-based scheme which uses the minimum possible number of secrets.We also compute the number of secrets that will be required and establish an upper bound on the number of secrets required by any user.

M3 - Chapter

BT - 29th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy

PB - Springer-Verlag

ER -