AF: Medium: Collaborative Research: Quantum-Secure Cryptography and Fine-Grained Quantum Query Complexity

AF:中:协作研究:量子安全密码学和细粒度量子查询复杂性

基本信息

  • 批准号:
    1764042
  • 负责人:
  • 金额:
    $ 27.48万
  • 依托单位:
  • 依托单位国家:
    美国
  • 项目类别:
    Continuing Grant
  • 财政年份:
    2018
  • 资助国家:
    美国
  • 起止时间:
    2018-08-01 至 2018-11-30
  • 项目状态:
    已结题

项目摘要

Secure Internet communication faces a real threat in the form of a new breed of computer that harnesses the laws of quantum mechanics. The technical community is currently hard at work attempting to construct such "quantum" computers. While many mysteries about these devices remain, it is certain that a large-scale quantum computer would easily break all current public-key cryptography that underpins the current Internet. In certain attack models, important examples of private-key cryptography would also be rendered insecure. This 3-institution collaborative project studies the basic theoretical issues underlying these urgent threats to the security infrastructure. It seeks to understand the cryptography-breaking power of quantum computers, concentrating on two interweaving themes: quantum security for 1) authenticating, and 2) constructing quantum-secure cryptography from new primitives. The project activities also include course development and mentorship at the graduate and undergraduate level. The project also involves specific outreach activities intended to broaden participation in Computer Science, including establishment and development of "women in computer science" chapters, outreach to local high schools, workshops for high-school STEM teachers, and development of computer science courses for a general audience at the three partner institutions.Authentication-proofs, for example, that an e-mail really did originate from you--is a basic and well-studied cryptographic challenge. In the setting of quantum adversaries, it is not clear how to appropriately formulate this essential notion, let alone produce specific cryptographic tools that achieve it. This project is addressing both of the challenges noted above, focusing on development of strong formulations of authentication and new cryptographic constructions that offer secure authentication. Finding "hidden" algebraic structures--like the fact that two lists of numbers are merely cyclic shifts of each other--is an emblematic theme in the study of the computing power of quantum computers. Certain variants of this problem have resisted decades of concerted effort by the quantum algorithms community, and appear to be quite difficult. This project studies applications of these problems to constructing new private-key cryptographic tools with quantum security guarantees.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)认证的量子安全,以及2)从新的原语构建量子安全密码。 项目活动还包括在研究生和本科生一级编制课程和提供指导。该项目还涉及旨在扩大计算机科学参与的具体外联活动,包括建立和发展“计算机科学中的妇女”分会,向当地高中开展外联活动,为高中STEM教师举办讲习班,以及为三个合作机构的普通观众开发计算机科学课程。一封邮件是否真的来自你--是一个基本的、经过充分研究的密码学挑战。在量子对手的情况下,如何恰当地表述这一基本概念尚不清楚,更不用说生产实现这一点的特定加密工具了。该项目正在解决上述两个挑战,重点是开发强有力的认证公式和提供安全认证的新加密结构。寻找“隐藏的”代数结构--就像两个数字列表只是彼此的循环移位--是量子计算机计算能力研究中的一个标志性主题。这个问题的某些变体已经抵制了量子算法社区数十年的共同努力,并且似乎相当困难。该项目研究这些问题的应用,以构建具有量子安全保障的新私钥加密工具。该奖项反映了NSF的法定使命,通过使用基金会的知识价值和更广泛的影响审查标准进行评估,被认为值得支持。

项目成果

期刊论文数量(0)
专著数量(0)
科研奖励数量(0)
会议论文数量(0)
专利数量(0)

数据更新时间:{{ journalArticles.updateTime }}

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

数据更新时间:{{ journalArticles.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ monograph.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ sciAawards.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ conferencePapers.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ patent.updateTime }}

Fang Song其他文献

