Privacy Preserving Reputation Calculation in P2P Systems with Homomorphic Encryption

In this paper, we consider the problem of calculating the node reputation in a Peer-toPeer (P2P) system from fragments of partial knowledge concerned with the trustfulness of nodes which are subjectively given by each node (i.e., evaluator) participating in the system. We are particularly interested in the distributed processing of the calculation of reputation scores while preserving the privacy of evaluators. The basic idea of the proposed method is to extend the EigenTrust reputation management system with the notion of homomorphic cryptosystem. More specifically, it calculates the main eigenvector of a linear system which models the trustfulness of the users (nodes) in the P2P system in a distributed manner, in such a way that: 1) it blocks accesses to the trust value by the nodes to have the secret key used for the decryption, 2) it improves the efficiency of calculation by offloading a part of the task to the participating nodes, and 3) it uses different public keys during the calculation to improve the robustness against the leave of nodes. The performance of the proposed method is evaluated through numerical calculations.

A Study on Non Conventional Financing with Special Reference to ‘P2P Lending’ and its Growth during Covid-19 Pandemic in India

The new financial face imploded after the collapse of the so longed conventional system in 2008 after demonetisation, and following covid-19 pandemic, India witnessed a millions of extraordinary debt bearing borrower in all sectors. The instable stock markets, bond prices and devaluation of domestic currency popularized the term dis-intermediation and prompted more investors to turn to a cashless financial system and non-conventional sources funding. With the gradual growth of global market Indian potential investors and borrowers face some financial challenges and this is where these digitalisation and green banking system became an inevitable technology which enabling them to operate more efficiently and at cost advantage than the traditional banking system. Several online portals have sprung up in India to facilitate such lending, especially after demonetisation and some even getting private financing and investments from investors, even it isis still at an emerging stage comparing with US and China. RBI brought a discussion paper on P2P lending in April 2016, it points that there were 30 such start-ups have emerged in the country. After that it have been proceeded as a fast-growing sector and came out with some regulations in October 2017 and this study aims to analyse the mode and operations of the non-conventional lending P2P system and its initial growth during pandemic period.

IMPACT OF BLOCK CHAIN IN COMMUNICATION AND NETWORK

A block chain network is a technical infrastructure that provides ledger and smart contract (chain code) services to applications. Primarily, smart contracts are used to generate transactions which are subsequently distributed to every peer node in the network where they are immutably recorded on their copy of the ledger. The users of applications might be end users using client applications or block chain network administrators. First and foremost, block chain is a public electronic ledger built around a P2P system that can be openly shared among disparate users to create an unchangeable record of transactions, each time-stamped and linked to the previous one. Every time a set of transactions is added, that data becomes another block in the chain.

autoCoin: Secure Content Sharing Based on Blockchain for Vehicular Cloud

A future smart car will be more than a means of transportation, as it will not only move people to a destination without requiring them to drive but will enable people to work or enjoy a trip with entertainment. For this, smart vehicles need to deal with various types of data for safety and infotainment, such as real-time traffic, multi-media contents, documents and weather information. Recently, a fleet of vehicles connected to other vehicles and infrastructure (i.e., road side units) using a legacy or 5G mmWave spectrum has been considered as a platform to cooperate for those new tasks, known as the vehicular cloud or fog. Within the vehicular cloud, data management should consider security, high availability and interoperability between vehicles. However, these are not easily achievable without a centralized service provider; it is difficult for an autonomous P2P system to guarantee data integrity, and it cannot compensate drivers that actively participate in the vehicular cloud. Fortunately, the many successes achieved in the field of crypto-currency raise the possibility of defining incentives that are necessary for a sustainable digital economy. In this paper, we propose autoCoin—an approach that aims to encourage smart vehicles to cooperate to create and exchange infotainment data securely under the assumption of rationality. We introduce a scalable blockchain architecture for autoCoin and a smart contract to exchange contents without third-parties using an off-chain technique.

An analysis of structured and unstructured P2P systems over MANET

Peer-to-peer or P2P file-sharing application on wireless ad hoc mobile network (MANET) has gained a lot of interest in the recent years. A peer-to-peer network is an overlay network that is deployed over ad hoc networks. Our work is analyzing two P2P systems over MANET. The systems evaluated are representing two distinct categories in terms of network topology such as unstructured and structured architectures. RAON or Resource-Aware Overlay Network, which is an improvement of an existent P2P system called Gia, is an unstructured system. CAN or Content-Addressable Network is an existent P2P system in the category of structured architectures. Based on the simulations of the two P2P systems over MANET, we evaluated the performance in terms of query search success rate and query search delay.

