Cryptographic Enforcement of Attribute-based Authentication
Year: 2016
Type: dissertation
Abstract: This dissertation investigates on the cryptographic enforcement about attributebased\nauthentication (ABA) schemes. ABA is an approach to authenticate users\nvia attributes, which are properties of users to be authenticated, environment conditions\nsuch as time and locations. By using attributes in place of users’ identity information,\nABA can provide anonymous authentication, or more specifically, ABA\nenables to keep users anonymous from their authenticators. In addition, the property\nof least information leakage provides better protection for users’ privacy compared\nwith public key based authentication approaches. These properties make it possible\nto apply ABA schemes in privacy preserving scenarios, for instance, cloud-based\napplications.\nThe most important security requirements of ABA schemes consist of anonymity,\ntraceability, unforgeability, unlinkability and collision resistance. In this dissertation,\nwe combine these security requirements with other properties such as hierarchy\nto divide ABA schemes into different categories, based on which we use examples\nto demonstrate how to construct these schemes cryptographically. The main\ncontributions of this dissertation include the following aspects:\n We categorize ABA schemes into different types and describe their structures\nas well as workflows, such that readers can gain a big picture and a clear\nview of different ABA schemes and their relations. This categorization serves\nas a guideline how to design and construct ABA schemes.\n We provide two examples to demonstrate how to construct ciphertext-policy\nattribute-based authentication (CP-ABA) schemes via two different approaches.\nDifferent from key-policy attribute-based authentication (KP-ABA) schemes,\nattribute keys generated in CP-ABA schemes are comparatively independent\nof relations among attributes. Thus compared with KP-ABA, CP-ABA extends\nthe flexibility and usage scope of ABA schemes.\n We extend the core ABA schemes to hierarchical ABA (HABA) schemes\nby adding the property of hierarchy. Then we propose two different types\nof hierarchical structures, i.e., user related hierarchical ABA (U-HABA) and\nattribute related hierarchical ABA (A-HABA). According to these two hierarchical\nstructures, an example is provided for each type to show how to use\ncryptographic primitives to build HABA schemes.\nAll ABA schemes discussed above and proposed in this dissertation can be implemented\nto assist users to achieve anonymous authentication from their authenticators.\nTherefore, these schemes can offer more opportunities to protect users’\nprivacy, for example, in attribute-based access control (ABAC) and cloud-based\nservices.
Source: NVA (Nasjonalt vitenarkiv)
Author: Huihui Yang
Institution: University of Agder
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2486468341
