Presentation	2000/1/26 Universal Sampling Oracles and 3-Round Zero-Knowledge Protocols Takeshi Koshiba,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	In this paper, we propose a notion of universal sampling oracles and define an intermediate notion of zero knowledge between black-box simulation zero-knowledge and auxiliary-input zero-knowledge in terms of universal sampling oracles. We construct a 3-round zero-knowledge in a sense of the new zero-knowledge assuming some computational conditions. Goldreich and Krawczyk proved that a 4-round black-box simulation zero-knowledge protocol exists 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 / graph isomorphism
Paper #	ISEC99-102
Date of Issue

Conference Information
Committee	ISEC
Conference Date	2000/1/26(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	ENG
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Universal Sampling Oracles and 3-Round Zero-Knowledge Protocols
Sub Title (in English)
Keyword(1)	zero-knowledge
Keyword(2)	interactive proof
Keyword(3)	graph isomorphism
1st Author's Name	Takeshi Koshiba
1st Author's Affiliation	Telecommunications Advancement Organization of Japan()
Date	2000/1/26
Paper #	ISEC99-102
Volume (vol)	vol.99
Number (no)	585
Page	pp.pp.-
#Pages	7
Date of Issue