A trustworthy Internet auction model with verifiable fairness
- 1 May 2001
- journal article
- Published by Emerald in Internet Research
- Vol. 11 (2), 159-166
- https://doi.org/10.1108/10662240110388215
Abstract
Describes a novel Internet auction model achieving verifiable fairness, a requirement aimed at enhancing the trust of bidders in auctioneers. Distrust in remote auctioneers prevents bidders from participating in Internet auctioning. According to proposed survey reports, this study presents four characteristics that render the Internet untrustworthy for bidders. These intrinsic properties suggest that auction sites not only follow auction policies, but provide customers with evidence validating that the policies are applied fairly. Evidence of verifiable fairness provides bidders with a basis for confidence in Internet auctions. Cryptographic techniques are also applied herein to establish a novel auction model with evidence to manifest and verify every step of the auctioneer. Analysis results demonstrate that the proposed model satisfies various requirements regarding fairness and privacy. Moreover, in the proposed model, the losing bids remain sealed.Keywords
This publication has 13 references indexed in Scilit:
- An Auction Protocol Which Hides Bids of LosersLecture Notes in Computer Science, 2000
- Security implications of electronic commerce: a survey of consumers and businessesInternet Research, 1999
- An analysis of fraud on the InternetInternet Research, 1999
- The design and implementation of a secure auction serviceIEEE Transactions on Software Engineering, 1996
- RIPEMD-160: A strengthened version of RIPEMDLecture Notes in Computer Science, 1996
- Cryptographic protocols for auctions and bargainingPublished by Springer Science and Business Media LLC ,1994
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- A subexponential-time algorithm for computing discrete logarithms overGF(p^2)IEEE Transactions on Information Theory, 1985
- How to share a secretCommunications of the ACM, 1979
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978