Multiple noninteractive zero knowledge proofs under general assumptions

被引：191
|
作者：
Feige, U [1 ]
Lapidot, D [1 ]
Shamir, A [1 ]
机构：
[1] Weizmann Inst Sci, Dept Appl Math & Comp Sci, IL-76100 Rehovot, Israel
来源：
SIAM JOURNAL ON COMPUTING | 1999年 / 29卷 / 01期
关键词：
Hamiltonian cycle; witness indistinguishability;
D O I：
10.1137/S0097539792230010
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper we show how to construct noninteractive zero knowledge proofs for any NP statement under general (rather than number theoretic) assumptions, and how to enable polynomially many provers to give polynomially many such proofs based on a single random string. Our constructions can be used in cryptographic applications in which the prover is restricted to polynomial time.
引用
收藏
页码：1 / 28
页数：28
相关论文
共 50 条
12345