Diagnosis of Spinal Muscular Atrophy: A Simple Method for Quantifying the Relative Amount of Survival Motor Neuron Gene 1/2 Using Sanger DNA Sequencing
脊髓性肌萎缩症的诊断:使用桑格 DNA 测序定量运动神经元存活基因 1/2 相对量的简单方法
  • DOI:
    10.4103/0366-6999.247198
  • 发表时间:
    2018-12
  • 期刊:
  • 影响因子:
    6.1
  • 作者:
    Yan‑Yan Cao;Wen‑Hui Zhang;Yu‑Jin Qu;Jin‑Li Bai;Yu‑Wei Jin;Hong Wang;Fang Song
  • 通讯作者:
    Fang Song
Biochar decreased enantioselective uptake of chiral pesticide metalaxyl by lettuce and shifted bacterial community in agricultural soil
生物炭降低了生菜对手性农药甲霜灵的对映选择性吸收,并改变了农业土壤中的细菌群落
  • DOI:
    10.1016/j.jhazmat.2021.126047
  • 发表时间:
    2021
  • 期刊:
  • 影响因子:
    13.6
  • 作者:
    You Xiangwei;Suo Fengyue;Yin Shaojing;Wang Xiao;Zheng Hao;Fang Song;Zhang Chengsheng;Li Fengmin;Li Yiqiang
  • 通讯作者:
    Li Yiqiang
Phosphorus-doping promotes the electrochemical etching of metals to nanoporous electrodes for efficient and durable overall water splitting
磷掺杂促进金属对纳米多孔电极的电化学蚀刻,实现高效、持久的整体水分解
  • DOI:
    10.1016/j.jpowsour.2022.231774
  • 发表时间:
    2022-09
  • 期刊:
  • 影响因子:
    9.2
  • 作者:
    Ruohan Feng;Zhenhua Ye;Qu Jiang;Chuanwei Li;Jianfeng Gu;Fang Song
  • 通讯作者:
    Fang Song
An integrated charge-transfer relaxation oscillator without comparator
不带比较器的集成电荷转移张弛振荡器
Coexistence of Primary Sarcomatoid Carcinoma of the Right Ventricle and Absence of Right Pulmonary Artery
右心室原发肉瘤样癌与右肺动脉缺如并存
  • DOI:
  • 发表时间:
    2015
  • 期刊:
  • 影响因子:
    0
  • 作者:
    Guobing Hu;Fang Song;Xiangming Zhu;Baiyu Yang;Yinhua Liu;Ying Liu
  • 通讯作者:
    Ying Liu

Fang Song的其他文献

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

{{ truncateString('Fang Song', 18)}}的其他基金

Collaborative Research: FET: Small: Minimum Quantum Circuit Size Problems, Variants, and Applications
合作研究:FET:小型:最小量子电路尺寸问题、变体和应用
  • 批准号:
    2224131
  • 财政年份:
    2022
  • 资助金额:
    $ 27.48万
  • 项目类别:
    Standard Grant
FET: CAREER: Algorithms, cryptography and complexity meet quantum reductions
FET:职业:算法、密码学和复杂性满足量子缩减
  • 批准号:
    1942706
  • 财政年份:
    2020
  • 资助金额:
    $ 27.48万
  • 项目类别:
    Continuing Grant
AF: Small: Quantum Computational Pseudorandomness with Applications
AF:小:量子计算伪随机性及其应用
  • 批准号:
    2041841
  • 财政年份:
    2020
  • 资助金额:
    $ 27.48万
  • 项目类别:
    Standard Grant
AF: Medium: Collaborative Research: Quantum-Secure Cryptography and Fine-Grained Quantum Query Complexity
AF:中:协作研究:量子安全密码学和细粒度量子查询复杂性
  • 批准号:
    2042414
  • 财政年份:
    2020
  • 资助金额:
    $ 27.48万
  • 项目类别:
    Continuing Grant
FET: CAREER: Algorithms, cryptography and complexity meet quantum reductions
FET:职业:算法、密码学和复杂性满足量子缩减
  • 批准号:
    2054758
  • 财政年份:
    2020
  • 资助金额:
    $ 27.48万
  • 项目类别:
    Continuing Grant
