PETA: Privacy Enabled Task Allocation

Nitin Phuke, Saket Saurabh, M. Gharote, S. Lodha
{"title":"PETA: Privacy Enabled Task Allocation","authors":"Nitin Phuke, Saket Saurabh, M. Gharote, S. Lodha","doi":"10.1109/SCC49832.2020.00037","DOIUrl":null,"url":null,"abstract":"Service organizations need to comply with numerous data regulations to protect and preserve their customers’ privacy. Any misuse of data and privacy breach can affect the organizations’ reputation and brand image. In service delivery scenarios, such as IT support help desk, agents need to access customer data to serve them effectively. This data often includes sensitive and personally identifiable information of the customer. While some amount of data exposure is needed to serve a customer, however, exposure to more data than required could be a threat to an individual’s privacy. Hence, organizations need to design methodologies to ensure customer privacy while achieving minimal cost of operations.In this paper, we propose the Privacy Enabled Task Allocation (PETA) model for assigning customer requests to agents so that the overall cost of operations and data exposure is minimal. Data exposure is minimized by restricting the amount of data exposure per agent and by regulating the assignment of tasks. The PETA problem is modelled as an integer linear program, which is NP-hard. To solve this combinatorial hard problem, we have designed an allocation algorithm based on the linear programming relaxation for finding a quick feasible solution.","PeriodicalId":274909,"journal":{"name":"2020 IEEE International Conference on Services Computing (SCC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Services Computing (SCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCC49832.2020.00037","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Service organizations need to comply with numerous data regulations to protect and preserve their customers’ privacy. Any misuse of data and privacy breach can affect the organizations’ reputation and brand image. In service delivery scenarios, such as IT support help desk, agents need to access customer data to serve them effectively. This data often includes sensitive and personally identifiable information of the customer. While some amount of data exposure is needed to serve a customer, however, exposure to more data than required could be a threat to an individual’s privacy. Hence, organizations need to design methodologies to ensure customer privacy while achieving minimal cost of operations.In this paper, we propose the Privacy Enabled Task Allocation (PETA) model for assigning customer requests to agents so that the overall cost of operations and data exposure is minimal. Data exposure is minimized by restricting the amount of data exposure per agent and by regulating the assignment of tasks. The PETA problem is modelled as an integer linear program, which is NP-hard. To solve this combinatorial hard problem, we have designed an allocation algorithm based on the linear programming relaxation for finding a quick feasible solution.
PETA:启用隐私的任务分配
服务机构需要遵守大量的数据法规来保护和维护客户的隐私。任何数据滥用和隐私泄露都会影响组织的声誉和品牌形象。在服务交付场景中,例如IT支持帮助台,座席需要访问客户数据以有效地为客户提供服务。这些数据通常包括客户的敏感和个人身份信息。虽然为客户提供服务需要一定数量的数据,但是,暴露过多的数据可能会对个人隐私构成威胁。因此,组织需要设计方法来确保客户隐私,同时实现最小的操作成本。在本文中,我们提出了支持隐私的任务分配(PETA)模型,用于将客户请求分配给代理,从而使操作和数据暴露的总体成本最小化。通过限制每个代理的数据暴露量和调节任务分配,可以最大限度地减少数据暴露。PETA问题被建模为一个整数线性规划,是np困难的。为了解决这一组合难题,我们设计了一种基于线性规划松弛的分配算法,以便快速找到可行解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信