The Internet is a prime vehicle for supporting electronic auction, a primitive pricing mechanism for setting price. But up to now, the study of efficient and secure M+1^st price auction is still very weak. Aiming at this drawback, this paper presented a new solution for M+1^st price auction in the case of protecting bidders. Employing the method of binary search, this scheme resolves the winners and the winning price synchronously and rapidly. If necessary, all auctioneers can collaborate with each other to open the winners? bidding prices without leaking any privacy of losers. Comparison in terms of communication cost between our proposed scheme and others was given at the end of the paper. The result shows that our solution will consume less bandwidth in communication.