IMR:MM-1B: New directions in Privacy-Preserving Telemetry
IMR:MM-1B: New directions in Privacy-Preserving Telemetry
批准号:
2220450
负责人:
Rafail Ostrovsky
金额:
$60.0万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2022
资助国家:
美国
项目状态:
未结题
起止时间:
2022-09-01 至 2025-08-31
关键词:
中文摘要
几乎所有的现代设备都连接到了互联网。家用电器、智能手表、手机、汽车、工业工具,甚至体重秤都连接在一起。例如,三星智能电视向三星报告消费者的每一次选择和每次点击,以及消费者观看任何节目的时长。互联网浏览器收集用户浏览数据。互联网服务提供商收集用户IP访问数据。收集的大量数据通常用于改善用户体验、服务和定向广告。然而,收集关于每个个人消费者或组织的更具侵入性的数据是以颤抖地侵犯隐私为代价的,并增加了收集的数据可能被用于其他(意外)目的的风险,例如反情报、政治运动以及身份盗窃和其他犯罪活动。如何允许组织在不侵犯个人消费者隐私的情况下收集有关流数据的汇总统计数据?本研究旨在探索以保护隐私的方式计算有关流数据的汇总统计数据的新方法,扩展了PRIO、PRIO+和Pplar等系统。该框架是,用户或设备以秘密共享的方式将他们的数据发送到两个服务器,这两个服务器然后相互通信以计算遥测数据,同时不泄露(彼此或任何其他人)用户的个人数据。例如,Firefox浏览器在名为“原始遥测”的Mozilla项目中采用了这种方法。本研究的目标是通过探索如何将Alon、Matias和Szegedy开创的(无隐私)流传输算法推广到有隐私的流传输算法,从而探索在这种情况下私密计算遥测数据的更有效的方法。更具体地说,我们可以通过两台服务器接收(秘密共享的)流,以保护隐私和高效的方式计算频率矩吗?虽然这看起来是一个非常特殊的问题,但实际上,它是可以推广的,正如PI在题为“零-一频率定律”的论文中所展示的那样。这给我们带来了一个更有趣的问题:如何对所有可以在一次传输秘密共享数据和使用多对数内存的情况下进行私人计算的函数进行分类。我们的目标是为大容量数据流的隐私保护分析问题提供新的工具,这在NSF互联网测量研究征求建议书的MM-1B部分特别提到。如果成功,我们的方法将允许大规模和高效地计算所有聚集统计数据,这些统计数据可以在小内存中以保护隐私的方式计算。该项目还将把MPC对流数据的最先进性能提升到互联网大小的流计算。最后,我们的建议呼吁对研究生和本科生进行强有力的培训,包括积极寻找少数族裔和女性学生进入密码学研究。这一奖项反映了NSF的法定使命,并通过使用基金会的智力优势和更广泛的影响审查标准进行评估,被认为值得支持。
英文摘要
Almost all modern-day devices are connected to the internet. Home appliances, smart watches, phones, cars, industrial tools, and even body weight scales are connected. For example, Samsung Smart TV reports back to Samsung every choice and every click that a consumer makes as well as the duration that a consumer watches any program. Internet browsers collect user browsing data. Internet Service Providers collect user IP access data. The torrent of data collected is typically used to improve user experience, service, and target advertisements. However, collection of ever more intrusive data regarding each individual consumer or organization comes at the price of tremulous invasion of privacy, and increases the risk that the data collected can be harvested for other (unintended) purposes, such as counter-intelligence, political campaigns, as well as identity theft and other criminal activity. How do we allow organizations to collect aggregate statistics regarding streaming data without violating individual consumer privacy?This research aims to explore novel ways to compute aggregate statistics on streaming data in a privacy-preserving way, extending systems such as PRIO, PRIO+, and Poplar. The framework is that users or devices send their data in a secret-shared way to two servers which then communicate with each other to compute telemetry data while not revealing (to each other or anyone else) users’ individual data. This approach was adopted, for example, by the Firefox browser in a Mozilla project titled “Origin Telemetry”. The goals of this research are to explore even more efficient methods to privately compute telemetry data in this setting by exploring how to generalize streaming algorithms (without privacy) that were pioneered by Alon, Matias, and Szegedy to streaming algorithms with privacy. More specifically, can we compute frequency moments in a privacy-preserving and efficient manner by two servers receiving a (secret-shared) stream? While this seems like a very specialized question, it is, in fact, generalizable, as shown by the PI in the paper titled “Zero-One Frequency Laws”. This brings us to the even more interesting question: how to classify all functions that can be privately computed over streaming secret-shared data in one pass and with poly-logarithmic memory. Our goal is to provide new tools for the questions of privacy-preserving analysis of streaming large volume data, specifically called out in section MM-1B of the NSF Internet Measurement Research call for proposals. If successful, our methods will allow large-scale and efficient computation of all aggregate statistics that can be computed in small memory in a privacy-preserving way. This project will also advance the state-of-the-art performance of MPC on streaming data to Internet-size streaming computations. Lastly, our proposal calls for robust training of graduate and undergraduate students, including actively seeking minorities and female students to enter cryptographic research.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
期刊论文(1)
专著(0)
科研奖励(0)
会议论文
List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing
列出不经意转移及其在轮次最优黑盒多方抛硬币中的应用
DOI:
--
发表时间:
2023
期刊:
CRYPTO 2023 conference proceedgins
影响因子:
--
作者:
[Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Hendrik Waldner]
通讯作者:
Hendrik Waldner
Collaborative Research: SaTC: CORE: Medium: New Constructions for Garbled Computation
-
批准号:2246355
-
项目类别:Standard Grant
-
资助金额:$40.0万
-
财政年份:2023
-
负责人:Rafail Ostrovsky
-
依托单位:
SaTC: CORE: Small: Collaborative: Exploring the Boundaries of Large-Scale Secure Computation
-
批准号:2001096
-
项目类别:Standard Grant
-
资助金额:$30.0万
-
财政年份:2020
-
负责人:Rafail Ostrovsky
-
依托单位:
NSFSaTC-BSF: TWC: Small: Cryptography and Communication Complexity
-
批准号:1619348
-
项目类别:Standard Grant
-
资助金额:$50.0万
-
财政年份:2016
-
负责人:Rafail Ostrovsky
-
依托单位:
IEEE Symposium on Foundations of Computer Science (FOCS) 2012, New Brunswick, New Jersey Oct 19-23, 2012
-
批准号:1252272
-
项目类别:Standard Grant
-
资助金额:$1.8万
-
财政年份:2012
-
负责人:Rafail Ostrovsky
-
依托单位:
TC: Small: Towards Resettable & Statistical Security in Zero Knowledge
-
批准号:1118126
-
项目类别:Standard Grant
-
资助金额:$47.35万
-
财政年份:2011
-
负责人:Rafail Ostrovsky
-
依托单位:
CIF: Small: Energy-Efficient Scheduling and Load Balancing
-
批准号:1016540
-
项目类别:Continuing Grant
-
资助金额:$34.5万
-
财政年份:2010
-
负责人:Rafail Ostrovsky
-
依托单位:
An In-Depth Study of Homomorphic Encryption in Cryptography
-
批准号:0830803
-
项目类别:Standard Grant
-
资助金额:$100.0万
-
财政年份:2008
-
负责人:Rafail Ostrovsky
-
依托单位:
Collaborative Research: CT-T: Cryptographic Techniques for Searching and Processing Encrypted Data
-
批准号:0716389
-
项目类别:Continuing Grant
-
资助金额:$32.0万
-
财政年份:2007
-
负责人:Rafail Ostrovsky
-
依托单位:
CT-ISG: Foundations of Position Based Cryptography
-
批准号:0716835
-
项目类别:Standard Grant
-
资助金额:$35.0万
-
财政年份:2007
-
负责人:Rafail Ostrovsky
-
依托单位:
Collaborative Research: A Survivable Information Infrastructure for National Civilian BioDefense
-
批准号:0430254
-
项目类别:Continuing Grant
-
资助金额:$40.4万
-
财政年份:2004
-
负责人:Rafail Ostrovsky
-
依托单位:
Mathematical Sciences: Postdoctoral Research Fellowship
-
批准号:9206267
-
项目类别:Fellowship Award
-
资助金额:$7.5万
-
财政年份:1992
-
负责人:Rafail Ostrovsky
-
依托单位:
国内基金
海外基金
登录
查看更多内容
水下CSP技术在结直肠10~15mm息肉切除的临床应用研究
-
批准号:
-
项目类别:省市级项目
-
资助金额:--
-
批准年份:2025
-
负责人:张兴
-
依托单位:
900mm缸径及以上大型船用曲轴曲柄锻件制造技术研究
-
批准号:
-
项目类别:省市级项目
-
资助金额:--
-
批准年份:2025
-
负责人:
-
依托单位:
稀土R2MM'O7磁阻挫材料相变调控与磁制冷性能优化
-
批准号:Z25E020008
-
项目类别:省市级项目
-
资助金额:--
-
批准年份:2025
-
负责人:张义坤
-
依托单位:
重稀土基双钙钛矿R2MM'O6中相变驱动的磁热效应增强与临界行为研究
-
批准号:
-
项目类别:青年科学基金项目
-
资助金额:--
-
批准年份:2024
-
负责人:李苍龙
-
依托单位:
水下内镜下黏膜切除术治疗头端小于10mm带蒂结直肠病变的安全性和疗效分析
-
批准号:
-
项目类别:省市级项目
-
资助金额:5.0万元
-
批准年份:2024
-
负责人:董智瑀
-
依托单位:
基于QM/MM的计算机辅助药物设计方法对去泛素化酶(DUBs)共价小分子抑制剂的设计与研究
-
批准号:82304385
-
项目类别:青年科学基金项目
-
资助金额:30万元
-
批准年份:2023
-
负责人:关良宇
-
依托单位:
澳洲茄边碱抑制MM细胞HDAC2磷酸化激活自噬增强T细胞抗MM效应研究
-
批准号:82304987
-
项目类别:青年科学基金项目
-
资助金额:30万元
-
批准年份:2023
-
负责人:董晓庆
-
依托单位:
酶催化高毒有机磷化合物降解机制与活性调控的QM/MM多尺度模拟研究
-
批准号:22373078
-
项目类别:面上项目
-
资助金额:50万元
-
批准年份:2023
-
负责人:曹泽星
-
依托单位:
METTL1介导的tRNAm7G修饰在多发性骨髓瘤中调控MM细胞铁死亡的作用机制及临床价值研究
-
批准号:82372313
-
项目类别:面上项目
-
资助金额:49.00万元
-
批准年份:2023
-
负责人:周琳
-
依托单位:
利用等离子增强型分子层沉积技术实现0.5mm弯折挠度半径的超柔性薄膜封装技术研究
-
批准号:62374070
-
项目类别:面上项目
-
资助金额:48万元
-
批准年份:2023
-
负责人:段羽
-
依托单位: