Analysis of Key Wrapping APIs: Generic Policies, Computational Security

Guillaume Scerri; Ryan W Stanley-Oakes

doi:10.1109/CSF.2016.27

Analysis of Key Wrapping APIs: Generic Policies, Computational Security

Guillaume Scerri, Ryan W Stanley-Oakes

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

17 Citations (Scopus)

483 Downloads (Pure)

Abstract

We present an analysis of key wrapping APIs with generic policies. We prove that certain minimal conditions on policies are sufficient for keys to be indistinguishable from random in any execution of an API. Our result captures a large class of API policies, including both the hierarchies on keys that are common in the scientific literature and the non-linear dependencies on keys used in PKCS#11. Indeed, we use our result to propose a secure refinement of PKCS#11, assuming that the attributes of keys are transmitted as authenticated associated data when wrapping and that there is an enforced separation between keys used for wrapping and keys used for other cryptographic purposes. We use the Computationally Complete Symbolic Attacker developed by Bana and Comon. This model enables us to obtain computational guarantees using a simple proof with a high degree of modularity.

Original language	English
Title of host publication	2016 IEEE 28th Computer Security Foundations Symposium (CSF 2016)
Subtitle of host publication	Proceedings of a meeting held 27 June - 1 July 2016, Lisbon, Portugal
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	281-295
Number of pages	15
ISBN (Electronic)	9781509026074
ISBN (Print)	9781509026081
DOIs	https://doi.org/10.1109/CSF.2016.27
Publication status	Published - Aug 2016
Event	2016 IEEE Computer Security Foundations Symposium - San Jose, United States Duration: 23 May 2016 → 25 May 2016

Publication series

Name	Proceedings of the IEEE Computer Security Foundations Symposium
Publisher	Institute of Electrical and Electronics Engineers
ISSN (Print)	1063-6900
ISSN (Electronic)	2374-8303

Conference

Conference	2016 IEEE Computer Security Foundations Symposium
Country/Territory	United States
City	San Jose
Period	23/05/16 → 25/05/16

Access to Document

10.1109/CSF.2016.27Licence: Unspecified

Full-text PDF (accepted author manuscript)
This is the author accepted manuscript (AAM). The final published version (version of record) is available online via IEEE at http://ieeexplore.ieee.org/document/7536382/?arnumber=7536382. Please refer to any applicable terms of use of the publisher.
Accepted author manuscript, 460 KB

Handle.net

Persistent link

Cite this

Scerri, G., & Stanley-Oakes, R. W. (2016). Analysis of Key Wrapping APIs: Generic Policies, Computational Security. In 2016 IEEE 28th Computer Security Foundations Symposium (CSF 2016): Proceedings of a meeting held 27 June - 1 July 2016, Lisbon, Portugal (pp. 281-295). (Proceedings of the IEEE Computer Security Foundations Symposium). Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/CSF.2016.27

Scerri, Guillaume ; Stanley-Oakes, Ryan W. / Analysis of Key Wrapping APIs : Generic Policies, Computational Security. 2016 IEEE 28th Computer Security Foundations Symposium (CSF 2016): Proceedings of a meeting held 27 June - 1 July 2016, Lisbon, Portugal. Institute of Electrical and Electronics Engineers (IEEE), 2016. pp. 281-295 (Proceedings of the IEEE Computer Security Foundations Symposium).

@inproceedings{56dd7cf002ad41259735d7f8ee5d96cd,

title = "Analysis of Key Wrapping APIs: Generic Policies, Computational Security",

abstract = "We present an analysis of key wrapping APIs with generic policies. We prove that certain minimal conditions on policies are sufficient for keys to be indistinguishable from random in any execution of an API. Our result captures a large class of API policies, including both the hierarchies on keys that are common in the scientific literature and the non-linear dependencies on keys used in PKCS#11. Indeed, we use our result to propose a secure refinement of PKCS#11, assuming that the attributes of keys are transmitted as authenticated associated data when wrapping and that there is an enforced separation between keys used for wrapping and keys used for other cryptographic purposes. We use the Computationally Complete Symbolic Attacker developed by Bana and Comon. This model enables us to obtain computational guarantees using a simple proof with a high degree of modularity.",

author = "Guillaume Scerri and Stanley-Oakes, {Ryan W}",

year = "2016",

month = aug,

doi = "10.1109/CSF.2016.27",

language = "English",

isbn = "9781509026081",

series = "Proceedings of the IEEE Computer Security Foundations Symposium",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

pages = "281--295",

booktitle = "2016 IEEE 28th Computer Security Foundations Symposium (CSF 2016)",

address = "United States",

note = "2016 IEEE Computer Security Foundations Symposium ; Conference date: 23-05-2016 Through 25-05-2016",

}

