{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:53:44Z","timestamp":1754157224515,"version":"3.41.2"},"reference-count":16,"publisher":"Emerald","issue":"2","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001,5,1]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1108\/10662240110388215","type":"journal-article","created":{"date-parts":[[2005,2,8]],"date-time":"2005-02-08T08:21:53Z","timestamp":1107850913000},"page":"159-166","source":"Crossref","is-referenced-by-count":5,"title":["A trustworthy Internet auction model with verifiable fairness"],"prefix":"10.1108","volume":"11","author":[{"given":"Gen\u2010Yih","family":"Liao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing\u2010Jang","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"doi-asserted-by":"crossref","unstructured":"Baker, C.R. (1999), \u201cAn analysis of fraud on the Internet\u201d, Internet Research: Electronic Networking Applications and Policy, Vol. 9 No. 5, pp. 348\u201059.","key":"key2022020620525349200_B1","DOI":"10.1108\/10662249910297750"},{"unstructured":"CyberSource Corp. (1999), CyberSource Fraud Research, www.cybersource.com\/fraud_survey","key":"key2022020620525349200_B2"},{"doi-asserted-by":"crossref","unstructured":"Dobbertin, H., Bosselaers, A. and Preneel, B. (1996), \u201cRIPEMD\u2010160: a strengthened version of RIPEMD\u201d, in Gollmann, D. (Ed.), Proceedings of the 3rd International Workshop on Fast Software Encryption, Springer\u2010Verlag, Cambridge, pp. 71\u201082.","key":"key2022020620525349200_B3","DOI":"10.1007\/3-540-60865-6_44"},{"doi-asserted-by":"crossref","unstructured":"ElGamal, T. (1985), \u201cA public key cryptosystem and a signature scheme based on discrete logarithms\u201d, IEEE Transactions on Information Theory, Vol. 31, July,  pp. 469\u2010472.","key":"key2022020620525349200_B4","DOI":"10.1109\/TIT.1985.1057074"},{"unstructured":"Franklin, M.K. and Reiter, M.K. (1995), \u201cThe design and implementation of a secure auction service\u201d, in Meadows, C. and McHugh, J. (Eds), Proceedings of IEEE Symposium on Security and Privacy, IEEE Computer Society Press, Oakland, CA, pp. 2\u201014.","key":"key2022020620525349200_B5"},{"doi-asserted-by":"crossref","unstructured":"Franklin, M.K. and Reiter, M.K. (1996), \u201cThe design and implementation of a secure auction service\u201d, IEEE Transactions on Software Engineering, Vol. 22, May, pp. 302\u201012.","key":"key2022020620525349200_B6","DOI":"10.1109\/32.502223"},{"doi-asserted-by":"crossref","unstructured":"Furnell, S.M. and Karweni, T. (1999), \u201cSecurity implications of electronic commerce: a survey of consumers and businesses\u201d, Internet Research: Electronic Networking Applications and Policy, Vol. 9 No. 5, pp. 372\u201082.","key":"key2022020620525349200_B7","DOI":"10.1108\/10662249910297778"},{"unstructured":"Kikuchi, H., Hakavy, M. and Tygar, D. (1999), \u201cMulti\u2010round anonymous auction protocols\u2019\u2019, IEICE Transactions on Information & System, Vol. E82\u2010D, April, pp. 769\u201077.","key":"key2022020620525349200_B8"},{"unstructured":"Kudo, M. (1998), \u201cSecure electronic sealed\u2010bid auction protocol with public key cryptography\u201d, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E81\u2010A, January, pp. 20\u201027.","key":"key2022020620525349200_B9"},{"doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B. and Sumner, R. (1999), \u201cPrivacy preserving auctions and mechanism design\u201d, in Proceedings of the 1st ACM Conference on Electronic Commerce, ACM Press, Denver, CO, pp. 129\u201039.","key":"key2022020620525349200_B10","DOI":"10.1145\/336992.337028"},{"unstructured":"National Association of Consumer Agency Administrators and Consumer Federation of America (1999), 8th Annual NACAA\/CFA Consumer Complaint Survey Report, www.nacaanet.org\/survey99.htm","key":"key2022020620525349200_B11"},{"unstructured":"National Institute of Standards and Technology (1995), Secure Hash Standard, NIST FIPS PUB 180\u20101, US National Institute of Standards and Technology, Gaithersburg, MD.","key":"key2022020620525349200_B12"},{"doi-asserted-by":"crossref","unstructured":"Nurmi, H. (1994), \u201cCryptographic protocols for auctions and bargaining\u201d, in Karhumaki, J., Maurer, H. and Rozenberg, G. (Eds), Proceedings of Results and Trends in Theoretical Computer Science, Springer\u2010Verlag, Berlin, pp. 317\u201024.","key":"key2022020620525349200_B13","DOI":"10.1007\/3-540-58131-6_56"},{"doi-asserted-by":"crossref","unstructured":"Rivest, R.L., Shamir A. and Adleman, L.M. (1978), \u201cA method for obtaining digital signatures and public key cryptosystems\u201d, Communications of the ACM, Vol. 21, February, pp. 120\u201026.","key":"key2022020620525349200_B14","DOI":"10.1145\/359340.359342"},{"doi-asserted-by":"crossref","unstructured":"Sako, K. (2000), \u201cAn auction protocol which hides bids of losers\u201d, in Imai, H. and Zheng, Y. (Eds), Proceedings of the 3rd International Workshop on Practice and Theory in Public Key Cryptosystems, Springer\u2010Verlag, Melbourne, pp. 422\u201032.","key":"key2022020620525349200_B15","DOI":"10.1007\/978-3-540-46588-1_28"},{"doi-asserted-by":"crossref","unstructured":"Shamir, A. (1979), \u201cHow to share a secret\u201d, Communications of the ACM, Vol. 22, November, pp. 612\u201013.","key":"key2022020620525349200_B16","DOI":"10.1145\/359168.359176"}],"container-title":["Internet Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/10662240110388215","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/10662240110388215\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/10662240110388215\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:39:43Z","timestamp":1753400383000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/intr\/article\/11\/2\/159-166\/187746"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5,1]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,5,1]]}},"alternative-id":["10.1108\/10662240110388215"],"URL":"https:\/\/doi.org\/10.1108\/10662240110388215","relation":{},"ISSN":["1066-2243"],"issn-type":[{"type":"print","value":"1066-2243"}],"subject":[],"published":{"date-parts":[[2001,5,1]]}}}