Presentation 2001/3/15
Gradually releasable commitment schemes and their applications
Taiichi SAITO, Shigenori UCHIYAMA, Hikaru MORITA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Gradually releasable commitment scheme allows a party to transfer, bit by bit, bis committed secret to his counterpart. It can be applicable to many cryptographic protocols. This paper proposes two types of gradually releasable commitment schemes: one is computationaily secure and information-theoretically unalmbiguous, and the other is information-theoretically secure and computationally unam-biguous, which are based on one-way permutation and claw-free permutation pair, respectively. Moreover we describe their applications to cryptographic protocols.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) commitment scheme / one-way permutation / hardcore bit / claw-free permutation pair
Paper # ISEC2000-105
Date of Issue

Conference Information
Committee ISEC
Conference Date 2001/3/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) Gradually releasable commitment schemes and their applications
Sub Title (in English)
Keyword(1) commitment scheme
Keyword(2) one-way permutation
Keyword(3) hardcore bit
Keyword(4) claw-free permutation pair
1st Author's Name Taiichi SAITO
1st Author's Affiliation NTT Laboratories()
2nd Author's Name Shigenori UCHIYAMA
2nd Author's Affiliation NTT Laboratories
3rd Author's Name Hikaru MORITA
3rd Author's Affiliation NTT Laboratories
Date 2001/3/15
Paper # ISEC2000-105
Volume (vol) vol.100
Number (no) 691
Page pp.pp.-
#Pages 4
Date of Issue