CRII: CIF: Secret Sharing Under Communication Constraints in Wireless Networks

CRII：CIF：无线网络通信约束下的秘密共享

基本信息

批准号：
1850227
负责人：
Remi Chou
金额：
$ 15.63万
依托单位：
Wichita State University
依托单位国家：
美国
项目类别：
Standard Grant
财政年份：
2019
资助国家：
美国
起止时间：
2019-07-01 至 2022-06-30
项目状态：
已结题

来源：
https://www.nsf.gov/awardsearch/showAward?AWD_ID=1850227&HistoricalAwards=false
关键词：
CRII CIF Secret Sharing Under

项目摘要

As wireless networks become ubiquitous, the ability to maintain trust and securely exchange confidential information among interconnected wireless devices and users is crucial. Secret sharing is a cryptographic primitive that can help to achieve secure communication with applications that include access control, key management, digital signatures, and others. Although this primitive is widely used, it is still not fully understood how wireless communication constraints such as noise, limited bandwidth, and scalability can be optimally accounted for in the design of secret sharing schemes. This project aims for new guidelines for the implementation of secret sharing directly adapted to wireless communication constraints, to improve security for users, minimize the communication cost associated with the implementation, and facilitate deployment in dense wireless networks through improved scalability.Most existing secret sharing schemes hinge on the assumption that the dealer can securely communicate the shares of the secret to the participants over noiseless channels with unlimited bandwidth. Under such an assumption, the implementation of secret sharing schemes in wireless networks requires additional layers of protocols able to deal with unsecured, noisy, and bandwidth limited communication channels between the dealer and the participants. The objective of this project is to understand whether such a layered approach is optimal and whether a scheme that simultaneously addresses the constraints of wireless communication and the requirements of secret sharing could provide gains in terms of communication efficiency and security guarantees. The project investigates two interdependent research tasks: (i) understanding the fundamental security limits for secret sharing in wireless networks under bandwidth constraints and noise, and (ii) the design of explicit low-complexity coding schemes using tools from cryptography and coding theory.This award is jointly funded by the Division of Computing and Communication Foundations in the Directorate for Computer & Information Science & Engineering and the Established Program to Stimulate Competitive Research in the Office of Integrative Activities.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.

随着无线网络变得无处不在，在互连的无线设备和用户之间维持信任并安全地交换机密信息的能力至关重要。秘密共享是一种加密原语，有助于实现与应用程序的安全通信，包括访问控制、密钥管理、数字签名等。尽管该原语被广泛使用，但仍然没有完全理解如何在秘密共享方案的设计中最佳地考虑无线通信约束（例如噪声、有限带宽和可扩展性）。该项目旨在为直接适应无线通信约束的秘密共享的实施提供新的指导方针，以提高用户的安全性，最大限度地减少与实施相关的通信成本，并通过提高可扩展性促进在密集无线网络中的部署。大多数现有的秘密共享方案取决于这样的假设：经销商可以通过具有无限带宽的无噪声通道将秘密份额安全地传达给参与者。在这样的假设下，无线网络中秘密共享方案的实现需要额外的协议层，以处理经销商和参与者之间不安全、有噪声和带宽有限的通信通道。该项目的目的是了解这种分层方法是否是最佳的，以及同时解决无线通信约束和秘密共享要求的方案是否可以在通信效率和安全保证方面提供收益。该项目研究了两项相互依赖的研究任务：（i）了解带宽约束和噪声下无线网络秘密共享的基本安全限制，以及（ii）使用密码学和编码理论的工具设计显式的低复杂性编码方案。该奖项由计算机与信息科学与工程理事会计算和通信基金会部门以及综合活动办公室刺激竞争研究既定计划共同资助。该奖项反映了 NSF 的法定使命，并被认为是值得的通过使用基金会的智力优势和更广泛的影响审查标准进行评估来获得支持。