Mutually Private Verifiable Machine Learning As-a-service: A Distributed Approach

Shadan Ghaffaripour, A. Miri
{"title":"Mutually Private Verifiable Machine Learning As-a-service: A Distributed Approach","authors":"Shadan Ghaffaripour, A. Miri","doi":"10.1109/AIIoT52608.2021.9454203","DOIUrl":null,"url":null,"abstract":"Reliability is a crucial component to machine-learning-as-a-service platforms, as more and more critical applications depend on them. Thus, mechanisms employed to assure the integrity of computations performed on such platforms are pivotal to their robust functioning. Moreover, privacy protection, and performance guarantee at scale, are other major challenges surrounding these platforms that are by no means straightforward to overcome at the same time. In this paper, we have proposed a novel distributed approach, which uses specialized composable proof systems at its core, to respond to these challenges. At a high level, we adopt a divide-and-conquer approach to build efficient proof systems for machine-learning-based services in order to ensure the correctness of results. More precisely, the mathematical formulation of the machine learning task is divided into multiple parts, each of which is handled by a different specialized proof system; these proof systems are then combined with the commit-and-prove methodology to guarantee correctness as a whole. With privacy safeguards built into the design, our approach also assures that neither user data nor model parameters, which constitute the intellectual property of service providers are exposed in the process. We have showcased the usability of our approach within a machine learning service provider that offers classification services through a linear support vector machine (SVM) model. Our complexity analysis indicates that our system could be used in practical settings.","PeriodicalId":443405,"journal":{"name":"2021 IEEE World AI IoT Congress (AIIoT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE World AI IoT Congress (AIIoT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AIIoT52608.2021.9454203","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Reliability is a crucial component to machine-learning-as-a-service platforms, as more and more critical applications depend on them. Thus, mechanisms employed to assure the integrity of computations performed on such platforms are pivotal to their robust functioning. Moreover, privacy protection, and performance guarantee at scale, are other major challenges surrounding these platforms that are by no means straightforward to overcome at the same time. In this paper, we have proposed a novel distributed approach, which uses specialized composable proof systems at its core, to respond to these challenges. At a high level, we adopt a divide-and-conquer approach to build efficient proof systems for machine-learning-based services in order to ensure the correctness of results. More precisely, the mathematical formulation of the machine learning task is divided into multiple parts, each of which is handled by a different specialized proof system; these proof systems are then combined with the commit-and-prove methodology to guarantee correctness as a whole. With privacy safeguards built into the design, our approach also assures that neither user data nor model parameters, which constitute the intellectual property of service providers are exposed in the process. We have showcased the usability of our approach within a machine learning service provider that offers classification services through a linear support vector machine (SVM) model. Our complexity analysis indicates that our system could be used in practical settings.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
相互私有的可验证机器学习即服务:一种分布式方法
可靠性是机器学习即服务平台的关键组成部分,因为越来越多的关键应用依赖于它们。因此,用于确保在此类平台上执行的计算的完整性的机制对其稳健功能至关重要。此外,隐私保护和大规模性能保证是围绕这些平台的其他主要挑战,同时也绝非易事。在本文中,我们提出了一种新的分布式方法,它以专门的可组合证明系统为核心,来应对这些挑战。在高层次上,我们采用分而治之的方法为基于机器学习的服务构建高效的证明系统,以确保结果的正确性。更准确地说,机器学习任务的数学公式分为多个部分,每个部分由不同的专业证明系统处理;然后将这些证明系统与提交-证明方法结合起来,以保证整体上的正确性。由于在设计中内置了隐私保护措施,我们的方法还确保构成服务提供商知识产权的用户数据和模型参数不会在流程中暴露。我们已经在一个机器学习服务提供商中展示了我们方法的可用性,该服务提供商通过线性支持向量机(SVM)模型提供分类服务。我们的复杂性分析表明,我们的系统可以在实际环境中使用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
CR-LPWAN: issues, solutions and research directions Automatic Detection of Vehicle Congestion by Using Roadside Unit Improved Noise Filtering Technique For Wake Detection In SAR Image Under Rough Sea Condition First Enriched Legal Database in Bangladesh with Efficient Search Optimization and Data Visualization for Law Students and Lawyers Differentially-Private Federated Learning with Long-Term Budget Constraints Using Online Lagrangian Descent
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1