NIST · ИТ · 124e0691555b91755444
The Computational Complexity of Enforceability Validation for Generic Access Control Rules
In computer security, many researches have tackled on the possibility of a unified model of access control, which could enforce any access control policies within a single unified system. One issue that must be considered is the efficiency of such systems
NIST · ИТОфициальный источник · 2006-06-14
{
"title_en": "The Computational Complexity of Enforceability Validation for Generic Access Control Rules",
"designation": "",
"series": "",
"status": "",
"date": "2006-06-14",
"date_original": "June 14, 2006",
"url": "https://www.nist.gov/publications/computational-complexity-enforceability-validation-generic-access-control-rules",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Chung Tong Hu , David R. Kuhn , David F. Ferraiolo",
"abstract_excerpt_en": "In computer security, many researches have tackled on the possibility of a unified model of access control, which could enforce any access control policies within a single unified system. One issue that must be considered is the efficiency of such systems",
"id": "124e0691555b91755444",
"sources": [
"NIST Publications"
],
"source_records": [
{
"title_en": "The Computational Complexity of Enforceability Validation for Generic Access Control Rules",
"designation": "",
"series": "",
"status": "",
"date": "2006-06-14",
"date_original": "June 14, 2006",
"url": "https://www.nist.gov/publications/computational-complexity-enforceability-validation-generic-access-control-rules",
"source": "NIST Publications",
"display_en": "",
"authors_en": "Chung Tong Hu , David R. Kuhn , David F. Ferraiolo",
"abstract_excerpt_en": "In computer security, many researches have tackled on the possibility of a unified model of access control, which could enforce any access control policies within a single unified system. One issue that must be considered is the efficiency of such systems"
}
],
"translation_state": "none"
}