The Dynamic-Typed Access Matrix Model and Decidability of the Safety Problem (Applications) (<Special Section>Cryptography and Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• The safety problem in access matrix models determines whether a given subject can eventually obtain access privilege to a given object. Generally speaking, the safety problem is, unfortunately undecidable. Not much is known about protection systems for which the safety problem is decidable, except for strongly constrained systems (e.g., monotonic systems). Therefore, we propose the Dynamic-Typed Access Matrix (DTAM) Model, which extends the Typed Access Matrix model of Sandhu by allowing the type of an object to change dynamically. The DTAM model has an advantage that it can describe non-monotonic protection systems for which the safety problem is decidable. In particular, with further restrictions, we can show that the problem becomes NP-hard. In this paper, we formally define the DTAM model and then discuss various aspects of it thoroughly.

• 社団法人電子情報通信学会の論文
• 2004-01-01

著者

• Okamoto E

  Institute Of Information Sciences And Electronics University Of Tsukuba

• SOSHI Masakazu

  Japan Advanced Institute ofScience and Technology

• MAEKAWA Mamoru

  Graduate School of Information Systems, University of Electro-Communications

• OKAMOTO Eiji

  Institute of Information Sciencesand Electronics, University of Tsukuba

• Soshi M

  Japan Advanced Institute Of Science And Technology

• Maekawa Mamoru

  Graduate School Of Information Systems University Of Electro-communications

• Soshi Masakazu

  Japan Advanced Institute Of Science And Technology

• Okamoto Eiji

  Institute Of Information Sciences And Electronics University Of Tsukuba

• Okamoto Eiji

  Department Of Computer Science And Engineering Nagoya Institute Of Technology

関連論文

• On Anonymity Metrics for Practical Anonymous Communication Protocols
• The Dynamic-Typed Access Matrix Model and Decidability of the Safety Problem (Applications) (Cryptography and Information Security)
• The Dynamic-Typed Access Matrix Model and Decidability of the Safety Problem
• Proposal of an Automatic Signature Scheme Using a Compiler (Special Section on Cryptography and Information Security)
• Permutation Cipher Scheme Using Polynomials over a Field
• Software Obfuscation on a Theoretical Basis and Its Implementation
• Network-Transparent Object Naming and Locating in the GALAXY Distributed Operating System
• Proxy Signatures: Delegation of the Power to Sign Messages (Special Section on Information Theory and Its Applications)
• Security of Kuwakado-Tanaka Transitive Signature Scheme for Directed Trees(Information Security)
• Proposal for New E-cash System Using Message Recovery Signature (特集 情報セキュリティの理論と応用)
• Application of Wavelet Packet Modulation to Mobile Communication(Wide Band Systems)
• A Fast Signature Scheme with New On-line Computation(Discrete Mathematics and Its Applications)

もっと見る 閉じる

スポンサーリンク