AF: Small: Quantum Computational Pseudorandomness with Applications
AF:小:量子计算伪随机性及其应用
  • 批准号:
    1921047
  • 财政年份:
    2018
  • 资助金额:
    $ 27.48万
  • 项目类别:
    Standard Grant
AF: Small: Quantum Computational Pseudorandomness with Applications
AF:小:量子计算伪随机性及其应用
  • 批准号:
    1816869
  • 财政年份:
    2018
  • 资助金额:
    $ 27.48万
  • 项目类别:
    Standard Grant
AF: Medium: Collaborative Research: Quantum-Secure Cryptography and Fine-Grained Quantum Query Complexity
AF:中:协作研究:量子安全密码学和细粒度量子查询复杂性
  • 批准号:
    1901624
  • 财政年份:
    2018
  • 资助金额:
    $ 27.48万
  • 项目类别:
    Continuing Grant

相似海外基金

Collaborative Research: AF: Medium: The Communication Cost of Distributed Computation
合作研究:AF:媒介:分布式计算的通信成本
  • 批准号:
    2402836
  • 财政年份:
    2024
  • 资助金额:
    $ 27.48万
  • 项目类别:
    Continuing Grant
Collaborative Research: AF: Medium: Foundations of Oblivious Reconfigurable Networks
合作研究:AF:媒介:遗忘可重构网络的基础
  • 批准号:
    2402851
  • 财政年份:
    2024
  • 资助金额:
    $ 27.48万
  • 项目类别:
    Continuing Grant
Collaborative Research: AF: Medium: Algorithms Meet Machine Learning: Mitigating Uncertainty in Optimization
协作研究:AF:媒介:算法遇见机器学习:减轻优化中的不确定性
  • 批准号:
    2422926
  • 财政年份:
    2024
  • 资助金额:
    $ 27.48万
  • 项目类别:
    Continuing Grant
Collaborative Research: AF: Medium: Fast Combinatorial Algorithms for (Dynamic) Matchings and Shortest Paths
合作研究:AF:中:(动态)匹配和最短路径的快速组合算法
  • 批准号:
    2402283
  • 财政年份:
    2024
  • 资助金额:
    $ 27.48万
  • 项目类别:
    Continuing Grant
Collaborative Research: AF: Medium: Foundations of Oblivious Reconfigurable Networks
合作研究:AF:媒介:遗忘可重构网络的基础
  • 批准号:
    2402852
  • 财政年份:
    2024
  • 资助金额:
    $ 27.48万
  • 项目类别:
    Continuing Grant
Collaborative Research: AF: Medium: Fast Combinatorial Algorithms for (Dynamic) Matchings and Shortest Paths
合作研究:AF:中:(动态)匹配和最短路径的快速组合算法
  • 批准号:
    2402284
  • 财政年份:
    2024
  • 资助金额:
    $ 27.48万
  • 项目类别:
    Continuing Grant
Collaborative Research: AF: Medium: The Communication Cost of Distributed Computation
合作研究:AF:媒介:分布式计算的通信成本
  • 批准号:
    2402837
  • 财政年份:
    2024
  • 资助金额:
    $ 27.48万
  • 项目类别:
    Continuing Grant
Collaborative Research: AF: Medium: The Communication Cost of Distributed Computation
合作研究:AF:媒介:分布式计算的通信成本
  • 批准号:
    2402835
  • 财政年份:
    2024
  • 资助金额:
    $ 27.48万
  • 项目类别:
    Continuing Grant
Collaborative Research: AF: Medium: Adventures in Flatland: Algorithms for Modern Memories
合作研究:AF:媒介:平地历险记:现代记忆算法
  • 批准号:
    2423105
  • 财政年份:
    2024
  • 资助金额:
    $ 27.48万
  • 项目类别:
    Continuing Grant
Collaborative Research: AF: Medium: Sketching for privacy and privacy for sketching
合作研究:AF:中:为隐私而素描和为素描而隐私
  • 批准号:
    2311649
  • 财政年份:
    2023
  • 资助金额:
    $ 27.48万
  • 项目类别:
    Continuing Grant
{{ showInfoDetail.title }}

作者:{{ showInfoDetail.author }}

知道了