Power auction protocol without revealing winning bids

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

This paper presents a new protocol for anonymous power auction, a style of auction in which the highest k bidders win with the (k+1)-th price. A set of distributed servers collaborates to decide the (k+1)-th price without revealing any bids including the winner's bids.

Original languageEnglish
Title of host publicationProceedings - 15th International Conference on Information Networking, ICOIN 2001
PublisherIEEE Computer Society
Pages61-64
Number of pages4
ISBN (Electronic)0769509517
DOIs
Publication statusPublished - 1 Jan 2001
Event15th International Conference on Information Networking, ICOIN 2001 - Beppu City, Oita, Japan
Duration: 31 Jan 20012 Feb 2001

Publication series

NameInternational Conference on Information Networking
Volume2001-January
ISSN (Print)1976-7684

Conference

Conference15th International Conference on Information Networking, ICOIN 2001
CountryJapan
CityBeppu City, Oita
Period31/01/012/02/01

Keywords

  • Collaboration
  • Distributed computing
  • Internet
  • Polynomials
  • Pricing
  • Privacy
  • Protocols
  • Uninterruptible power systems
  • Vehicles
  • Web server

Fingerprint Dive into the research topics of 'Power auction protocol without revealing winning bids'. Together they form a unique fingerprint.

  • Cite this

    Kikuchi, H. (2001). Power auction protocol without revealing winning bids. In Proceedings - 15th International Conference on Information Networking, ICOIN 2001 (pp. 61-64). [905329] (International Conference on Information Networking; Vol. 2001-January). IEEE Computer Society. https://doi.org/10.1109/ICOIN.2001.905329