PYI: Mathematical Foundations of Cryptography
PYI: Mathematical Foundations of Cryptography
批准号:
8657527
负责人:
Shafrira Goldwasser
金额:
$31.2万
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
1987
资助国家:
美国
项目状态:
已结题
起止时间:
1987-08-15 至 1993-01-31
中文摘要
PYI:密码学研究的新基础在计算复杂性的一般领域正在进行中。本研究的重点是密码学和计算数论。在80年代的十年中,密码学发展成为一门正式的学科,其中的“单向函数”和“证明协议是正确的”等概念具有精确而自然的含义。严谨性是通过具体的提案来实现的,这些提案在几个复杂性假设下被证明符合新的复杂性标准。不幸的是,所做的复杂性假设,例如单向函数的存在,很可能在相当长的一段时间内仍未得到证实。这种情况为建立新的密码学基础提供了动力。不是对功能做出难以处理的假设,而是对正在进行加密的模型(例如,网络参与者用于通信的通道或布局的类型)进行物理假设。寻求用于新模型的无条件安全的通信协议。已经取得的结果涉及具有“分布式”证明者的证明系统,可能会应用于容错分布式计算。这样的应用正在探索中。互动证明系统的工作仍在继续。利用在这一领域开发的工具,正在试图澄清以前未分类的优化问题的复杂性。计算数论方面的工作也在继续。人们寻求更简单、更快的算法来进行素性测试和其他代数计算。这位私家侦探被总统青年调查小组评为杰出的计算机科学家。
英文摘要
PYI: New Foundations for Cryptography Research is in progress in the general area of computational complexity. The focus of this research is on cryptography and computational number theory. During the decade of the eighties cryptography was developed into a formal discipline in which notions such as "one-way function" and "proving that a protocol is correct" have a precise yet natural meaning. Rigor was accomplished by concrete proposals which were shown to comply with the new complexity standards under a few complexity assumptions. Unfortunately, the complexity assumptions made, for example the existence of one-way functions, are likely to remain unproven for quite a while longer. This situation provides motivation for establishing a new foundation for cryptography. Instead of making intractability assumptions about functions, physical assumptions about the model in which cryptography is being done (for example the kind of channel or layout used for communication by the network participants) are being made. Unconditionally secure communication protocols for the new model are sought. Results already achieved that involve proof- systems with a "distributed" prover may have applications to fault tolerant distributed computing. Such applications are being explored. Work is continuing on interactive proof systems. Using tools developed in this area an attempt is being made to clarify the complexity of previously unclassified optimization problems. Work in computational number theory is also continuing. Simpler and faster algorithms for primality testing and other algebraic computations are sought. The P.I. has been judged to be an outstanding computer scientist by the Presidential Young Investigator Panel.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Workshops on Geometry of Polynomials
-
批准号:1835986
-
项目类别:Standard Grant
-
资助金额:$6.0万
-
财政年份:2018
-
负责人:Shafrira Goldwasser
-
依托单位:
EAGER: Holistic Security for Cloud Computing: Computing on Encrypted Data
-
批准号:1347364
-
项目类别:Standard Grant
-
资助金额:$30.0万
-
财政年份:2013
-
负责人:Shafrira Goldwasser
-
依托单位:
TC: Small: Securing Programs and Data In Remote and Hostile Environments
-
批准号:1018064
-
项目类别:Standard Grant
-
资助金额:$49.92万
-
财政年份:2010
-
负责人:Shafrira Goldwasser
-
依托单位:
Workshop: Cryptography in the Clouds
-
批准号:0948699
-
项目类别:Standard Grant
-
资助金额:$3.01万
-
财政年份:2009
-
负责人:Shafrira Goldwasser
-
依托单位:
New Handles on Program Correctness
-
批准号:0729011
-
项目类别:Standard Grant
-
资助金额:$30.0万
-
财政年份:2007
-
负责人:Shafrira Goldwasser
-
依托单位:
Program Obfuscation: Foundations and Applications
-
批准号:0635297
-
项目类别:Standard Grant
-
资助金额:$0.0万
-
财政年份:2006
-
负责人:Shafrira Goldwasser
-
依托单位:
Learning Fourier Coefficients: Theory and Application
-
批准号:0514167
-
项目类别:Standard Grant
-
资助金额:$20.0万
-
财政年份:2005
-
负责人:Shafrira Goldwasser
-
依托单位:
Cryptographic Foundations of Cyber Trust
-
批准号:0430450
-
项目类别:Standard Grant
-
资助金额:$45.0万
-
财政年份:2004
-
负责人:Shafrira Goldwasser
-
依托单位:
FAW: Algorithmic Complexity in Cryptography, Distributed Computation and Interactive Proofs
-
批准号:9023313
-
项目类别:Continuing Grant
-
资助金额:$25.0万
-
财政年份:1991
-
负责人:Shafrira Goldwasser
-
依托单位:
Computational Complexity Based Cryptography (Computer Research)
-
批准号:8509905
-
项目类别:Standard Grant
-
资助金额:$10.34万
-
财政年份:1985
-
负责人:Shafrira Goldwasser
-
依托单位:
海外基金