Five sealed-bid auction models

Authors:
Kun Peng;Colin Boyd;Ed Dawson;Kapali Viswanathan
Affiliations:
Information Security Research Centre, Faculty of Information Technology, Queensland University of Technology, 2, George Street, Brisbane, QLD4001, Australia;Information Security Research Centre, Faculty of Information Technology, Queensland University of Technology, 2, George Street, Brisbane, QLD4001, Australia;Information Security Research Centre, Faculty of Information Technology, Queensland University of Technology, 2, George Street, Brisbane, QLD4001, Australia;Information Security Research Centre, Faculty of Information Technology, Queensland University of Technology, 2, George Street, Brisbane, QLD4001, Australia
Venue:
ACSW Frontiers '03 Proceedings of the Australasian information security workshop conference on ACSW frontiers 2003 - Volume 21
Year:
2003

Citing 15
Cited 2

The Design and Implementation of a Secure Auction Service

IEEE Transactions on Software Engineering
Reducing the round complexity of a sealed-bid auction protocol with an off-line TTP

Proceedings of the 7th ACM conference on Computer and communications security
Untraceable electronic mail, return addresses, and digital pseudonyms

Communications of the ACM
A Three Phased Schema for Sealed Bid Auction System Design

ACISP '00 Proceedings of the 5th Australasian Conference on Information Security and Privacy
An Internet Anonymous Auction Scheme

ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
Efficient Sealed-Bid Auction Using Hash Chain

ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
Wallet Databases with Observers

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Efficient Sealed-Bid Auctions for Massive Numbers of Bidders with Lump Comparison

ISC '01 Proceedings of the 4th International Conference on Information Security
An Auction Protocol Which Hides Bids of Losers

PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
M+1-st Price Auction Using Homomorphic Encryption

PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Distributed Auction Servers Resolving Winner and Winning Bid without Revealing Privacy of Bids

ICPADS '00 Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
A second-price sealed-bid auction with verifiable discriminant of ρo-th root

FC'02 Proceedings of the 6th international conference on Financial cryptography
Non-interactive auction scheme with strong privacy

ICISC'02 Proceedings of the 5th international conference on Information security and cryptology

Defining security services for electronic tendering

ACSW Frontiers '04 Proceedings of the second workshop on Australasian information security, Data Mining and Web Intelligence, and Software Internationalisation - Volume 32
Unconditionally secure first-price auction protocols using a multicomponent commitment scheme

ICICS'10 Proceedings of the 12th international conference on Information and communications security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Published sealed-bid auction schemes are classified into four models according to how they deal with bid privacy. The properties of each model are introduced and possible improvements in these models are suggested. A new model is proposed and its implementation is discussed. Application of different models is discussed, based on a comparison of the models.