Presentation	1999/11/9 Do there exist 3-Round Zero-Knowledge Interactive Protocols? Takeshi Koshiba,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	We propose a new definition of zero knowledge interactive proofs by using a notion of universal sampling oracles. That gives an intermediate notion between black-box simulation zero-knowledge and auxiliary-input zero-knowledge. We construct a 3-round zero-knowledge in a sense of the new zero-knowledge assuming some computational conditions. Goldreich and Krawczyk proves that there exists a 3-round black-box simulation zero-knowledge protocol only for BPP languages. However, there is no contradiction here. We also discuss the applicability of Goldreich and Krawczyk's technique to newly defined 3-round zero-knowledge protocols.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	zero knowledge / interactive proof / fundamentals of cryptography / graph isomorphism
Paper #	ISEC99-69
Date of Issue

Conference Information
Committee	ISEC
Conference Date	1999/11/9(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)	Do there exist 3-Round Zero-Knowledge Interactive Protocols?
Sub Title (in English)
Keyword(1)	zero knowledge
Keyword(2)	interactive proof
Keyword(3)	fundamentals of cryptography
Keyword(4)	graph isomorphism
1st Author's Name	Takeshi Koshiba
1st Author's Affiliation	Telecommunications Advancement Organization of Japan()
Date	1999/11/9
Paper #	ISEC99-69
Volume (vol)	vol.99
Number (no)	415
Page	pp.pp.-
#Pages	7
Date of Issue