Presentation 1994/7/11
Language Dependent Secure Bit Commitments
Toshiya Itoh, Yuji Ohta, Hiroki Shizuya,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper,we define two classes of languages,one induces opaque, transparent bit commitments and the other induces transparent/opaque bit commitments.As an application of the opaque/ transparent and the transparent/opaque properties,we first show that if a language L indnces an opaque/transparent bit commitment, then there exists a prover-practical perfect zero-knowledge proof for L,and we then show that if a language L induces a transparent/ opaque bit commitment,then there exists a bounded round perfect zero-knowledge proof for L.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Bit Commitments / Zero-Knowledge Proofs / Language Membership / Proofs of Knowledge
Paper # ISEC94-9
Date of Issue

Conference Information
Committee ISEC
Conference Date 1994/7/11(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) Language Dependent Secure Bit Commitments
Sub Title (in English)
Keyword(1) Bit Commitments
Keyword(2) Zero-Knowledge Proofs
Keyword(3) Language Membership
Keyword(4) Proofs of Knowledge
1st Author's Name Toshiya Itoh
1st Author's Affiliation Tokyo Institute of Technology()
2nd Author's Name Yuji Ohta
2nd Author's Affiliation Tokyo Institute of Technology
3rd Author's Name Hiroki Shizuya
3rd Author's Affiliation Tohoku University
Date 1994/7/11
Paper # ISEC94-9
Volume (vol) vol.94
Number (no) 137
Page pp.pp.-
#Pages 12
Date of Issue