Non-interactive auction scheme with strong privacy

Authors:
Kun Peng;Colin Boyd;Ed Dawson;Kapali Viswanathan
Affiliations:
Information Security Research Centre, Faculty of Information Technology, Queensland University of Technology, Brisbane, QLD, Australia;Information Security Research Centre, Faculty of Information Technology, Queensland University of Technology, Brisbane, QLD, Australia;Information Security Research Centre, Faculty of Information Technology, Queensland University of Technology, Brisbane, QLD, Australia;Information Security Research Centre, Faculty of Information Technology, Queensland University of Technology, Brisbane, QLD, Australia
Venue:
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Year:
2002

Citing 10
Cited 6

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
A Three Phased Schema for Sealed Bid Auction System Design

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
Wallet Databases with Observers

CRYPTO '92 Proceedings of the 12th 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

Five sealed-bid auction models

ACSW Frontiers '03 Proceedings of the Australasian information security workshop conference on ACSW frontiers 2003 - Volume 21
On the Existence of Unconditionally Privacy-Preserving Auction Protocols

ACM Transactions on Information and System Security (TISSEC)
Efficient bid validity check in ElGamal-based sealed-bid e-auction

ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
Practicalization of a range test and its application to e-auction

EuroPKI'09 Proceedings of the 6th European conference on Public key infrastructures, services and applications
Secure E-auction for mobile users with low-capability devices in wireless network

WISTP'11 Proceedings of the 5th IFIP WG 11.2 international conference on Information security theory and practice: security and privacy of mobile devices in wireless communication
A multiplicative homomorphic sealed-bid auction based on goldwasser-micali encryption

ISC'05 Proceedings of the 8th international conference on Information Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Key chain, as an effective tool to achieve strong bid privacy non-interactively, was employed by Watanabe and Imai in an auction scheme. But in their scheme bid privacy cannot be achieved unconditionally and losing bidders must trust bidders with higher bids for privacy of their bids. Moreover, their scheme is not efficient. In this paper the key chain in the shceme by Watanabe and Imai is optimised to achieve unconditional bid privacy. In the new scheme, every losing bidder can control privacy of their own bids while no trust is needed. Computational cost of this scheme is optimised by avoiding the costly verifiable encryption technique in their scheme.