concurrently non-malleable black-box zero knowledge in the bare     public-key model

ISCAS OpenIR > 信息安全国家重点实验室

	concurrently non-malleable black-box zero knowledge in the bare public-key model
	Deng Yi; Di Crescenzo Giovanni; Lin Dongdai; Feng Dengguo
	2009
会议名称	4th International Computer Science Symposium
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
会议日期	AUG 18-23,
会议地点	Novosibirsk, RUSSIA
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	COMPUTER SCIENCE - THEORY AND APPLICATIONS
ISSN	0302-9743
ISBN	978-3-642-03350-6
部门归属	Deng, Yi; Lin, Dongdai; Feng, Dengguo Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100190, Peoples R China.
摘要	In this paper we study the possibility of reducing the setup assumptions under which concurrent non-malleable zero knowledge protocol can be realized. A natural model choice is the bare public-key (BPK) model of 6, a model with very minimal setup assumptions. Our main contribution is to show in this model the following about constant-round concurrent non-malleable black-box zero-knowledge arguments. - They can be constructed from any one-way function for any language in NP. Here, our construction takes 5 rounds, and we can reduce it to a round (round-optimal) argument under existence of one-way permutations. - Under number-theoretic assumptions, they admit a time-efficient instantiation for some specific NP languages (e.g., all languages having efficient Sigma protocols, for which we can implement our construction using only O(1) modular exponentiations). Compared to the non-black-box construct ion in a concurrent work of OPV, ICALP 2008 in this model, our protocol (even the construction from one-way function) is significantly more time- and round-efficient and can be based on more general assumptions.
关键词	Linguistics Query Languages
主办者	Russian Fdn Bas Res, Yandex
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/8334
专题	信息安全国家重点实验室
推荐引用方式 GB/T 7714	Deng Yi,Di Crescenzo Giovanni,Lin Dongdai,et al. concurrently non-malleable black-box zero knowledge in the bare public-key model[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:COMPUTER SCIENCE - THEORY AND APPLICATIONS,2009.