1,287 research outputs found

    Malvertising in Facebook: Analysis, Quantification and Solution

    Get PDF
    This article belongs to the Section Computer Science & EngineeringOnline advertising is a wealthy industry that generated more than 100Bin2018onlyintheUSanddeliversbillionsofadstoInternetuserseverydaywith.Theseimpressivenumbershavealsoattractedtheattentionofmaliciousplayersthattrytoexploittheonlineadvertisingecosystemfortheirownbenefit.Inparticular,oneofthemostharmfulpracticesreferstomalicioususersthatactasadvertiserstodeliverunsafeads.Thegoaloftheseadsistocompromisethesecurityoftheusersthatreceivethoseads.ThispracticeisreferredtoasMalvertising.Somereportshaveestimatedtheeconomiclosscausedbymalvertisingtotheonlineadvertisingsectorto100B in 2018 only in the US and delivers billions of ads to Internet users every day with. These impressive numbers have also attracted the attention of malicious players that try to exploit the online advertising ecosystem for their own benefit. In particular, one of the most harmful practices refers to malicious users that act as advertisers to deliver unsafe ads. The goal of these ads is to compromise the security of the users that receive those ads. This practice is referred to as Malvertising. Some reports have estimated the economic loss caused by malvertising to the online advertising sector to 1.1B in 2017. This paper is the first work that analyses and quantifies the impact of malvertising in Facebook. To accomplish this study, we rely on a dataset that includes more than 5 M ads delivered to 3 K Facebook users from 126 K advertisers between October 2016 and May 2018. Our results reveal that although the portion of advertisers (0.68%) and ads (0.17%) associated to malvertising is very low, 1/3 of the users in our study were exposed to malvertising. Finally, we also propose a novel solution to block malvertising ads in real-time in Facebook.The research leading to these results has received funding from: the European Union’s Horizon 2020 innovation action programme under grant agreement No 786741 (SMOOTH project) and the gran agreement No 871370 (PIMCITY project); the Ministerio de Economía, Industria y Competitividad, Spain, and the European Social Fund(EU), under the Ramón y Cajal programme (grant RyC-2015-17732); the Ministerio de Educación, Cultura y Deporte, Spain, through the FPU programme( Grant FPU16/05852); the Ministerio de Ciencia e Innovación under the project ACHILLES (Grant PID2019-104207RB-I00); the Community of Madrid synergic project EMPATIA-CM (Grant Y2018/TCS-5046); and the Fundación BBVA under the project AERIS

    Innovations and Social Media Analytics in a Digital Society

    Get PDF
    info:eu-repo/semantics/publishedVersio

    Innovations and Social Media Analytics in a Digital Society

    Get PDF
    Recent advances in digitization are transforming healthcare, education, tourism, information technology, and some other sectors. Social media analytics are tools that can be used to measure innovation and the relation of the companies with the citizens. This book comprises state-ofthe-art social media analytics, and advanced innovation policies in the digitization of society. The number of applications that can be used to create and analyze social media analytics generates large amounts of data called big data, including measures of the use of the technologies to develop or to use new services to improve the quality of life of the citizens. Digitization has applications in fields from remote monitoring to smart sensors and other devices. Integration generates data that need to be analyzed and visualized in an easy and clear way, that will be some of the proposals of the researchers present in this book. This volume offers valuable insights to researchers on how to design innovative digital analytics systems and how to improve information delivery remotely.info:eu-repo/semantics/publishedVersio

    Obviously Strategyproof Single-Minded Combinatorial Auctions

    Get PDF
    We consider the setting of combinatorial auctions when the agents are single-minded and have no contingent reasoning skills. We are interested in mechanisms that provide the right incentives to these imperfectly rational agents, and therefore focus our attention to obviously strategyproof (OSP) mechanisms. These mechanisms require that at each point during the execution where an agent is queried to communicate information, it should be "obvious" for the agent what strategy to adopt in order to maximise her utility. In this paper we study the potential of OSP mechanisms with respect to the approximability of the optimal social welfare. We consider two cases depending on whether the desired bundles of the agents are known or unknown to the mechanism. For the case of known-bundle single-minded agents we show that OSP can actually be as powerful as (plain) strategyproofness (SP). In particular, we show that we can implement the very same algorithm used for SP to achieve a √m-approximation of the optimal social welfare with an OSP mechanism, m being the total number of items. Restricting our attention to declaration domains with two values, we provide a 2-approximate OSP mechanism, and prove that this approximation bound is tight. We also present a randomised mechanism that is universally OSP and achieves a finite approximation of the optimal social welfare for the case of arbitrary size finite domains. This mechanism also provides a bounded approximation ratio when the valuations lie in a bounded interval (even if the declaration domain is infinitely large). For the case of unknown-bundle single-minded agents, we show how we can achieve an approximation ratio equal to the size of the largest desired set, in an OSP way. We remark this is the first known application of OSP to multi-dimensional settings, i.e., settings where agents have to declare more than one parameter. Our results paint a rather positive picture regarding the power of OSP mechanisms in this context, particularly for known-bundle single-minded agents. All our results are constructive, and even though some known strategyproof algorithms are used, implementing them in an OSP way is a non-trivial task

    Disruptive Technologies in Smart Farming: An Expanded View with Sentiment Analysis

    Get PDF
    Smart Farming (SF) is an emerging technology in the current agricultural landscape. The aim of Smart Farming is to provide tools for various agricultural and farming operations to improve yield by reducing cost, waste, and required manpower. SF is a data-driven approach that can mitigate losses that occur due to extreme weather conditions and calamities. The influx of data from various sensors, and the introduction of information communication technologies (ICTs) in the field of farming has accelerated the implementation of disruptive technologies (DTs) such as machine learning and big data. Application of these predictive and innovative tools in agriculture is crucial for handling unprecedented conditions such as climate change and the increasing global population. In this study, we review the recent advancements in the field of Smart Farming, which include novel use cases and projects around the globe. An overview of the challenges associated with the adoption of such technologies in their respective regions is also provided. A brief analysis of the general sentiment towards Smart Farming technologies is also performed by manually annotating YouTube comments and making use of the pattern library. Preliminary findings of our study indicate that, though there are several barriers to the implementation of SF tools, further research and innovation can alleviate such risks and ensure sustainability of the food supply. The exploratory sentiment analysis also suggests that most digital users are not well-informed about such technologies

    Gaps in Information Access in Social Networks

    Full text link
    The study of influence maximization in social networks has largely ignored disparate effects these algorithms might have on the individuals contained in the social network. Individuals may place a high value on receiving information, e.g. job openings or advertisements for loans. While well-connected individuals at the center of the network are likely to receive the information that is being distributed through the network, poorly connected individuals are systematically less likely to receive the information, producing a gap in access to the information between individuals. In this work, we study how best to spread information in a social network while minimizing this access gap. We propose to use the maximin social welfare function as an objective function, where we maximize the minimum probability of receiving the information under an intervention. We prove that in this setting this welfare function constrains the access gap whereas maximizing the expected number of nodes reached does not. We also investigate the difficulties of using the maximin, and present hardness results and analysis for standard greedy strategies. Finally, we investigate practical ways of optimizing for the maximin, and give empirical evidence that a simple greedy-based strategy works well in practice.Comment: Accepted at The Web Conference 201
    corecore