Efficient private bidding and auctions with an oblivious third party
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
An Online Public Auction Protocol Protecting Bidder Privacy
ACISP '00 Proceedings of the 5th Australasian Conference on Information Security and Privacy
Efficient Sealed-Bid Auction Using Hash Chain
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Efficient Public Auction with One-Time Registration and Public Verifiability
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
English vs. Sealed Bid in Anonymous Electronic Auction Protocols
WETICE '01 Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Enhanced Anonymous Auction Protocols with Freewheeling Bids
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 01
Bidder-anonymous English auction scheme with privacy and public verifiability
Journal of Systems and Software
Information Sciences: an International Journal
A secure reverse Vickrey auction scheme with bid privacy
Information Sciences: an International Journal
Standards and verification for fair-exchange and atomicity in e-commerce transactions
Information Sciences: an International Journal
New directions in cryptography
IEEE Transactions on Information Theory
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
The design of a secure and fair sealed-bid auction service
Mathematical and Computer Modelling: An International Journal
Constant-round adaptive zero-knowledge proofs for NP
Information Sciences: an International Journal
Hi-index | 0.07 |
In 2003, Chang and Chang proposed an efficient and anonymous auction protocol with freewheeling bids. They claimed that their scheme could ensure the bidders' anonymity and secure confidentiality. Later, Jiang et al. pointed out that their scheme could not withstand the man-in-the-middle attacks; during this time, Jiang et al. proposed an improved scheme based on the scheme by Chang and Chang. In 2006, Chang and Chang proposed an anonymous auction scheme that was much more efficient than the abovementioned schemes. However, all of these three schemes were unable to achieve strong anonymity, bidding privacy, and secret bidding prices for sealed-bids. This article proposes a new scheme to resolve the above problems in which two managers and zero knowledge proof are used. The proposed scheme can be widely applied in any sensitive auction (e.g., auctions of cosmetics, medical services, etc.). Moreover, the proposed scheme also satisfies the following requirements: (1) bidding privacy, (2) strong anonymity, (3) secret bidding prices, (4) unforgeability, (5) verifiability, (6) non-repudiation, (7) traceability, (8) one-time registration and (9) easy revocation.