Bradford et al., 2008 - Google Patents
Protocol completion incentive problems in cryptographic Vickrey auctionsBradford et al., 2008
View PDF- Document ID
- 16359871696944837801
- Author
- Bradford P
- Park S
- Rothkopf M
- Park H
- Publication year
- Publication venue
- Electronic Commerce Research
External Links
Snippet
Despite attractive theoretical properties, Vickrey auctions are seldom used due to the risk of information revelation and fear of cheating. CVAs (Cryptographic Vickrey Auctions) have been proposed to protect bidders' privacy or to prevent cheating by the bid taker. This paper …
- 206010008190 Cerebrovascular accident 0 abstract description 19
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce, e.g. shopping or e-commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/08—Auctions, matching or brokerage
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Exchange, e.g. stocks, commodities, derivatives or currency exchange
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Das et al. | Spurt: Scalable distributed randomness beacon with transparent setup | |
Brandt | How to obtain full privacy in auctions | |
US6834272B1 (en) | Privacy preserving negotiation and computation | |
Canard et al. | Divisible e-cash systems can be truly anonymous | |
Lee et al. | Receipt-free electronic voting scheme with a tamper-resistant randomizer | |
Parkes et al. | Practical secrecy-preserving, verifiably correct and trustworthy auctions | |
Brandt | Fully private auctions in a constant number of rounds | |
Damgård et al. | Unclonable group identification | |
Rjašková | Electronic voting schemes | |
Heidarvand et al. | Public verifiability from pairings in secret sharing schemes | |
US7240198B1 (en) | Honesty preserving negotiation and computation | |
Chen et al. | Receipt-free electronic auction schemes using homomorphic encryption | |
Camenisch et al. | An identity escrow scheme with appointed verifiers | |
Rabin et al. | Strictly-black-box zero-knowledge and efficient validation of financial transactions | |
Bradford et al. | Protocol completion incentive problems in cryptographic Vickrey auctions | |
Ma et al. | Fully private auctions for the highest bid | |
Goodrich et al. | Privacy-enhanced reputation-feedback methods to reduce feedback extortion in online auctions | |
Wu et al. | New sealed-bid electronic auction with fairness, security and efficiency | |
Choi et al. | Two-party computing with encrypted data | |
Di Crescenzo | Privacy for the stock market | |
Peng | Efficient proof of bid validity with untrusted verifier in homomorphic e‐auction | |
Peng | Efficient VSS free of computational assumption | |
Nojoumian et al. | Unconditionally secure first-price auction protocols using a multicomponent commitment scheme | |
Baghery et al. | Traceable Verifiable Secret Sharing and Applications | |
Wang et al. | Multi-Signature and Game Based Blockchain Interoperability Oracle |