Protocol completion incentive problems in cryptographic Vickrey auctions
From MaRDI portal
Publication:934962
DOI10.1007/S10660-008-9013-1zbMATH Open1144.91317OpenAlexW2070050027MaRDI QIDQ934962FDOQ934962
Authors: Phillip G. Bradford, Sunju Park, Michael H. Rothkopf, Heejin Park
Publication date: 31 July 2008
Published in: Electronic Commerce Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10660-008-9013-1
Recommendations
Cites Work
- Title not available (Why is that?)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Title not available (Why is that?)
- Zero-knowledge proofs of identity
- The Knowledge Complexity of Interactive Proof Systems
- Title not available (Why is that?)
- Rational Secret Sharing, Revisited
- Rational secret sharing and multiparty computation
- Distributed computing meets game theory
- Rationality and Adversarial Behavior in Multi-party Computation
- Robust combinatorial auction protocol against false-name bids
- Protocol completion incentive problems in cryptographic Vickrey auctions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Electronic jury voting protocols
- Title not available (Why is that?)
- Financial Cryptography and Data Security
- Fully private auctions in a constant number of rounds
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Protocol completion incentive problems in cryptographic Vickrey auctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q934962)