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
An Anonymous Electronic Bidding Protocol Based on a New Convertible Group Signature Scheme
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
(M+1)st-Price Auction Protocol
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
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
Receipt-Free Sealed-Bid Auction
ISC '02 Proceedings of the 5th International Conference on Information Security
Five sealed-bid auction models
ACSW Frontiers '03 Proceedings of the Australasian information security workshop conference on ACSW frontiers 2003 - Volume 21
A secure reverse Vickrey auction scheme with bid privacy
Information Sciences: an International Journal
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
Non-interactive auction scheme with strong privacy
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Efficiency improvement of homomorphic e-auction
TrustBus'10 Proceedings of the 7th international conference on Trust, privacy and security in digital business
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
Batch range proof for practical small ranges
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
| Hi-index | 0.00 |
A second-price sealed-bid auction is that a bidder who offers the highest price gets a good in the second highest price. This style of auction solves the problems of both an English auction and a first-price sealed-bid auction. An electronic first-price sealed-bid auction cannot directly be applied to a second-price sealed-bid auction which keeps the highest bid secret. We propose the verifiable discriminant function of the po-th root. Our auction scheme satisfies public verifiability of auction results, and also does not have a single entity who knows the highest bid value even after an auction. Furthermore the bidding cost of our scheme is lower than that of the previous one.