Presentation 1999/11/9
Efficient Sealed-bid Auction by Sequentially Revealable Commitment
Koutarou SUZUKI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Conventionally, the sealed-bid auction schemes using the encrypted bid with the public key cryptosystem or using the commitment of the bid by the undeniable signature have been proposed. In this paper we present a new sealed-bid auction scheme using the sequentially revealable commitment by the chain of one-way functions. By using a practical one-way hash function like as SHA-1, we can achieve a drastic improvement of the efficiency comparing with the conventional methods.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) sealed-bid auction / one-way function / bit-commitment
Paper # ISEC99-67
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) Efficient Sealed-bid Auction by Sequentially Revealable Commitment
Sub Title (in English)
Keyword(1) sealed-bid auction
Keyword(2) one-way function
Keyword(3) bit-commitment
1st Author's Name Koutarou SUZUKI
1st Author's Affiliation NTT Information Sharing Platform Laboratories()
Date 1999/11/9
Paper # ISEC99-67
Volume (vol) vol.99
Number (no) 415
Page pp.pp.-
#Pages 5
Date of Issue