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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-01745832
Contributor : Hal Ifip <>
Submitted on : Wednesday, March 28, 2018 - 3:58:17 PM
Last modification on : Wednesday, March 28, 2018 - 3:59:24 PM
Long-term archiving on : Thursday, September 13, 2018 - 11:50:09 AM

File

340025_1_En_23_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Jason Crampton, Naomi Farley, Gregory Gutin, Mark Jones. Optimal Constructions for Chain-Based Cryptographic Enforcement of Information Flow Policies. 29th IFIP Annual Conference on Data and Applications Security and Privacy (DBSEC), Jul 2015, Fairfax, VA, United States. pp.330-345, ⟨10.1007/978-3-319-20810-7_23⟩. ⟨hal-01745832⟩

Share

Metrics

Record views

43

Files downloads

66