AF: Medium: Collaborative Research: Exploiting Opportunities in Pseudorandomness

AF：媒介：协作研究：利用伪随机性中的机会

• 批准号: 1763311
• 负责人: Omer Reingold
• 金额: $ 65万
• 依托单位: Stanford University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2018
• 资助国家: 美国
• 起止时间: 2018-03-01 至 2023-02-28
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1763311&HistoricalAwards=false
• 关键词: AF; Medium; Collaborative; Research; Exploiting

This project seeks to exploit new opportunities to advance the theory of pseudo-randomness, which is the theory of generating objects that "look random" despite being constructed using little or no randomness. The computational theory of pseudo-randomness originated in the foundations of cryptography in the early 1980s and has since developed into a rich sub-field of theoretical computer science in its own right. The notions and constructs studied in the theory of pseudo-randomness have implications for many different areas of research in computer science, communications, and mathematics, including cryptography, computational complexity, coding theory, additive number theory, metric embeddings, streaming and sketching algorithms, and graph theory. The project puts high value on education, service to the research community, and wide dissemination of knowledge. The research activities will be accompanied by and integrated with curriculum development, research advising, service, and outreach. In addition, the research also relates to national priorities of importance to society, such as security and privacy.Specifically, the project seeks to exploit new opportunities for progress on several fundamental questions, including: 1) The RL vs. L problem: trying to prove, unconditionally, that every randomized algorithm can be made deterministic with only a constant-factor loss in space efficiency; 2) Explicit constructions: seeking explicit load-balancing hash functions, batch codes, and depth-robust graphs that achieve substantial parameter improvements and have qualitative significance for applications, and 3) Applications: improving and extending the applications of pseudo-randomness to cryptography and data structures.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.

该项目旨在利用新的机会来推进伪随机性理论，这是一种生成“看起来随机”的对象的理论，尽管它们是使用很少或根本没有随机性来构建的。 伪随机性的计算理论起源于20世纪80年代初的密码学基础，此后发展成为理论计算机科学的一个丰富的子领域。伪随机性理论中研究的概念和结构对计算机科学、通信和数学的许多不同研究领域都有影响，包括密码学、计算复杂性、编码理论、加法数论、度量嵌入、流和草图算法以及图论。 该项目高度重视教育、为研究界服务和广泛传播知识。 研究活动将伴随着并与课程开发，研究咨询，服务和推广相结合。 此外，该研究还涉及到安全和隐私等对社会具有重要意义的国家优先事项。具体而言，该项目寻求在几个基本问题上取得进展的新机会，包括：1）RL vs. L问题：试图无条件地证明每个随机算法都可以确定，只有空间效率的常数因子损失; 2）显式构造：寻求显式负载平衡散列函数、批处理代码和深度鲁棒图，其实现实质性参数改进并且对应用具有定性意义，以及3）应用：改进和扩大伪该奖项反映了NSF的法定使命，并通过使用基金会的智力价值和更广泛的影响审查标准。

项目成果

Fairness Through Computationally-Bounded Awareness

通过计算限制的意识实现公平

• 发表时间: 2018
• 期刊: Neural Information Processing Systems (Nurips
• 作者: Kim, Michael P.;Reingold, Omer;Rothblum, Guy N.
• 通讯作者: Rothblum, Guy N.

Pseudorandom Generators for Read-Once Monotone Branching Programs

用于只读单调分支程序的伪随机生成器

• DOI: 10.4230/lipics.approx/random.2021.58
• 发表时间: 2021
• 期刊: Leibniz international proceedings in informatics
• 作者: Doron, Dean;Meka, Raghu;Reingold, Omer;Tal, Avishay;Vadhan, Salil
• 通讯作者: Vadhan, Salil

Learning from Outcomes: Evidence-Based Rankings. FOCS 2019: 106-125

从结果中学习：基于证据的排名。

• 发表时间: 2019
• 期刊: Annual Symposium on Foundations of Computer Science
• 作者: Dwork, Cynthia;Kim, Michael P.;Reingold, Omer;Rothblum, Guy N.;Yona, Gal
• 通讯作者: Yona, Gal

Outcome indistinguishability

• DOI: 10.1145/3406325.3451064
• 发表时间: 2020-11
• 期刊: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
• 作者: C. Dwork;Michael P. Kim;Omer Reingold;G. Rothblum;G. Yona

AC0[p] Lower Bounds against MCSP via the Coin Problem

AC0[p] 通过硬币问题针对 MCSP 的下界

• 发表时间: 2019
• 期刊: ICALP
• 作者: Golovnev, Alexander;Ilango, Rahul;Impagliazzo, Russell;Kabanets, Valentine;Kolokolova, Antonina;Tal, Avishay
• 通讯作者: Tal, Avishay