Presentation	2005-07-22 An efficiently-verifiable zero-knowledge argument for proofs of knowledge Go YAMAMOTO, Eiichiro FUJISAKI, Masayuki ABE,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	We present zero-knowledge interactive arguments for proofs of knowledge in which the communications traffic and the amount of computation and storage for the verifier are much smaller than the size of prover's knowledge. In black-box simulation zero-knowledge proofs, it is strongly unlikely that there is an interactive protocol such that the communications traffic is smaller than the size of prover's knowledge. To realize such a protocol, we introduce a few non-standard computational assumptions, which are factoring versions of non-standard assumptions that appeared in [2], [4], [8]. Our zero-knowledge simulator and knowledge extractor for the proposed protocols are both constructed in a way of "non-black-box simulation".
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)
Paper #	ISEC2005-48
Date of Issue

Conference Information
Committee	ISEC
Conference Date	2005/7/15(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)	An efficiently-verifiable zero-knowledge argument for proofs of knowledge
Sub Title (in English)
Keyword(1)
1st Author's Name	Go YAMAMOTO
1st Author's Affiliation	NTT Corporation()
2nd Author's Name	Eiichiro FUJISAKI
2nd Author's Affiliation	NTT Corporation
3rd Author's Name	Masayuki ABE
3rd Author's Affiliation	NTT Corporation
Date	2005-07-22
Paper #	ISEC2005-48
Volume (vol)	vol.105
Number (no)	194
Page	pp.pp.-
#Pages	5
Date of Issue