Pub Date : 2012-07-16DOI: 10.1109/PST.2012.6297953
G. Peters, K. Bunte, M. Strickert, Michael Biehl, T. Villmann
One aspect of self-organizing systems is their desired ability to be self-learning, i.e., to be able to adapt dynamically to conditions in their environment. This quality is awkward especially if it comes to applications in security or safety-sensitive areas. Here a step towards more trustful systems could be taken by providing transparency of the processes of a system. An important means of giving feedback to an operator is the visualization of the internal processes of a system. In this position paper we address the problem of visualizing dynamic processes especially in self-learning systems. We take an existing self-learning system from the field of computer vision as an example from which we derive questions of general interest such as possible options to visualize the flow of information in a dynamic learning system or the visualization of symbolic data. As a side effect the visualization of learning processes may provide a better understanding of underlying principles of learning in general, i.e, also in biological systems. That may also facilitate improved designs of future self-learning systems.
{"title":"Visualization of processes in self-learning systems","authors":"G. Peters, K. Bunte, M. Strickert, Michael Biehl, T. Villmann","doi":"10.1109/PST.2012.6297953","DOIUrl":"https://doi.org/10.1109/PST.2012.6297953","url":null,"abstract":"One aspect of self-organizing systems is their desired ability to be self-learning, i.e., to be able to adapt dynamically to conditions in their environment. This quality is awkward especially if it comes to applications in security or safety-sensitive areas. Here a step towards more trustful systems could be taken by providing transparency of the processes of a system. An important means of giving feedback to an operator is the visualization of the internal processes of a system. In this position paper we address the problem of visualizing dynamic processes especially in self-learning systems. We take an existing self-learning system from the field of computer vision as an example from which we derive questions of general interest such as possible options to visualize the flow of information in a dynamic learning system or the visualization of symbolic data. As a side effect the visualization of learning processes may provide a better understanding of underlying principles of learning in general, i.e, also in biological systems. That may also facilitate improved designs of future self-learning systems.","PeriodicalId":434948,"journal":{"name":"2012 Tenth Annual International Conference on Privacy, Security and Trust","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133664278","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-07-16DOI: 10.1109/PST.2012.6297954
Lukas Klejnowski, Yvonne Bernard, C. Müller-Schloer, J. Hähner
In this paper we present an open multi-agent based Desktop Grid System that improves the performance of cooperative clients while decreasing the performance of non-cooperative clients as an incentive for good conduct. This is achieved by trust-based job client and worker algorithms that take into account the local and global history of the credibility and reliability experiences between agents, as well as their current state. We show with simulation results that the algorithms provide performance increases by applying standard Desktop Grid performance metrics and evaluating the system in several scenarios with a varying number of disturbances to the system. In this paper, we focus on the task of minimising wasteful computation and thus increasing the benefit of grid participation for the agents.
{"title":"Using Trust to reduce wasteful computation in open Desktop Grid Systems","authors":"Lukas Klejnowski, Yvonne Bernard, C. Müller-Schloer, J. Hähner","doi":"10.1109/PST.2012.6297954","DOIUrl":"https://doi.org/10.1109/PST.2012.6297954","url":null,"abstract":"In this paper we present an open multi-agent based Desktop Grid System that improves the performance of cooperative clients while decreasing the performance of non-cooperative clients as an incentive for good conduct. This is achieved by trust-based job client and worker algorithms that take into account the local and global history of the credibility and reliability experiences between agents, as well as their current state. We show with simulation results that the algorithms provide performance increases by applying standard Desktop Grid performance metrics and evaluating the system in several scenarios with a varying number of disturbances to the system. In this paper, we focus on the task of minimising wasteful computation and thus increasing the benefit of grid participation for the agents.","PeriodicalId":434948,"journal":{"name":"2012 Tenth Annual International Conference on Privacy, Security and Trust","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129017545","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-07-16DOI: 10.1109/PST.2012.6297917
Aditi Ramachandran, L. Singh, E. Porter, F. Nagle
While re-identification of sensitive data has been studied extensively, with the emergence of online social networks and the popularity of digital communications, the ability to use public data for re-identification has increased. This work begins by presenting two different cases studies for sensitive data re-identification. We conclude that targeted re-identification using traditional variables is not only possible, but fairly straightforward given the large amount of public data available. However, our first case study also indicates that large-scale re-identification is less likely. We then consider methods for agencies such as the Census Bureau to identify variables that cause individuals to be vulnerable without testing all combinations of variables. We show the effectiveness of different strategies on a Census Bureau data set and on a synthetic data set.
{"title":"Exploring re-identification risks in public domains","authors":"Aditi Ramachandran, L. Singh, E. Porter, F. Nagle","doi":"10.1109/PST.2012.6297917","DOIUrl":"https://doi.org/10.1109/PST.2012.6297917","url":null,"abstract":"While re-identification of sensitive data has been studied extensively, with the emergence of online social networks and the popularity of digital communications, the ability to use public data for re-identification has increased. This work begins by presenting two different cases studies for sensitive data re-identification. We conclude that targeted re-identification using traditional variables is not only possible, but fairly straightforward given the large amount of public data available. However, our first case study also indicates that large-scale re-identification is less likely. We then consider methods for agencies such as the Census Bureau to identify variables that cause individuals to be vulnerable without testing all combinations of variables. We show the effectiveness of different strategies on a Census Bureau data set and on a synthetic data set.","PeriodicalId":434948,"journal":{"name":"2012 Tenth Annual International Conference on Privacy, Security and Trust","volume":"261 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116821383","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-07-16DOI: 10.1109/PST.2012.6297928
Hanine Tout, A. Mourad, H. Yahyaoui, C. Talhi, H. Otrok
By handling the orchestration, composition and interaction of Web services, the Business Process Execution Language (BPEL) has gained tremendous interest. However, such process-based language does not assure a secure environment for Web services composition. The key solution cannot be seen as a simple embed of security properties in the source code of the business logic since the dynamism of the BPEL process will be affected when the security measures get updated. In this context, several approaches have emerged to tackle such issue by offering the ability to specify the security properties independently from the business logic based on policy languages. Nevertheless, these languages are complex, verbose and require programming expertise. Owing to these difficulties, specifying and the enforcing BPEL security policies become very tedious tasks. To mitigate these challenges, we propose in this paper, a novel approach that takes advantage of both the Unified Modeling Language (UML) and the Aspect Oriented Paradigm (AOP). By elaborating a UML extension mechanism, called UML Profile, our approach provides the users with model-based capabilities to specify aspects that enforce the required security policies. On the other hand, it offers a high level of flexibility when enforcing security hardening solutions in the BPEL process by exploiting the AOP approach. We illustrate our approach through an example of the dynamic generation and integration of model-based security aspects in a BPEL process.
{"title":"Towards a BPEL model-driven approach for Web services security","authors":"Hanine Tout, A. Mourad, H. Yahyaoui, C. Talhi, H. Otrok","doi":"10.1109/PST.2012.6297928","DOIUrl":"https://doi.org/10.1109/PST.2012.6297928","url":null,"abstract":"By handling the orchestration, composition and interaction of Web services, the Business Process Execution Language (BPEL) has gained tremendous interest. However, such process-based language does not assure a secure environment for Web services composition. The key solution cannot be seen as a simple embed of security properties in the source code of the business logic since the dynamism of the BPEL process will be affected when the security measures get updated. In this context, several approaches have emerged to tackle such issue by offering the ability to specify the security properties independently from the business logic based on policy languages. Nevertheless, these languages are complex, verbose and require programming expertise. Owing to these difficulties, specifying and the enforcing BPEL security policies become very tedious tasks. To mitigate these challenges, we propose in this paper, a novel approach that takes advantage of both the Unified Modeling Language (UML) and the Aspect Oriented Paradigm (AOP). By elaborating a UML extension mechanism, called UML Profile, our approach provides the users with model-based capabilities to specify aspects that enforce the required security policies. On the other hand, it offers a high level of flexibility when enforcing security hardening solutions in the BPEL process by exploiting the AOP approach. We illustrate our approach through an example of the dynamic generation and integration of model-based security aspects in a BPEL process.","PeriodicalId":434948,"journal":{"name":"2012 Tenth Annual International Conference on Privacy, Security and Trust","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129634223","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-07-16DOI: 10.1109/PST.2012.6297944
Manuel Lafond, Pierre-Olivier Brosseau, Esma Aïmeur
It is not uncommon for business managers to use recent innovations in information and communications technology to monitor employees and job candidates. These methods not only rely on heavy surveillance during working hours of employees but can also be applied outside their professional environment, to impinge on their personal lives. Surveillance techniques encompass such traditional means like recording cameras to more recent methods including analyzing social networks pages, performing extensive web searches and dealing with online data brokers. While monitoring initiatives set up by employers can have benefits for companies, the threat to privacy they entail can deteriorate the mental and physical health of employees and have a negative impact on the quality of relationship between colleagues. Businesses have a social responsibility and need to ensure that their behavior does not infringe upon their employee's rights to privacy. In this non-technical paper, we discuss some online approaches adopted by companies regarding employee surveillance. We elaborate on various methods employed by managers to monitor their employees and gain as much information as possible on job candidates. Then, these techniques are further discussed from the standpoint of their moral and legal perspectives with regards to privacy rights.
{"title":"Privacy invasion in business environments","authors":"Manuel Lafond, Pierre-Olivier Brosseau, Esma Aïmeur","doi":"10.1109/PST.2012.6297944","DOIUrl":"https://doi.org/10.1109/PST.2012.6297944","url":null,"abstract":"It is not uncommon for business managers to use recent innovations in information and communications technology to monitor employees and job candidates. These methods not only rely on heavy surveillance during working hours of employees but can also be applied outside their professional environment, to impinge on their personal lives. Surveillance techniques encompass such traditional means like recording cameras to more recent methods including analyzing social networks pages, performing extensive web searches and dealing with online data brokers. While monitoring initiatives set up by employers can have benefits for companies, the threat to privacy they entail can deteriorate the mental and physical health of employees and have a negative impact on the quality of relationship between colleagues. Businesses have a social responsibility and need to ensure that their behavior does not infringe upon their employee's rights to privacy. In this non-technical paper, we discuss some online approaches adopted by companies regarding employee surveillance. We elaborate on various methods employed by managers to monitor their employees and gain as much information as possible on job candidates. Then, these techniques are further discussed from the standpoint of their moral and legal perspectives with regards to privacy rights.","PeriodicalId":434948,"journal":{"name":"2012 Tenth Annual International Conference on Privacy, Security and Trust","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121909166","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-07-16DOI: 10.1109/PST.2012.6297936
Mehrdad Nojoumian, Douglas R Stinson
We first review the notion of social secret sharing and its trust function. We then illustrate how this construction can be used in cloud computing to create a self-organizing environment. In fact, we show distributed secure systems using threshold secret sharing can be adjusted automatically based on the resource availability of the cloud providers. Accordingly, we propose a new trust function with social characteristics in order to improve the existing social secret sharing scheme.
{"title":"Social secret sharing in cloud computing using a new trust function","authors":"Mehrdad Nojoumian, Douglas R Stinson","doi":"10.1109/PST.2012.6297936","DOIUrl":"https://doi.org/10.1109/PST.2012.6297936","url":null,"abstract":"We first review the notion of social secret sharing and its trust function. We then illustrate how this construction can be used in cloud computing to create a self-organizing environment. In fact, we show distributed secure systems using threshold secret sharing can be adjusted automatically based on the resource availability of the cloud providers. Accordingly, we propose a new trust function with social characteristics in order to improve the existing social secret sharing scheme.","PeriodicalId":434948,"journal":{"name":"2012 Tenth Annual International Conference on Privacy, Security and Trust","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132875895","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-07-16DOI: 10.1109/PST.2012.6297930
Jaehong Park, Dang Nguyen, R. Sandhu
Existence of data provenance information in a system raises at least two security-related issues. One is how provenance data can be used to enhance security in the system and the other is how to protect provenance data which might be more sensitive than the data itself. Recent data provenance-related access control literature mainly focuses on the latter issue of protecting provenance data. In this paper, we propose a novel provenance-based access control model that addresses the former objective. Using provenance data for access control to the underlying data facilitates additional capabilities beyond those available in traditional access control models. We utilize a notion of dependency as the key foundation for access control policy specification. Dependency-based policy provides simplicity and effectiveness in policy specification and access control administration. We show our model can support dynamic separation of duty, workflow control, origin-based control, and object versioning. The proposed model identifies essential components and concepts and provides a foundational base model for provenance-based access control. We further discuss possible extensions of the proposed base model for enhanced access controls.
{"title":"A provenance-based access control model","authors":"Jaehong Park, Dang Nguyen, R. Sandhu","doi":"10.1109/PST.2012.6297930","DOIUrl":"https://doi.org/10.1109/PST.2012.6297930","url":null,"abstract":"Existence of data provenance information in a system raises at least two security-related issues. One is how provenance data can be used to enhance security in the system and the other is how to protect provenance data which might be more sensitive than the data itself. Recent data provenance-related access control literature mainly focuses on the latter issue of protecting provenance data. In this paper, we propose a novel provenance-based access control model that addresses the former objective. Using provenance data for access control to the underlying data facilitates additional capabilities beyond those available in traditional access control models. We utilize a notion of dependency as the key foundation for access control policy specification. Dependency-based policy provides simplicity and effectiveness in policy specification and access control administration. We show our model can support dynamic separation of duty, workflow control, origin-based control, and object versioning. The proposed model identifies essential components and concepts and provides a foundational base model for provenance-based access control. We further discuss possible extensions of the proposed base model for enhanced access controls.","PeriodicalId":434948,"journal":{"name":"2012 Tenth Annual International Conference on Privacy, Security and Trust","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128260970","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-07-16DOI: 10.1109/PST.2012.6297951
J. Pitt
Open computing systems, from sensor networks to Smart-Grids, face the same challenge: a set of autonomous, heterogenous agents, needing to collectivise and distribute resources without a centralised decision-making authority. One possible solution is to collectively agree a set of rules for resource provision and appropriation, but there remains the possibility for some agents not to comply with the rules. Therefore, some notion of “trust” with respect to rule compliance is essential. In this talk, we use a notion of trust stemming from analytic philosophy, whereby “trust” is analysed as a belief that there is a rule and an expectation that someone else's behaviour will conform to the rule, underpinned by a reparation mechanism if it does not. In the context of an electronic institution, whose rules are based on Elinor's Ostrom's principles of enduring institutions for common-pool resource management, we consider how this notion of “trust” can be represented by principles of distributive and retributive justice, and we report some experimental results in self-organisation of the “justice system”.
{"title":"Distributive and retributive justice in self-organising electronic institutions","authors":"J. Pitt","doi":"10.1109/PST.2012.6297951","DOIUrl":"https://doi.org/10.1109/PST.2012.6297951","url":null,"abstract":"Open computing systems, from sensor networks to Smart-Grids, face the same challenge: a set of autonomous, heterogenous agents, needing to collectivise and distribute resources without a centralised decision-making authority. One possible solution is to collectively agree a set of rules for resource provision and appropriation, but there remains the possibility for some agents not to comply with the rules. Therefore, some notion of “trust” with respect to rule compliance is essential. In this talk, we use a notion of trust stemming from analytic philosophy, whereby “trust” is analysed as a belief that there is a rule and an expectation that someone else's behaviour will conform to the rule, underpinned by a reparation mechanism if it does not. In the context of an electronic institution, whose rules are based on Elinor's Ostrom's principles of enduring institutions for common-pool resource management, we consider how this notion of “trust” can be represented by principles of distributive and retributive justice, and we report some experimental results in self-organisation of the “justice system”.","PeriodicalId":434948,"journal":{"name":"2012 Tenth Annual International Conference on Privacy, Security and Trust","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126035800","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-07-16DOI: 10.1109/PST.2012.6297913
Alexandre Viejo, Jordi Castellà-Roca, Oriol Bernado, J. M. Mateo-Sanz
Web search engines profile their users by storing and analyzing their past searches. Profiles reflect the interests of the users and enable web search engines to offer a better service. In this way, search results are personalized to fulfill the expectations of each individual user. Nevertheless, this service is not provided without cost. User profiles contain information that can be considered private and personal. This represents a serious privacy threat which must be addressed. Several privacy-preserving techniques which try to prevent this situation can be found in the literature. In this paper, we focus on those that work directly in the computer of the users without requiring any external entity. More specifically, we propose a new single-party scheme that addresses the trade-off between privacy and quality of service but it does not require any change at the server side. The performance of this new method has been evaluated using real search queries extracted from the AOL's files. The results achieved show that our proposal works as expected and it can be considered a proper option for those users who are concerned about their privacy.
{"title":"Single-party private web search","authors":"Alexandre Viejo, Jordi Castellà-Roca, Oriol Bernado, J. M. Mateo-Sanz","doi":"10.1109/PST.2012.6297913","DOIUrl":"https://doi.org/10.1109/PST.2012.6297913","url":null,"abstract":"Web search engines profile their users by storing and analyzing their past searches. Profiles reflect the interests of the users and enable web search engines to offer a better service. In this way, search results are personalized to fulfill the expectations of each individual user. Nevertheless, this service is not provided without cost. User profiles contain information that can be considered private and personal. This represents a serious privacy threat which must be addressed. Several privacy-preserving techniques which try to prevent this situation can be found in the literature. In this paper, we focus on those that work directly in the computer of the users without requiring any external entity. More specifically, we propose a new single-party scheme that addresses the trade-off between privacy and quality of service but it does not require any change at the server side. The performance of this new method has been evaluated using real search queries extracted from the AOL's files. The results achieved show that our proposal works as expected and it can be considered a proper option for those users who are concerned about their privacy.","PeriodicalId":434948,"journal":{"name":"2012 Tenth Annual International Conference on Privacy, Security and Trust","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133154563","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}
Gianpiero Costantino, F. Martinelli, P. Santi, D. Amoruso
In this paper, we present an implementation of the FairPlay framework for secure two-party function computation on Android smartphones, which we call MobileFairPlay. Mobile-FairPlay allows high-level programming of several secure two-party protocols, including protocols for the Millionaire problem, set intersection, computation of Jaccard similarity coefficient, etc. All these functions are useful in the context of mobile social networks and opportunistic networks, where parties are often requested to exchange sensitive information (list of contacts, interest profiles, etc.) to optimize network operation. To demonstrate the feasibility of MobileFairPlay, we present an application to privacy-preserving interest-casting in opportunistic networks, implementing a recently proposed protocol. We tested running times of the implemented protocol on several Android phones, obtaining very reasonable (up to 5sec) running times. These results clearly promote MobileFairPlay as a feasible security framework for mobile environments.
{"title":"An implementation of secure two-party computation for smartphones with application to privacy-preserving interest-cast","authors":"Gianpiero Costantino, F. Martinelli, P. Santi, D. Amoruso","doi":"10.1145/2348543.2348607","DOIUrl":"https://doi.org/10.1145/2348543.2348607","url":null,"abstract":"In this paper, we present an implementation of the FairPlay framework for secure two-party function computation on Android smartphones, which we call MobileFairPlay. Mobile-FairPlay allows high-level programming of several secure two-party protocols, including protocols for the Millionaire problem, set intersection, computation of Jaccard similarity coefficient, etc. All these functions are useful in the context of mobile social networks and opportunistic networks, where parties are often requested to exchange sensitive information (list of contacts, interest profiles, etc.) to optimize network operation. To demonstrate the feasibility of MobileFairPlay, we present an application to privacy-preserving interest-casting in opportunistic networks, implementing a recently proposed protocol. We tested running times of the implemented protocol on several Android phones, obtaining very reasonable (up to 5sec) running times. These results clearly promote MobileFairPlay as a feasible security framework for mobile environments.","PeriodicalId":434948,"journal":{"name":"2012 Tenth Annual International Conference on Privacy, Security and Trust","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132765620","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
扫码关注我们
求助内容：
应助结果提醒方式：