Managing trust in a peer-2-peer information system
Proceedings of the tenth international conference on Information and knowledge management
Choosing reputable servents in a P2P network
Proceedings of the 11th international conference on World Wide Web
Java Virtual Machine Specification
Java Virtual Machine Specification
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
A reputation system for peer-to-peer networks
NOSSDAV '03 Proceedings of the 13th international workshop on Network and operating systems support for digital audio and video
Establishing trust in pure ad-hoc networks
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Advanced obfuscation techniques for Java bytecode
Journal of Systems and Software
A Trust based Access Control Framework for P2P File-Sharing Systems
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences - Volume 09
Persistent access control: a formal model for drm
Proceedings of the 2007 ACM workshop on Digital Rights Management
A Trust-Based Access Control with Feedback
ISIP '08 Proceedings of the 2008 International Symposiums on Information Processing
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Hi-index | 0.00 |
Maintaining control and ownership of data is difficult in any network environment. In peer-to-peer P2P networks, without a central authority to control access to data, other mediations must be proposed. We propose a method to control distribution of data in P2P networks through the use of a feedback-based, restrictive content distribution system. Unauthorized distribution is thwarted through a method of self-destructing, one-time-use data. Transmitted data is encrypted, encapsulated within an executable, and authenticated to a single user and machine. Once accessed, measures are taken to ensure it cannot be used outside the executable (e.g., displayed within a non-selectable, non-editable window) and that the executable cannot be easily decompiled. After a single use, data is destroyed through a method of in-memory compilation of a new executable which, during run-time, overwrites the original. Methods to prevent overwriting, such as removing write privileges, are treated as misuse of the data. Misuse of data, or unsatisfactory transactions, negatively affect a peer's trust on the network. Misuse can include failed authentication, unauthorized multiple uses, or attempted distribution of the data. The executable provides feedback to the sender based on this usage so trust values can be adjusted accordingly. We assume some pairwise trust, and place emphasis on these pair-wise interactions. To compute trust values, we determined that the most efficient approach, given the emphasis on each individual pair-wise transaction, is a modified Bayesian approach with weight given towards information gathered first-hand.