Article View: csd.cmsc818z
Article #29Re: Information Path Theorem
From: Bill Arbaugh
Date: Fri, 10 Nov 2000 13:30
Date: Fri, 10 Nov 2000 13:30
49 lines
2716 bytes
2716 bytes
You're reading too much into the problem. What does the definition of an Information transfer path say? It (ITP) is only concerned with the flow of information in one direction, i.e. with respect to ITP read-down is permitted. ------------------------------------------------------------------- Bill Arbaugh www.cs.umd.edu/~waa University of Maryland waa@cs.umd.edu College Park 301.405.2774 ------------------------------------------------------------------- On Thu, 9 Nov 2000, Narendar Shankar wrote: > Bill > I am wondering if arunesh is correct.The ring policy staates that a > subject can read any object irrespecive of its integrity level-this allows > us to read an object from an integrity level lower than the subject's. > > I guess some numbers will make thinsg simpler. > > assume > I(s)=5 > I(o1)=3 > now s can read o1. > Assume I(o2)=4 > therefore s can write to o2. > Because s reads 01 and modifies 02 an ITP exists. > But now I(02) <= I(01) does not hold and hence Theorem 6.2 doesnt hold. > > Are we making any wrong assumptions here??Are we making the right > interpretation??Please let us know > sincerely > naren > > > > Narendar Shankar M > Graduate Fellow > Computer Science Dept. > 4157-A.V.Williams Building, > University Of Maryland ,College Park > MD-20742 > > WEBMAIL- narendar_m_s@yahoo.co.uk > HOMEPAGE- www.narendarms.com > > > >
Technical Details
Message-ID:
<Pine.SOL.4.21.0011100827300.17976-100000@ringding.cs.umd.edu>Path:
arc1-ca.pugleaf.net!supernews.google.com!sn-xit-02!sn-xit-03!supernews.com!europa.netcrusader.net!128.230.129.106!news.maxwell.syr.edu!den-news-01.qwest.net!haven.umd.edu!cs.umd.edu!ringding.cs.umd.edu!waaReferences:
<Pine.SOL.4.21.0011091509070.22858-100000@wonka.cs.umd.edu> <Pine.SOL.4.21.0011091519290.1258-100000@ringding.cs.umd.edu> <Pine.SOL.4.21.0011092340510.7242-100000@seine.cs.umd.edu>Show Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 10f190,27b33aa239947559 X-Google-Attributes: gid10f190,public X-Google-ArrivalTime: 2000-11-10 05:51:06 PST Path: arc1-ca.pugleaf.net!supernews.google.com!sn-xit-02!sn-xit-03!supernews.com!europa.netcrusader.net!128.230.129.106!news.maxwell.syr.edu!den-news-01.qwest.net!haven.umd.edu!cs.umd.edu!ringding.cs.umd.edu!waa From: Bill Arbaugh <waa@cs.umd.edu> Newsgroups: csd.cmsc818z Subject: Re: Information Path Theorem Date: Fri, 10 Nov 2000 08:30:16 -0500 Organization: U of Maryland, College Park, MD 20742 Lines: 50 Message-ID: <Pine.SOL.4.21.0011100827300.17976-100000@ringding.cs.umd.edu> References: <Pine.SOL.4.21.0011091509070.22858-100000@wonka.cs.umd.edu> <Pine.SOL.4.21.0011091519290.1258-100000@ringding.cs.umd.edu> <Pine.SOL.4.21.0011092340510.7242-100000@seine.cs.umd.edu> NNTP-Posting-Host: ringding.cs.umd.edu Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Trace: cronkite.cs.umd.edu 973863019 16628 128.8.126.2 (10 Nov 2000 13:30:19 GMT) X-Complaints-To: abuse@cs.umd.edu NNTP-Posting-Date: 10 Nov 2000 13:30:19 GMT Cc: Arunesh Mishra <arunesh@cs.umd.edu> To: Narendar Shankar <narendar@cs.umd.edu> In-Reply-To: <Pine.SOL.4.21.0011092340510.7242-100000@seine.cs.umd.edu>