An analysis of structured and unstructured P2P systems over MANET

Peer-to-peer or P2P file-sharing application on wireless ad hoc mobile network (MANET) has gained a lot of interest in the recent years. A peer-to-peer network is an overlay network that is deployed over ad hoc networks. Our work is analyzing two P2P systems over MANET. The systems evaluated are representing two distinct categories in terms of network topology such as unstructured and structured architectures. RAON or Resource-Aware Overlay Network, which is an improvement of an existent P2P system called Gia, is an unstructured system. CAN or Content-Addressable Network is an existent P2P system in the category of structured architectures. Based on the simulations of the two P2P systems over MANET, we evaluated the performance in terms of query search success rate and query search delay.

Resource-Aware Topology Adaptation in P2P Overlay Adhoc Network

With the emergence of wireless devices, service delivery for mobile as hoc networks (MANET) has started to attract a lot of attention recently. We believe that overlay networks, particularly peer-to-peer (P2P) systems, is a good abstraction for application design and deployment over ad hoc networks. The principal benefit of this approach is that application states are only maintained by the nodes involved in the application execution and all other nodes only perform networking related functions. We propose a P2P system for MANET, RAON, which performs query forwarding and overlay topology adaptation based on link instability and power constraints. We evaluated and compared the performance of RAON with an existing P2P system, Gia. Our simulation results show that RAON improves the success rate and delay of query search as compared to Gia. It, however, achieves this at the expense of higher energy consumption.

Resource-Aware Topology Adaptation in P2P Overlay Adhoc Network

With the emergence of wireless devices, service delivery for mobile as hoc networks (MANET) has started to attract a lot of attention recently. We believe that overlay networks, particularly peer-to-peer (P2P) systems, is a good abstraction for application design and deployment over ad hoc networks. The principal benefit of this approach is that application states are only maintained by the nodes involved in the application execution and all other nodes only perform networking related functions. We propose a P2P system for MANET, RAON, which performs query forwarding and overlay topology adaptation based on link instability and power constraints. We evaluated and compared the performance of RAON with an existing P2P system, Gia. Our simulation results show that RAON improves the success rate and delay of query search as compared to Gia. It, however, achieves this at the expense of higher energy consumption.

Enhancement the Efficiency of Work with P2P System

The P2P system should be used Proximity information to minimize the load of file request and improve the efficiency of the work .Clustering peers for their physical proximity can also rise the performance of the request file. However, very few currently work in a peer group based on demands as peers on physical proximity. Although structured P2P provides more efficient files requests than unstructured P2P, it is difficult to apply because of their strictly defined topology. In this work, we intending to introduce a system for exchange a P2P file for proximity and level of interest based on structured P2P nodes that form physically block in the cluster and other groups physically close and nodes of public interest in sub-cluster based on the hierarchical topology. Querying an effective file is important for the overall P2P file exchange performance. Clustering peers from their common interests can significantly enhance the efficiency of the request file PAIS use an intelligent file replication algorithm to further rise the efficiency of the request file .Create a copy file that is often requested by a group of physically close nodes in their position. In addition, PAIS improves the search for files within the intra-system sub-cluster through various approaches. First, it further classifies interest in the sub-cluster to a number of subsections of interests and groups with common interest-free sub nodes in the group for file sharing. Secondly PAIS creates an over for each group that connects nodes of less node capacity to a higher throughput for the distributed node overload prevention request file. Third, in order to reduce the search for late files, PAIS uses a set of proactive information so that applicant can file knowledge if its requested file is in the neighboring nodes. Fourth, reduce the overhead of collecting information about files using the PAIS, collection of file information based on the Bloom Filter and the corresponding search for files distributed. Fifth, in order to improve the efficiency of file sharing, PAIS ranks the results with a blob of filters in order. Sixth, while the newly visited file is usually re-visited approach, based on the Bloom filter is improved only through the management of new information flowering filter is added to reduce the delay of file search. The experimental result of the Real-world Planet Lab Experiment shows that PAIS significantly reduces overhead and improves the efficiency of scrolling and without sharing files. In addition, the experimental results show high efficiency within the sub-research cluster of file approaches to improve file search efficiency.