Abstract :
In a peer-to-peer (P2P) system, multiple peer processes issue transactions to manipulate objects. A transaction issued by a process is assigned with a subfamily of roles named purpose, which are granted to the process. If a transaction reads an object o1 and then writes another object o2, information in o1 might flow into o2. Suppose a transaction T1 with a purpose R1 precedes another transaction T2 with a purpose R2 in a schedule. Here, if the legal information flow relation R1 ¿ R2 holds, no illegal information flow occur. Otherwise, illegal information flow might occur. In order to prevent illegal information flow, if T1 writes an object o, the object o is marked with the purpose R1. The transaction T2 is allowed to read the object o if R1 ¿ R2. Even if T1 commits, the object o isstill marked with the purpose R1. Hence, every transaction T3 with such a purpose R3 that R1 does not legally flow into R3 is aborted if T3 reads the object o. In result, the throughput is degraded. In this paper, we discuss how to release purpose marks on objects. Objects whose information may flow into an object o are source objects of o. If the source objects are changed, a purpose mark on the object o is released. In addition, an object o might have some lifetime when o´s data has to be secure since the data iscreated. If it takes time since the object o is marked, the purpose mark is released. While there occur no illegal information flow in our purpose marking (PM) protocol, transactions which imply illegal information flow are aborted. We evaluate the PM protocol in terms of how many transactions are aborted.
Keywords :
peer-to-peer computing; protocols; security of data; transaction processing; illegal information flow; multiple transactions; peer-to-peer system; purpose marking protocol; purpose-based synchronization protocol; Degradation; Law; Legal factors; Peer to peer computing; Protocols; Throughput; Distributed systems; Information flow control; Purpose; Role-based access control model;