Combinatorial auctions have recently attracted the interest of many researchers due to their promising applications such as the spectrum auctions recently held by the FCC. In a combinatorial auction, multiple items with interdependent values are sold simultaneously and bidders are allowed to bid on any combination of items. The Generalized Vickrey Auction protocol (GVA) can handle combinatorial auctions and has several good theoretical characteristics. However, the GVA has not yet widely used in practice due to its vulnerability to fraud by the auctioneers. In this paper, to prevent such fraud, we propose a secure generalized Vickrey auction scheme where the result of GVA can be computed while the actual evaluation values of each bidder are kept secret. key words : generalized Vickrey auction, combinatorial auction, homomorphic encryption, mechanism design, game-theory.