Comparison of the Expressive Power of Language-Based Access Control Models

スポンサーリンク

概要

• 論文の詳細を見る

• This paper compares the expressive power of five language-based access control models. We show that the expressive powers are incomparable between any pair of history-based access control, regular stack inspection and shallow history automata. Based on these results, we introduce an extension of HBAC, of which expressive power exceeds that of regular stack inspection.

• The Institute of Electronics, Information and Communication Engineersの論文
• 2009-05-01

著者

• SEKI Hiroyuki

  Nara Institute of Science and Technology

• Seki Hiroyuki

  Nara Inst. Sci. And Technol. Ikoma‐shi Jpn

• Takata Yoshiaki

  Kochi Univ. Technol. Kami‐shi Jpn

関連論文

• Layered Transducing Term Rewriting System and Its Recognizability Preserving Property (Special Issue on Selected Papers from LA Symposium)
• Termination Property of Inverse Finite Path Overlapping Term Rewriting System is Decidable
• Finite State Translation Systems and Parallel Multiple Context-Free Grammars
• New certificate chain discovery methods for trust establishment in ad hoc networks and their evaluation (特集:次世代社会基盤をもたらす高度交通システムとモバイル通信システム)
• Policy Controlled System and Its Model Checking
• Decidability of the Security Verification Problem for Programs with Stack Inspection
• Formal Language Theoretic Approach to the Disclosure Tree Strategy in Trust Negotiation
• Comparison of the Expressive Power of Language-Based Access Control Models
• FOREWORD
• Error Control for High-density Monochrome Two-dimensional Barcodes
• A Weighted-Pushdown-System-Based Formal Model for Information-Based Access Control
• LTL Model Checking for Extended Pushdown Systems with Regular Tree Valuations

もっと見る 閉じる

スポンサーリンク