An access control scheme for partially ordered set hierarchy with provable security

Authors:
Jiang Wu;Ruizhong Wei
Affiliations:
School of Computer Science, University of Waterloo, Waterloo, ON, Canada;Department of Computer Science, Lakehead University, Thunder Bay, ON, Canada
Venue:
SAC'05 Proceedings of the 12th international conference on Selected Areas in Cryptography
Year:
2005

Citing 8
Cited 7

An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy

IEEE Transactions on Computers
Cryptographic implementation of a tree hierarchy for access control

Information Processing Letters
A cryptographic key generation scheme for multilevel data security

Computers and Security
Implementing discrete mathematics: combinatorics and graph theory with Mathematica

Implementing discrete mathematics: combinatorics and graph theory with Mathematica
Diffie-Hellman key distribution extended to group communication

CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Cryptographic solution to a problem of access control in a hierarchy

ACM Transactions on Computer Systems (TOCS)
The Group Diffie-Hellman Problems

SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
The Decision Diffie-Hellman Problem

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory

Access control in user hierarchy based on elliptic curve cryptosystem

Information Sciences: an International Journal
Efficient utilization of elliptic curve cryptosystem for hierarchical access control

Journal of Systems and Software
Secure key management scheme for dynamic hierarchical access control based on ECC

Journal of Systems and Software
An efficient key assignment scheme for access control in a hierarchy

ICISS'06 Proceedings of the Second international conference on Information Systems Security
Optimizing segment based document protection

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
A Novel Cryptographic Key Assignment Scheme with ID-Based Access Control in a Hierachy

Fundamenta Informaticae
An efficient access control scheme in user hierarchy based on polynomial interpolation and hash function

International Journal of Communication Networks and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a hierarchical structure, an entity has access to another if and only if the former is a superior of the later. The access control scheme for a hierarchy represented by a partially ordered set (poset) has been researched intensively in the past years. In this paper, we propose a new scheme that achieves the best performance of previous schemes and is provably secure under a comprehensive security model.