CIF: Small: Secure and Private Function Computation by Interactive Communication

CIF：小型：通过交互式通信进行安全且私密的函数计算

• 批准号: 1527354
• 负责人: Prakash Narayan
• 金额: $ 50万
• 依托单位: University of Maryland, College Park
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2015
• 资助国家: 美国
• 起止时间: 2015-09-01 至 2021-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1527354&HistoricalAwards=false
• 关键词: CIF; Small; Secure; Private; Function

This research takes an information theoretic approach to develop principles that govern secure or private function computation by multiple terminals that host user data. The goal of the terminals is to compute locally and reliably, a given function of all the possibly correlated user data, using an interactive communication protocol. The protocol is required to satisfy separate security and privacy conditions. The former stipulates for each terminal that a coalition of the remaining terminals should glean no more information about the data at the terminal from their own data and the communication -- than can be obtained from the function value. The latter protects each individual user's data at a terminal from a similar coalition. A common framework is developed for analyzing the distinct concepts of security and privacy, and new information theoretic formulations and approaches are proposed with the objective of understanding basic underlying principles. Potential applications arise, for instance, in: hospital databases that store clinical drug trial results or university databases with student performance records; private information retrieval from user data stored in private clouds; and security and privacy certifications for the identities/locations of communities and individuals participating in crowd-sourced traffic and navigation services. The investigators' technical approach involves the development of a theory with three main distinguishing features. It (i) establishes a key role for interactive communication in reducing communication complexity, and in enhancing security and privacy; and formulates computable measures of security and privacy in terms of conditional Renyi entropy; (ii) provides a common framework for formulating and analyzing problems of secure and private function computation with prominent roles for classical Shannon theory as well as zero-error combinatorial information theory; and introduces the concept of a multiuser privacy region for quantifying privacy tradeoffs among users; and (iii) develops a new method for obtaining converse bounds for communication complexity, upon analyzing the common randomness or shared information generated in function computation with an interactive communication protocol. Rooted in information theory, estimation theory and theoretical computer science, a central objective of the research is to elucidate tradeoffs among computation accuracy, terminal security and user privacy; key to these tradeoffs is the essential role of interactive communication. Furthermore, it aims at creating advances in information theory through the introduction of new models and concepts. Expected outcomes are precise characterizations of the mentioned fundamental tradeoffs, and associated algorithms for secure and private computing.

这项研究采用信息论方法来开发通过托管用户数据的多个终端来管理安全或私有函数计算的原理。终端的目标是使用交互式通信协议在本地可靠地计算所有可能相关的用户数据的给定函数。该协议需要满足单独的安全和隐私条件。前者规定每个终端，其余终端的联盟不应从它们自己的数据和通信中收集到比从函数值中获得的更多的关于终端上的数据的信息。后者保护终端上每个单独用户的数据免受类似联盟的影响。开发了一个通用框架来分析安全和隐私的不同概念，并提出了新的信息论公式和方法，旨在理解基本原理。潜在的应用领域包括：存储临床药物试验结果的医院数据库或包含学生表现记录的大学数据库；从存储在私有云中的用户数据中检索私有信息；参与众包交通和导航服务的社区和个人的身份/位置的安全和隐私认证。研究人员的技术方法涉及发展具有三个主要显着特征的理论。 (i) 确立了交互式通信在降低通信复杂性以及增强安全性和隐私性方面的关键作用；并根据条件 Renyi 熵制定可计算的安全和隐私措施； (ii) 为制定和分析安全和私有函数计算问题提供了一个通用框架，对经典香农理论和零误差组合信息论具有突出作用；并引入多用户隐私区域的概念，用于量化用户之间的隐私权衡； (iii)通过分析交互式通信协议的函数计算中生成的共同随机性或共享信息，开发了一种获得通信复杂性的逆界的新方法。该研究植根于信息论、估计理论和理论计算机科学，其中心目标是阐明计算精度、终端安全和用户隐私之间的权衡；这些权衡的关键是互动沟通的重要作用。此外，它的目标是通过引入新的模型和概念来推动信息论的进步。预期结果是上述基本权衡的精确表征，以及安全和私有计算的相关算法。