Sealed-bid auctions with efficient bids using secure bit-slicing conversion

Toru Nakanishi, Yuji Sugiyama

Research output: Contribution to journalArticlepeer-review


Efficient general secure multiparty computation (MPC) protocols were previously proposed, and the combination with the efficient auction circuits achieves the efficient sealed-bid auctions with the full privacy and correctness. However, the combination requires that each bidder submits ciphertexts of bits representing his bid, and their zero-knowledge proofs. This cost amounts to about 80 multi-exponentiations in usual case that the bid size is 20 bits (i.e. about 1,000,000 bid prices). This paper proposes sealed-bid auction protocols based on the efficient MPC protocols, where a bidder can submit only a single ciphertext. The bidder's cost is a few multi-exponentiations, and thus the proposed protocols are suitable for mobile bidders. A novel technique for the realization is a bit-slicing conversion by multiple servers, where a single ciphertext for a bid is securely converted into ciphertexts of bits representing the bid.

Original languageEnglish
Pages (from-to)2533-2542
Number of pages10
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number10
Publication statusPublished - Oct 2004


  • Additive homomorphic cryptosystems
  • Mix-and-match
  • Multiparty computation (MPC)
  • Sealed-bid auction

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'Sealed-bid auctions with efficient bids using secure bit-slicing conversion'. Together they form a unique fingerprint.

Cite this