Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412371
Lilian Berton, A. Lopes
Data repositories are getting larger and in most of the cases, only a small subset of their data items is labeled. In such scenario semi-supervised learning (SSL) techniques have become very relevant. Among these algorithms, those based on graphs have gained prominence in the area. An important step in graph-based SSL methods is the conversion of tabular data into a weighted graph. However, most of the SSL literature focuses on developing label inference algorithms without studying graph construction methods and its effect on the base algorithm performance. This paper provides a novel technique for building graph by using mutual kNN and labeled vertices. The use of prior information, i.e., to consider the small fraction of labeled vertices, has been underexplored in SSL literature and mutual kNN has been only explored in clustering. The empirical evaluation of the proposed graph showed promising results in terms of accuracy, when it is applied to the label propagation task. Additionally, the resultant networks have lower average degree than kNN networks.
{"title":"Informativity-based graph: Exploring mutual kNN and labeled vertices for semi-supervised learning","authors":"Lilian Berton, A. Lopes","doi":"10.1109/CASoN.2012.6412371","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412371","url":null,"abstract":"Data repositories are getting larger and in most of the cases, only a small subset of their data items is labeled. In such scenario semi-supervised learning (SSL) techniques have become very relevant. Among these algorithms, those based on graphs have gained prominence in the area. An important step in graph-based SSL methods is the conversion of tabular data into a weighted graph. However, most of the SSL literature focuses on developing label inference algorithms without studying graph construction methods and its effect on the base algorithm performance. This paper provides a novel technique for building graph by using mutual kNN and labeled vertices. The use of prior information, i.e., to consider the small fraction of labeled vertices, has been underexplored in SSL literature and mutual kNN has been only explored in clustering. The empirical evaluation of the proposed graph showed promising results in terms of accuracy, when it is applied to the label propagation task. Additionally, the resultant networks have lower average degree than kNN networks.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125180330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412369
F. Baloch, B. Cusack
The Internet has created a universal medium wherein peoples of the world engage in dialogue and participate in a myriad of activities, despite the medium lacking universally enforceable rules of conduct. This absence, or perceived weakness, of Governance in and of the Internet, has aided the creation of a sphere of existence wherein issues such as censorship, violation of the end-to-end principle, Intellectual Rights protection, cannot be debated adequately due to the lack of a suitable framework, nor can decisions by a stakeholder be enforced universally. Drawing on the literature in the field of Information Systems dealing with Governance of the Internet and Philosophy of Ontology, we question the implicit assumption that the Internet can be governed. We also investigate whether the Internet within the field of Information Sciences is ontologically defined. In stating our arguments, we utilize philosophical hyperbolic doubt as a guiding methodology.
{"title":"A discussion on Internet Governance","authors":"F. Baloch, B. Cusack","doi":"10.1109/CASoN.2012.6412369","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412369","url":null,"abstract":"The Internet has created a universal medium wherein peoples of the world engage in dialogue and participate in a myriad of activities, despite the medium lacking universally enforceable rules of conduct. This absence, or perceived weakness, of Governance in and of the Internet, has aided the creation of a sphere of existence wherein issues such as censorship, violation of the end-to-end principle, Intellectual Rights protection, cannot be debated adequately due to the lack of a suitable framework, nor can decisions by a stakeholder be enforced universally. Drawing on the literature in the field of Information Systems dealing with Governance of the Internet and Philosophy of Ontology, we question the implicit assumption that the Internet can be governed. We also investigate whether the Internet within the field of Information Sciences is ontologically defined. In stating our arguments, we utilize philosophical hyperbolic doubt as a guiding methodology.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"232 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124760513","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412379
Debanjan Mahata, Nitin Agarwal
Social media is increasingly becoming a popular platform for the public to voice their opinion and present them to a huge audience in the web. The year 2011 saw one of the greatest use of social media in the rise and spread of various events, and has been rightly defined as the year of “Social Media Democracy”, with “The Protester” being named as the TIME magazine's person of the year 2011. Due to the power law distribution of the Internet, it is highly likely that the social media sites are buried in the Long Tail. It is therefore, of utmost importance to identify quality social media sources from the Long Tail, for understanding and exploring the real-life events in depth. In this work, we propose a framework to distinguish the disparate sources from social media that provide extremely significant information about various events. Specifically, we propose information theoretic measures to identify “specific” sources for an event (often buried in the Long Tail) and “closer” entities (individuals, groups, organizations, places, etc.) for an event. We also introduce a novel evaluation strategy for validating the proposed measures. Data for the research is collected from various blogging platforms. Experiments demonstrate promising results with interesting findings.
{"title":"What does everybody know? Identifying event-specific sources from social media","authors":"Debanjan Mahata, Nitin Agarwal","doi":"10.1109/CASoN.2012.6412379","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412379","url":null,"abstract":"Social media is increasingly becoming a popular platform for the public to voice their opinion and present them to a huge audience in the web. The year 2011 saw one of the greatest use of social media in the rise and spread of various events, and has been rightly defined as the year of “Social Media Democracy”, with “The Protester” being named as the TIME magazine's person of the year 2011. Due to the power law distribution of the Internet, it is highly likely that the social media sites are buried in the Long Tail. It is therefore, of utmost importance to identify quality social media sources from the Long Tail, for understanding and exploring the real-life events in depth. In this work, we propose a framework to distinguish the disparate sources from social media that provide extremely significant information about various events. Specifically, we propose information theoretic measures to identify “specific” sources for an event (often buried in the Long Tail) and “closer” entities (individuals, groups, organizations, places, etc.) for an event. We also introduce a novel evaluation strategy for validating the proposed measures. Data for the research is collected from various blogging platforms. Experiments demonstrate promising results with interesting findings.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133514692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412373
Sarvenaz Choobdar, P. Ribeiro, Fernando M A Silva
This paper describes a methodology for finding and describing significant events in time evolving complex networks. We first group the nodes of the network in clusters, according to their similarity in terms of a set of local properties such as degree and clustering coefficient. We then monitor the behavior of these groups over time, looking for significant changes on the size of the groups. These events are notable since they show that the position of a number of nodes in the network has changed. We describe this evolution by extracting the correspondent transition patterns. We examined our methodology on three different real network datasets. Our experiments show that the discovered rules are significant and can describe the occurring events.
{"title":"Event detection in evolving networks","authors":"Sarvenaz Choobdar, P. Ribeiro, Fernando M A Silva","doi":"10.1109/CASoN.2012.6412373","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412373","url":null,"abstract":"This paper describes a methodology for finding and describing significant events in time evolving complex networks. We first group the nodes of the network in clusters, according to their similarity in terms of a set of local properties such as degree and clustering coefficient. We then monitor the behavior of these groups over time, looking for significant changes on the size of the groups. These events are notable since they show that the position of a number of nodes in the network has changed. We describe this evolution by extracting the correspondent transition patterns. We examined our methodology on three different real network datasets. Our experiments show that the discovered rules are significant and can describe the occurring events.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133576152","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412415
H. Řezanková, D. Húsek
In this study we analyze behavior of two types of coefficients for determining the suitable number of clusters obtained when fuzzy cluster analysis is applied. First one is Dunn's coefficient which contains membership degrees in its computational formula; second one is the average silhouette width, used primarily for evaluating hard clustering. There have already been attempts to compare different coefficients for determining the clustering quality or number of clusters respectively. Unfortunately coefficients for evaluating hard clustering and for fuzzy clustering were studied separately only. We tested coefficients efficiency when clustering both data set consisting of generated objects with the known number of clusters and real data sets with unknown number of clusters. The analysis showed the limitations of these two coefficients especially for the cases when clusters are really fuzzy.
{"title":"Fuzzy clustering: Determining the number of clusters","authors":"H. Řezanková, D. Húsek","doi":"10.1109/CASoN.2012.6412415","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412415","url":null,"abstract":"In this study we analyze behavior of two types of coefficients for determining the suitable number of clusters obtained when fuzzy cluster analysis is applied. First one is Dunn's coefficient which contains membership degrees in its computational formula; second one is the average silhouette width, used primarily for evaluating hard clustering. There have already been attempts to compare different coefficients for determining the clustering quality or number of clusters respectively. Unfortunately coefficients for evaluating hard clustering and for fuzzy clustering were studied separately only. We tested coefficients efficiency when clustering both data set consisting of generated objects with the known number of clusters and real data sets with unknown number of clusters. The analysis showed the limitations of these two coefficients especially for the cases when clusters are really fuzzy.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130026134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412424
Evandro Caldeira, Gabriel Brandão, A. Pereira
The volume of electronic transactions has raised a lot in last years, mainly due to the popularization of ecommerce, such as online retailers. We also observe a significant increase in the number of fraud cases, resulting in billions of dollars losses each year worldwide. Therefore it is important and necessary to developed and apply techniques that can assist in fraud detection, which motivates our research. This work aims to apply and evaluate some computational intelligence techniques to identify fraud in electronic transactions, more specifically in credit card operations. In order to evaluate the techniques, we define a concept of economic efficiency and apply them in an actual dataset of the most popular Brazilian electronic payment service. Our results show good performance in fraud detection, presenting significant gains in comparison to the actual scenario of the company.
{"title":"Characterizing and preventing chargebacks in next generation web payments services","authors":"Evandro Caldeira, Gabriel Brandão, A. Pereira","doi":"10.1109/CASoN.2012.6412424","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412424","url":null,"abstract":"The volume of electronic transactions has raised a lot in last years, mainly due to the popularization of ecommerce, such as online retailers. We also observe a significant increase in the number of fraud cases, resulting in billions of dollars losses each year worldwide. Therefore it is important and necessary to developed and apply techniques that can assist in fraud detection, which motivates our research. This work aims to apply and evaluate some computational intelligence techniques to identify fraud in electronic transactions, more specifically in credit card operations. In order to evaluate the techniques, we define a concept of economic efficiency and apply them in an actual dataset of the most popular Brazilian electronic payment service. Our results show good performance in fraud detection, presenting significant gains in comparison to the actual scenario of the company.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132047256","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412421
Sanchika Gupta, Padam Kumar, A. Sardana, A. Abraham
Cloud computing is a model that provides ubiquitous, on demand access to a shared pool of computing resources including networks, servers, storage, application and services that can be easily provisioned and released. As Cloud is a shared and distributed environment, the need for ensuring security of its critical infrastructure that includes computing, network and storage is immense. One of the critical resources to look after in cloud environment is the data which is stored in files. The files can be configuration file at servers, or private user confidential files at users own work space but they all have a risk of data modification associated with them. If user data is modified through an attack then it will decline the trust of user on cloud services and if the important configuration files are modified, they will disrupt the functioning of cloud environment, like attacker can escalate its privileges and access to critical resources through such tampering and modifications to important files. The paper solves the problem addressed and focuses on a proposal and prototype implementation of a tool built for Cloud File integrity establishment and monitoring that establishes and checks file Integrity periodically. The novelty of the approach lies in the fact that the tool does not require any database for storing the integrity of files and the integrity of the file is the compressed encrypted hash of the data stored in the file that can't be reverse engineered by an attacker easily. The tool is lightweight and initial results dictate that it is scalable and efficient. The Real time deployment and analysis of tool is under progress.
{"title":"A secure and lightweight approach for critical data security in cloud","authors":"Sanchika Gupta, Padam Kumar, A. Sardana, A. Abraham","doi":"10.1109/CASoN.2012.6412421","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412421","url":null,"abstract":"Cloud computing is a model that provides ubiquitous, on demand access to a shared pool of computing resources including networks, servers, storage, application and services that can be easily provisioned and released. As Cloud is a shared and distributed environment, the need for ensuring security of its critical infrastructure that includes computing, network and storage is immense. One of the critical resources to look after in cloud environment is the data which is stored in files. The files can be configuration file at servers, or private user confidential files at users own work space but they all have a risk of data modification associated with them. If user data is modified through an attack then it will decline the trust of user on cloud services and if the important configuration files are modified, they will disrupt the functioning of cloud environment, like attacker can escalate its privileges and access to critical resources through such tampering and modifications to important files. The paper solves the problem addressed and focuses on a proposal and prototype implementation of a tool built for Cloud File integrity establishment and monitoring that establishes and checks file Integrity periodically. The novelty of the approach lies in the fact that the tool does not require any database for storing the integrity of files and the integrity of the file is the compressed encrypted hash of the data stored in the file that can't be reverse engineered by an attacker easily. The tool is lightweight and initial results dictate that it is scalable and efficient. The Real time deployment and analysis of tool is under progress.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132139446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412370
Catherine Bernard, Hervé Debar, Salim Benayoune
Recent years have seen a tremendous growth of social networks such as Facebook and Twitter. At the same time, the share of video traffic in the Internet has also significantly increased, and the two functions are getting closer to one another. YouTube, the most famous video sharing site, allows people to comment on videos with other people while Facebook and Twitter are important vectors into sharing videos. Both video channels and social networks are increasingly vulnerable attack targets. For example, social networks are also considerable spam and phishing vectors, and Adobe Flash as the premier video streaming application is associated with numerous software vulnerabilities. This is a good way for attackers to compromise sites with embedded Flash objects. In this paper, we present the technical background of the cross-domain mechanisms and the security implications. Several recent studies have demonstrated the weakness of the cross-domain policy, leading to session hijacking or the leakage of sensitive information. Current solutions to detect these vulnerabilities use a client-side approach. The purpose of our work is to present a new approach based on network flows analysis to detect malicious behavior.
{"title":"Cross-domain vulnerabilities over social networks","authors":"Catherine Bernard, Hervé Debar, Salim Benayoune","doi":"10.1109/CASoN.2012.6412370","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412370","url":null,"abstract":"Recent years have seen a tremendous growth of social networks such as Facebook and Twitter. At the same time, the share of video traffic in the Internet has also significantly increased, and the two functions are getting closer to one another. YouTube, the most famous video sharing site, allows people to comment on videos with other people while Facebook and Twitter are important vectors into sharing videos. Both video channels and social networks are increasingly vulnerable attack targets. For example, social networks are also considerable spam and phishing vectors, and Adobe Flash as the premier video streaming application is associated with numerous software vulnerabilities. This is a good way for attackers to compromise sites with embedded Flash objects. In this paper, we present the technical background of the cross-domain mechanisms and the security implications. Several recent studies have demonstrated the weakness of the cross-domain policy, leading to session hijacking or the leakage of sensitive information. Current solutions to detect these vulnerabilities use a client-side approach. The purpose of our work is to present a new approach based on network flows analysis to detect malicious behavior.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132950863","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412412
Ebenezer Paintsil
This article introduces a taxonomy of security risk assessment approaches. The taxonomy is based on the challenges in the information system security (IS-Security) risk assessment discipline. Traditionally, classification schemes for IS-Security risk assessment approaches are motivated by business needs. They aim at offering management an effective tool for selecting methods that meet their needs rather than meeting research needs. Researchers may value new ideas, how to improve the approaches in the existing paradigms, and how to create a new paradigm to solve the unsolved problems of the existing paradigms more than business interests. The taxonomy proposed in this article aims at guiding researchers to choose research areas, and to discover new ideas and paradigms in the IS-Security risk assessment discipline.
{"title":"Taxonomy of security risk assessment approaches for researchers","authors":"Ebenezer Paintsil","doi":"10.1109/CASoN.2012.6412412","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412412","url":null,"abstract":"This article introduces a taxonomy of security risk assessment approaches. The taxonomy is based on the challenges in the information system security (IS-Security) risk assessment discipline. Traditionally, classification schemes for IS-Security risk assessment approaches are motivated by business needs. They aim at offering management an effective tool for selecting methods that meet their needs rather than meeting research needs. Researchers may value new ideas, how to improve the approaches in the existing paradigms, and how to create a new paradigm to solve the unsolved problems of the existing paradigms more than business interests. The taxonomy proposed in this article aims at guiding researchers to choose research areas, and to discover new ideas and paradigms in the IS-Security risk assessment discipline.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129741520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-11-01DOI: 10.1109/CASoN.2012.6412403
Antonio Cuomo, Franco Frattolillo, F. Landolfi, Umberto Villano
The advances in multimedia and networking technologies enable copyright infringement of digital content distributed on Internet. Such infringement, particularly promoted by peer-to-peer file-sharing, causes copyright holders lost sales every year. Consequently, methods to protect digital copyright protection are needed in a global Internet environment. Watermarking protocols are recognized as a promising technique developed to address the problem of asserting authorship and determining accountability when piracy occurs. In this paper, a simple watermarking protocol purposely designed to be easily implemented in the current model of content distribution on the Internet is proposed. The protocol is secure and able to protect the digital asset of the web-based distribution and associated rights.
{"title":"A simple and secure watermarking protocol","authors":"Antonio Cuomo, Franco Frattolillo, F. Landolfi, Umberto Villano","doi":"10.1109/CASoN.2012.6412403","DOIUrl":"https://doi.org/10.1109/CASoN.2012.6412403","url":null,"abstract":"The advances in multimedia and networking technologies enable copyright infringement of digital content distributed on Internet. Such infringement, particularly promoted by peer-to-peer file-sharing, causes copyright holders lost sales every year. Consequently, methods to protect digital copyright protection are needed in a global Internet environment. Watermarking protocols are recognized as a promising technique developed to address the problem of asserting authorship and determining accountability when piracy occurs. In this paper, a simple watermarking protocol purposely designed to be easily implemented in the current model of content distribution on the Internet is proposed. The protocol is secure and able to protect the digital asset of the web-based distribution and associated rights.","PeriodicalId":431370,"journal":{"name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130441056","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：