Efficient anonymous secure auction schema (ASAS) without fully trustworthy auctioneer

Abstract

Purpose

In traditional commerce, an auction is known as a mechanism of determining the value of a commodity that does not have a fixed price. Auctions are exciting and an increasing number of transactions are performed through e‐auctions. But most current auctions cannot address all the important security requirements. Usually, auction systems force bidders and sellers to trust the auctioneer and, on the other hand, do not provide anonymity for bidders and sellers. This paper aims to solve these problems by presenting an efficient anonymous secure auction schema (ASAS) without a fully trustworthy auctioneer.

Design/methodology/approach

The paper analyzes security properties and the complexity of previous works in auction security and then proposes a new ASAS that is more secure and efficient than previous works. Finally, security properties and the complexity of the new schema and previous works are compared with one another.

Findings

The proposed auction protocol does not force bidders and sellers to trust the auctioneer. In addition, it provides anonymity for both of them. Owing to these newly added features and high degree of security of ASAS, it is suggested that its use in high‐value auctions should require tighter security.

Originality/value

The paper proposes a new schema for electronic auctions that is secure and efficient and, in addition, does not force bidders and sellers to trust the auctioneer.

Citation

Asgharzadeh Sekhavat, Y. and Fathian, M. (2008), "Efficient anonymous secure auction schema (ASAS) without fully trustworthy auctioneer", Information Management & Computer Security, Vol. 16 No. 3, pp. 288-304. https://doi.org/10.1108/09685220810893225