6533b85cfe1ef96bd12bd2c0

RESEARCH PRODUCT

An Efficient Traceable Attribute-Based Authentication Scheme with One-Time Attribute Trees

Vladimir A. OleshchukHuihui Yang

subject

Scheme (programming language)AuthenticationProperty (philosophy)Theoretical computer scienceTraceabilityDatabaseComputer scienceAuthentication schemecomputer.software_genreSignature (logic)Set (abstract data type)ComputingMilieux_MANAGEMENTOFCOMPUTINGANDINFORMATIONSYSTEMSAttribute treecomputercomputer.programming_language

description

Attribute-based authentication (ABA) is a way to authenticate signers by means of attributes and it requests proof of possessing required attributes from the one to be authenticated. To achieve the property of traceability, required attributes should be combined with the signer’s attribute private keys in order to generate a signature. In some schemes, signers’ attribute keys are related to attribute trees, so changing attribute trees will cause the regeneration of all related attribute keys. In this paper, we propose an efficient traceable ABA scheme, where the generation of signers’ attribute keys is independent from attribute trees. Thus the same set of attribute keys can be used with a different attribute tree for each signature generation and verification, which is called “onetime” attribute tree in this paper.

yearjournalcountryeditionlanguage
2015-01-01
https://doi.org/10.1007/978-3-319-26502-5_9