Zero Knowledge Proofs and Their Complexity
Zero Knowledge Proofs and Their Complexity
批准号:
9207024
负责人:
Rene Peralta
金额:
$9.87万
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
1992
资助国家:
美国
项目状态:
已结题
起止时间:
1992-09-15 至 1995-07-31
中文摘要
9207024佩拉尔塔这个项目研究交互证明的复杂性,涉及计算数论和组合学的大量工作。这一补充将升级项目中使用的工作站,消除限制探索新研究想法的内存限制。***
英文摘要
9207024 Peralta This project studies complexity of interactive proofs and involves substantial work in computational number theory and combinatorics. This supplement will upgrade the workstation used in the project, removing memory limitations that limit exploration of new research ideas. ***
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
NSF-CGP-Fellowship: Concrete Complexity of Number-TheoreticProblems of Importance to Cryptography
-
批准号:9729662
-
项目类别:Standard Grant
-
资助金额:$2.9万
-
财政年份:1998
-
负责人:Rene Peralta
-
依托单位:
SGER: Concrete Complexity of Number-Theoretic Problems of Importance to Cryptography
-
批准号:9712109
-
项目类别:Standard Grant
-
资助金额:$4.98万
-
财政年份:1997
-
负责人:Rene Peralta
-
依托单位:
Computational Number Theory
-
批准号:8909657
-
项目类别:Standard Grant
-
资助金额:$3.35万
-
财政年份:1989
-
负责人:Rene Peralta
-
依托单位:
海外基金