Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions

ISCAS OpenIR

	Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
	Uriel Feige; Dror Lapidot; Adi Shamir
	2000
发表期刊	SIAM Journal on Computing
卷号	29 期号:1 页码:1-28
摘要	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.
收录类别	其他
合作性质	其它
语种	英语
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/1297
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Uriel Feige,Dror Lapidot,Adi Shamir. Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions[J]. SIAM Journal on Computing,2000,29(1):1-28.
APA	Uriel Feige,Dror Lapidot,&Adi Shamir.(2000).Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions.SIAM Journal on Computing,29(1),1-28.
MLA	Uriel Feige,et al."Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions".SIAM Journal on Computing 29.1(2000):1-28.