This paper presents a secure dynamic programming protocol that utilizes homomorphic encryption. By using this method, multiple agents can solve a combinatorial optimization problem among them without leaking their private information. More specifically, in this method, multiple servers cooperatively perform dynamic programming procedures for solving a combinatorial optimization problem by using the private information sent from agents as inputs. Although the severs can compute the optimal solution correctly, the inputs are kept secret even from the servers. Such a secure protocol is important when a fully trusted agent is not available, e.g., an auctioneer cannot be fully trusted in a combinatorial auction. By utilizing the proposed protocol, multiple auction servers can solve the winner determination problem, while the information of bids that are not part of the optimal solution is kept secret even from the auction servers. We discuss the application of this protocol to various types of combinatorial auctions, i.e., multi-unit auctions, linear-good auctions, and general combinatorial auctions.
|Number of pages||8|
|Publication status||Published - Jan 1 2002|
|Event||Proceedings of the 1st International Joint Conference on: Autonomous Agents adn Multiagent Systems - Bologna, Italy|
Duration: Jul 15 2002 → Jul 19 2002
|Other||Proceedings of the 1st International Joint Conference on: Autonomous Agents adn Multiagent Systems|
|Period||7/15/02 → 7/19/02|
All Science Journal Classification (ASJC) codes