Language：English   Publishing type：Research paper (scientific journal)  

Web of Science

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：University of Cincinnati  

Scopus

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Springer Verlag  

DOI： 10.1007/978-3-319-08222-6

Scopus

researchmap

Language：Japanese   Publisher：電子情報通信学会  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.1109/CRISIS.2008.4757483

Web of Science

researchmap

Language：Japanese  

CiNii Books

researchmap

Language：Japanese   Publisher：社団法人情報処理学会  

We discuss a characterization of security policies to be enforced with a monitor. The monitor is a enforcement mechanism that work by observing a behavior of a program and terminating its execution if it violates a security policy being enforced. Unfortunately, the monitors is able to enforce not all of security policies in order to limit to observe for a finite behavior and not to use future informations. F.B.Schneider show that policies having the trait become to satisfy Lamport's safety property. Also, there exist Buchi automata to recognize the safety properties and he calls them security automata. Therefore we introduce automata using more information and show that these automata can enforce information flow policies with respect to noninterference.

researchmap

Language：Japanese   Publisher：社団法人電子情報通信学会  

We discuss a characterization of security policies to be enforced with a monitor. The monitor is a enforcement mechanism that work by observing a behavior of a program and terminating its execution if it violates a security policy being enforced. Unfortunately, the monitors is able to enforce not all of security policies in order to limit to observe for a finite behavior and not to use future informations. F.B.Schneider show that policies having the trait become to satisfy Lamport's safety property. Also, there exist Biichi automata to recognize the safety properties and he calls them security automata. Therefore we introduce automata using more information and show that these automata can enforce information flow policies with respect to noninterference.

researchmap

Language：Japanese   Publisher：Information Processing Society of Japan (IPSJ)  

Mobile code has been regarded as a convenient abstraction mechanism to construct flexible/evolvable distributed computing systems. It has now gained prominence, mainly due to the current shift from stationary to mobile/ubiquitous computing environment. Although designing a system using mobile code is appealing, its deployment is still a security risk. Further, a system using mobile code is inherently dynamic; we need an extensible/adaptable security model. In this talk, we first claim that application-dependent and special-purpose security policies are increasingly important especially for modern distributed computing environment. Then we present a set of techniques that may be used to enforce such policies on mobile objects (Java classes) . The main technique is a load-time bytecode modification that enforces user-defined policies via monitored execution. The policies are written in a language called Polaris, which is basically a finite process language enhanced to deal with data-dependencies among variables. Use of data-dependencies reduced the cost of monitoring. As an example, we show a code portion from our extensible e-mail client system. Web site of this project: http://www.psg.cs.titech.ac.jp/sc/

CiNii Books

researchmap