02391nas a2200193   4500008004100000245004400041210004300085260000900128520184600137653001501983653001701998653001402015653001902029653001902048100002502067700001502092700001902107856007102126       2019                        eng d00aDistributed Ledger for Spammers' Resume0 aDistributed Ledger for Spammers Resume  cJune3 a<p>Unsolicited, and most likely spoofed, robot calls are not just an annoyance, but also carry a potential threat with the onset of automation, impersonation, and even voice manipulation technologies as malicious elements attempt to use deception to steal sensitive information or invoke action. Despite steps taken to protect consumers, the issue appears to be far from under control. In this paper, we propose a solution to use blockchain as a platform to share spam transactions through a peer-to-peer mechanism that will maintain a global database of reported spam transactions in order to identify and trace spam activity effectively. Storing spam transactions on a distributed ledger with consensus-based approval of transactions adds reliability to the data and can optimize the data points that will be available to spam detection algorithms in order to fight spam effectively. As this is peer to peer-based sharing, there is no need to rely on third-party providers for storing and sharing this data to the users. Every spam call received will be added as a detailed transaction on the blockchain to execute a smart contract that will calculate the trustworthiness of the caller. Call records are used to identify spam transactions while the blockchain ledgers store this data. We discuss the relevance and advantages of a distributed ledger to store these transactions. This paper does not aim at solving the spam problem with an optimized detection algorithm but evaluates the characteristics and performance of the blockchain as a distributed ledger and its relevance to serve as a platform for peer-to-peer spam detection mechanisms. We evaluate different blockchain metrics like transaction processing rates, gas costs and ledger sizes and discuss how they scale in order to store the spam reports data on the blockchain.</p>
10ablockchain10aPeer-to-peer10aRobocalls10asmart contract10aSpam detection1 aMuttavarapu, Anudeep1 aDantu, Ram1 aThompson, Mark  uhttps://nsl.cse.unt.edu/content/distributed-ledger-spammers-resume01834nas a2200289   4500008004100000020002200041245002100063210002100084260005100105300001400156520110600170653001401276653001301290653001301303653001301316653001701329653001201346653001601358653000901374100001801383700002101401700001501422700002401437700001701461700001601478856005001494       2010                        eng d  a978-3-642-29336-800aSmall World VoIP0 aSmall World VoIP  aBerlin, HeidelbergbSpringer Berlin Heidelberg  a137–1553 a<p>We present the analysis and design of a Small World VoIP system (SW-VoIP) which is geared towards customers that are communicating with their Small World of social contacts. We use the term Small World to refer to the Peer-to-Peer (P2P) network of a client and his contacts both incoming and outbound. We reconstruct the small world of a user by collecting calling patterns over a configurable period of time. We enable user mobility by using a stepwise social identity to an IP address binding propagation model. We propose an efficient algorithm to locate users by electing popular users and leveraging the users closeness. We also introduce a self-stabilized load balancing mechanism to optimize the system performance under heavy network traffic. We evaluate our SW-VoIP system performance by simulating the user’s lookup process using real-world telephone logs. Our experimental results show that our SW-VoIP system offers a better performance in optimizing the required routing path and reducing the average lookup delay when compared to traditional, non small-world P2P VoIP systems.</p>
10acloseness10aelecting10amobility10aoptimize10aPeer-to-peer10apopular10asmall world10aVoIP1 aYang, Xiaohui1 aStavrou, Angelos1 aDantu, Ram1 aWijesekera, Duminda1 aGris, Martin1 aYang, Guang  uhttp://dx.doi.org/10.1007/978-3-642-29336-8_8