Adding timestamps to the secure electronic auction protocol
Data & Knowledge Engineering
Internet based auctions: a survey on models and applications
ACM SIGecom Exchanges
A secure e-auction scheme based on group signatures
Information Systems Frontiers
Information flow in interactive systems
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
New sealed-bid electronic auction with fairness, security and efficiency
Journal of Computer Science and Technology
The design of a secure and fair sealed-bid auction service
Mathematical and Computer Modelling: An International Journal
Formal verification of e-auction protocols
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
Quantitative information flow in interactive systems
Journal of Computer Security - ARSPA-WITS'10
| Hi-index | 0.00 |
Auctions are an important and common form of commerce today. A difficult aspect of auctions is that the bidder must be present at the site of the auction. This reduces the appeal of auction and restricts the number of people who would otherwise participate in it. An auction over an electronic network is, therefore, an attractive way of conducting business.In this paper, the author proposes a protocol for electronic auctions. This protocol ensures:(a) anonymity of the customer, (b) security from passive attacks, active attacks, message corruption, and loss of messages, (c) customer's privacy, and (d) atomicity (i.e., under all circumstances, the transaction is either completed or aborted) . A logic is developed based on the semantics of BAN-style logic. Using this logic, the properties of anonymity, security, privacy, and atomicity are proved for the proposed protocol