Presentation 2001/3/16
Safety and Performance Evaluation for Log Order Comparison Sealed-bid Auctions with Symmetrical Servers
Koji Chida, Kunio Kobayashi, Hikaru Morita,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A new scheme for comparing information without leaking it is presented. By using the scheme, you can locate successful bids in electronic sealed-bid auctions efficiently. The computational complexity of the opening phase can be reduced to O (log l), previous works required O (N・l) or O (N・ log l) where the number of bidders is N and the range of bids is l. Furthermore, a practical implementation based on hash functions without any modular exponentiation is described.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Sealed-bid Auction / Information Comparing / Decision Diffie-Hellman Problem
Paper # IT2000-106,ISEC2000-160,SST2000-190,ITS2000-115
Date of Issue

Conference Information
Committee ISEC
Conference Date 2001/3/16(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) Safety and Performance Evaluation for Log Order Comparison Sealed-bid Auctions with Symmetrical Servers
Sub Title (in English)
Keyword(1) Sealed-bid Auction
Keyword(2) Information Comparing
Keyword(3) Decision Diffie-Hellman Problem
1st Author's Name Koji Chida
1st Author's Affiliation NTT Information Sharing Platform Laboratories()
2nd Author's Name Kunio Kobayashi
2nd Author's Affiliation NTT Information Sharing Platform Laboratories
3rd Author's Name Hikaru Morita
3rd Author's Affiliation NTT Information Sharing Platform Laboratories
Date 2001/3/16
Paper # IT2000-106,ISEC2000-160,SST2000-190,ITS2000-115
Volume (vol) vol.100
Number (no) 692
Page pp.pp.-
#Pages 7
Date of Issue