Batch verification of validity of bids in homomorphic e-auction

Authors:
Kun Peng;Colin Boyd;Ed Dawson
Affiliations:
Level 7, 126 Margaret St, Brisbane QLD4000, Information Security Institute, Queensland University of Technology, Australia;Level 7, 126 Margaret St, Brisbane QLD4000, Information Security Institute, Queensland University of Technology, Australia;Level 7, 126 Margaret St, Brisbane QLD4000, Information Security Institute, Queensland University of Technology, Australia
Venue:
Computer Communications
Year:
2006

Citing 9
Cited 7

Secret sharing homomorphisms: keeping shares of a secret secret

Proceedings on Advances in cryptology---CRYPTO '86
Privacy preserving auctions and mechanism design

Proceedings of the 1st ACM conference on Electronic commerce
Efficient oblivious transfer protocols

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Robust, Privacy Protecting and Publicly Verifiable Sealed-Bid Auction

ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

CRYPTO '91 Proceedings of the 11th 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 1-Out-n Oblivious Transfer Schemes

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
Distributed provers with applications to undeniable signatures

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques

Efficient Vote Validity Check in Homomorphic Electronic Voting

Information Security and Cryptology --- ICISC 2008
Batch ZK Proof and Verification of OR Logic

Information Security and Cryptology
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
Efficiency improvement of homomorphic e-auction

TrustBus'10 Proceedings of the 7th international conference on Trust, privacy and security in digital business
A general, flexible and efficient proof of inclusion and exclusion

CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Using homomorphic encryption to secure the combinatorial spectrum auction without the trustworthy auctioneer

Wireless Networks
A general, flexible and efficient proof of inclusion and exclusion

INTRUST'11 Proceedings of the Third international conference on Trusted Systems

Quantified Score

Hi-index	0.24

Visualization

Abstract

Bid opening in e-auction is efficient when a homomorphic secret sharing function is employed to seal the bids and homomorphic secret reconstruction is employed to open the bids. However, this high efficiency is based on an assumption: the bids are valid (e.g., within a special range). An undetected invalid bid can compromise correctness and fairness of the auction. Unfortunately, validity verification of the bids is ignored in the auction schemes employing homomorphic secret sharing (called homomorphic auction in this paper). In this paper, an attack against the homomorphic auction in the absence of bid validity check is presented and a necessary bid validity check mechanism is proposed. Then a batch cryptographic technique is introduced and applied to improve the efficiency of bid validity check.