@conference {409,
	title = {Distributed Ledger for Spammers{\textquoteright} Resume},
	booktitle = {2019 IEEE Conference on Communications and Network Security (CNS)},
	year = {2019},
	month = {June},
	abstract = {<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>
},
	keywords = {blockchain, Peer-to-peer, Robocalls, smart contract, Spam detection},
	doi = {10.1109/CNS.2019.8802789},
	author = {Muttavarapu, Anudeep and Dantu, Ram and Thompson, Mark}
}
@inbook {77,
	title = {Small World VoIP},
	booktitle = {Mobile Computing, Applications, and Services: Second International ICST Conference, MobiCASE 2010, Santa Clara, CA, USA, October 25-28, 2010, Revised Selected Papers},
	year = {2010},
	pages = {137{\textendash}155},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	address = {Berlin, Heidelberg},
	abstract = {<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{\textquoteright}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>
},
	keywords = {closeness, electing, mobility, optimize, Peer-to-peer, popular, small world, VoIP},
	isbn = {978-3-642-29336-8},
	doi = {10.1007/978-3-642-29336-8_8},
	url = {http://dx.doi.org/10.1007/978-3-642-29336-8_8},
	author = {Yang, Xiaohui and Stavrou, Angelos and Ram Dantu and Wijesekera, Duminda},
	editor = {Gris, Martin and Yang, Guang}
}
