The week's pick
Random Articles
Reseach Article
P2P Secure Collaboration between Byzantine Processes in Heterogeneous distributed � Processing Systems
| 2nd National Conference on Computing, Communication and Sensor Network |
| Foundation of Computer Science USA |
| CCSN - Number 3 |
| None 2011 |
| Authors: Ramesh Dharavath, Vallem Swetha Reddy |
| 7f6da925-edd7-4dfc-86aa-6d60e02f34c0 |
Ramesh Dharavath, Vallem Swetha Reddy . P2P Secure Collaboration between Byzantine Processes in Heterogeneous distributed � Processing Systems. 2nd National Conference on Computing, Communication and Sensor Network. CCSN, 3 (None 2011), 14-19.
Abstract
The www and related technologies have made multi domain collaborations a reality. Collaborations enable processes to effectively share resources; it introduces several security and privacy challenges. Managing security and efficient exchange of information is even more challenging. In this paper, we propose a distributed secure frame work between Byzantine processes (nodes) in order to predict and resolve the functionalities of communication errors in collaboration environments. We introduce the idea of secure paths, which enables the front-end clients (e.g. Web browsers) that invoke application servers (e.g. web servers) to access the back-end databases when an end-user interacts. We present a cryptographic protocol for ensuring secure and timely availability of the data of a peer to other peers. Furthermore, we present an on-demand path discovery that enable peers to securely discover paths in the collaboration environment.
References
- M. Abadi, M. Burrows, B. Lampson, and G. Plotkin, “A Calculus for Access Control in Distributed Systems,ACM Trans. Programming Languages and Systems, vol.15, no. 4, pp. 706-734, Sept. 1993.
- M. Abadi and C. Fournet, “Access Control Based on Execution History,” Proc. 10th Ann. Network and Distributed System Symp. (NDSS), 2003.
- D. Bell and L. LaPadula, “Secure Computer Systems: Mathematical Foundations,” Technical Report MTR-2547, vol. 1, Mar. 1973.
- E. Bertino and R. Sandhu, “Database Security-Concepts, Approaches, and Challenges,” IEEE Trans. Dependable Secure Computing, vol. 2, no. 1, pp. 2-19, 2005.
- P. Bonatti, M. Sapino, and V. Subrahmanian, “Merging Heterogenous Security Orderings,” J. Computer Security, vol. 5,no. 1, pp. 3-29, 1997.
- S. Dawson, S. Qian, and P. Samarati, “Providing Security And Interoperation of Heterogeneous Systems,” Distributed Parallel Databases”, vol. 8, no. 1, pp. 119-145, 2000.
- A. Rowstron and P. Druschel, “Pastry: Scalable, DecentralizedObject Location, and Routing for Large- ScalePeer-to-PeerSystems,” Proc. IFIP/ACM Int’l Conf. Distributed Systems Platforms (Middleware), pp. 329- 350, Nov. 2001.
- B.C. Ooi, C.Y. Kiau, and K. Tan, “Managing Trust in Peer-to-Peer Systems Using Reputation-Based Techniques,” Proc. Fourth Int’l Conf. Web Age Information Management, Aug. 2003.
- L. Liu, S. Zhang, K.D. Ryu, and P. Dasgupta, “R-Chain: A Self-Maintained Reputation Management System in p2p Networks,” Proc. 17th Int’l Conf. Parallel and Distributed Computing Systems (PDCS), Nov. 2004.
- R. Zhou, K. Hwang, and M. Cai, “Gossiptrust for Fast Reputation Aggregation in Peer-to-Peer Networks,” IEEE Trans. Knowledge and Data Eng., vol. 20, no. 9, pp. 1282- 1295, Aug. 2008.
- Z. Xu, Y. He, and L. Deng, “A Multilevel Reputation System for Peer-to-Peer Networks,” Proc. Sixth Int’l Conf. Grid and Cooperative Computing (GCC ’07), pp. 67-74, 2007.
- M. Gupta, P. Judge, and M. Ammar, “A Reputation System for Peer-to-Peer Networks,” Proc. 13th Int’l Workshop Network and Operating Systems Support for Digital Audio and Video (NOSSDAV),2003.
Index Terms
Keywords