Title
M+1-st Price Auction Using Homomorphic Encryption
Abstract
This paper provides a M + 1-st price auction scheme using homomorphic encryption and the mix and match technique; it offers secrecy of bidding price and public verifiability. Our scheme has low round communication complexity: 1 round from each bidder to auctioneer in bidding and log p rounds from auctioneer to trusted authority in opening when prices are selected from p prefixed choices.
Year
DOI
Venue
2002
10.1007/3-540-45664-3_8
Public Key Cryptography
Keywords
Field
DocType
homomorphic encryption,low round communication complexity,public verifiability,bidding price,1-st price auction,p round,p prefixed choice,1-st price auction scheme,communication complexity
English auction,Homomorphic encryption,Vickrey auction,Mathematical economics,Computer science,Computer security,Cryptography,Encryption,Communication complexity,Theoretical computer science,Bidding,Revenue equivalence
Conference
Volume
Issue
ISSN
E86A
1
0916-8508
ISBN
Citations 
PageRank 
3-540-43168-3
59
2.22
References 
Authors
17
2
Name
Order
Citations
PageRank
Masayuki Abe1133568.58
Koutarou Suzuki251829.57