Scerri, G & Stanley-Oakes, RW 2016, Analysis of Key Wrapping APIs: Generic Policies, Computational Security. in 2016 IEEE 28th Computer Security Foundations Symposium (CSF 2016): Proceedings of a meeting held 27 June - 1 July 2016, Lisbon, Portugal. Proceedings of the IEEE Computer Security Foundations Symposium, Institute of Electrical and Electronics Engineers (IEEE), pp. 281-295, 2016 IEEE Computer Security Foundations Symposium, San Jose, United States, 23/05/16. https://doi.org/10.1109/CSF.2016.27

Analysis of Key Wrapping APIs: Generic Policies, Computational Security. / Scerri, Guillaume; Stanley-Oakes, Ryan W.
2016 IEEE 28th Computer Security Foundations Symposium (CSF 2016): Proceedings of a meeting held 27 June - 1 July 2016, Lisbon, Portugal. Institute of Electrical and Electronics Engineers (IEEE), 2016. p. 281-295 (Proceedings of the IEEE Computer Security Foundations Symposium).

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

TY - GEN

T1 - Analysis of Key Wrapping APIs

T2 - 2016 IEEE Computer Security Foundations Symposium

AU - Scerri, Guillaume

AU - Stanley-Oakes, Ryan W

PY - 2016/8

Y1 - 2016/8

N2 - We present an analysis of key wrapping APIs with generic policies. We prove that certain minimal conditions on policies are sufficient for keys to be indistinguishable from random in any execution of an API. Our result captures a large class of API policies, including both the hierarchies on keys that are common in the scientific literature and the non-linear dependencies on keys used in PKCS#11. Indeed, we use our result to propose a secure refinement of PKCS#11, assuming that the attributes of keys are transmitted as authenticated associated data when wrapping and that there is an enforced separation between keys used for wrapping and keys used for other cryptographic purposes. We use the Computationally Complete Symbolic Attacker developed by Bana and Comon. This model enables us to obtain computational guarantees using a simple proof with a high degree of modularity.

AB - We present an analysis of key wrapping APIs with generic policies. We prove that certain minimal conditions on policies are sufficient for keys to be indistinguishable from random in any execution of an API. Our result captures a large class of API policies, including both the hierarchies on keys that are common in the scientific literature and the non-linear dependencies on keys used in PKCS#11. Indeed, we use our result to propose a secure refinement of PKCS#11, assuming that the attributes of keys are transmitted as authenticated associated data when wrapping and that there is an enforced separation between keys used for wrapping and keys used for other cryptographic purposes. We use the Computationally Complete Symbolic Attacker developed by Bana and Comon. This model enables us to obtain computational guarantees using a simple proof with a high degree of modularity.

U2 - 10.1109/CSF.2016.27

DO - 10.1109/CSF.2016.27

M3 - Conference Contribution (Conference Proceeding)

SN - 9781509026081

T3 - Proceedings of the IEEE Computer Security Foundations Symposium

SP - 281

EP - 295

BT - 2016 IEEE 28th Computer Security Foundations Symposium (CSF 2016)

PB - Institute of Electrical and Electronics Engineers (IEEE)

Y2 - 23 May 2016 through 25 May 2016

ER -

Scerri G, Stanley-Oakes RW. Analysis of Key Wrapping APIs: Generic Policies, Computational Security. In 2016 IEEE 28th Computer Security Foundations Symposium (CSF 2016): Proceedings of a meeting held 27 June - 1 July 2016, Lisbon, Portugal. Institute of Electrical and Electronics Engineers (IEEE). 2016. p. 281-295. (Proceedings of the IEEE Computer Security Foundations Symposium). Epub 2016 Aug 11. doi: 10.1109/CSF.2016.27

Analysis of Key Wrapping APIs: Generic Policies, Computational Security

Abstract

Publication series

Conference

Access to Document

Handle.net

Fingerprint

Cite this