Presentation	2006-05-19 General Composition of a Bounded Concurrent Black-Box Zero-Knowledge Protocol Hirofumi MURATANI,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	We consider the round-complexity of an m-bounded concurrent black-box zero-knowledge interactive proof protocol. In the previous study, we provided an upper bound ω(log m) on the round-complexity in the case of m-bounded concurrent self-composition, which was proved by using the Prabhakaran-Rosen-Sahai protocol. In this study, we show that the same upper bound exists also in the case of m-bounded concurrent general composition if the provers and the simulator satisfy some respective reasonable conditions.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	concurrent black-box zero-knowledge / bounded concurrency / round complexity / general composition
Paper #	ISEC2006-7
Date of Issue

Conference Information
Committee	ISEC
Conference Date	2006/5/12(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Information Security (ISEC)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	General Composition of a Bounded Concurrent Black-Box Zero-Knowledge Protocol
Sub Title (in English)
Keyword(1)	concurrent black-box zero-knowledge
Keyword(2)	bounded concurrency
Keyword(3)	round complexity
Keyword(4)	general composition
1st Author's Name	Hirofumi MURATANI
1st Author's Affiliation	Corporate Research & Development Center, Toshiba Corporation()
Date	2006-05-19
Paper #	ISEC2006-7
Volume (vol)	vol.106
Number (no)	51
Page	pp.pp.-
#Pages	8
Date of Issue