The Design and Implementation of a Secure Auction Service
IEEE Transactions on Software Engineering
Efficient private bidding and auctions with an oblivious third party
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Privacy preserving auctions and mechanism design
Proceedings of the 1st ACM conference on Electronic commerce
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
Robust, Privacy Protecting and Publicly Verifiable Sealed-Bid Auction
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Efficient Sealed-Bid Auction Using Hash Chain
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
ESORICS '02 Proceedings of the 7th European Symposium on Research in Computer Security
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in 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
A Verifiable Secret Shuffle of Homomorphic Encryptions
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: 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
Batch verification of validity of bids in homomorphic e-auction
Computer Communications
Distributed provers with applications to undeniable signatures
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
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
A two-server, sealed-bid auction protocol
FC'02 Proceedings of the 6th international conference on Financial cryptography
Secure Vickrey auctions without threshold trust
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
Optimization of electronic first-bid sealed-bid auction based on homomorphic secret sharing
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
A multiplicative homomorphic sealed-bid auction based on goldwasser-micali encryption
ISC'05 Proceedings of the 8th international conference on Information Security
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
Correction, Optimisation and Secure and Efficient Application of PBD Shuffling
Information Security and Cryptology
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
A general, flexible and efficient proof of inclusion and exclusion
INTRUST'11 Proceedings of the Third international conference on Trusted Systems
Hi-index | 0.00 |
Bid opening in sealed-bid e-auction is efficient when a homomorphic encryption algorithm is employed to seal the bids and homomorphic bid opening is employed to open the bids. Such e-auction schemes are called homomorphic auctions. However, high efficiency of homomorphic auctions 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, in most existing homomorphic auction schemes, proof and verification of validity of the bids is either ignored or too inefficient. Recently, a technique called batched bid validity check [25] is proposed to improve efficiency of proof and verification of bid validity in a special kind of homomorphic auction schemes: secretsharing-based homomorphic auctions. However, secret-sharing-based homomorphic auction schemes [13, 15, 26, 24] are not a main stream in homomorphic auction schemes as they employ threshold secret sharing techniques to seal the bids. Main stream homomorphic auction schemes employ a homomorphic encryption algorithm with threshold distributed decryption to seal the bids as it is simpler and more efficient than secret sharing. In this paper, an ElGamal-encryption-based homomorphic encryption scheme is proposed. It employs a batched proof and verification of bid validity to achieve high efficiency in bid validity check. Its batch proof and verification technique is more advanced than that in [25], so it is simpler and more efficient than the homomorphic auction scheme in [25].