On server trust in private proxy auctions
| Autor: | Germán Sáez, Giovanni Di Crescenzo, Javier Herranz |
|---|---|
| Přispěvatelé: | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV, Universitat Politècnica de Catalunya. MAK - Matemàtica Aplicada a la Criptografia |
| Rok vydání: | 2010 |
| Předmět: |
Scheme (programming language)
Correctness Computer science business.industry Economics Econometrics and Finance (miscellaneous) Criptografia Cryptography Auctions -- Computer network resources Proxy auctions Probes de coneixement zero Encryption Computer security computer.software_genre Seguretat de les comunicacions Random oracle Human-Computer Interaction Subhastes electròniques Common value auction Proxy (statistics) business Informàtica::Seguretat informàtica::Criptografia [Àrees temàtiques de la UPC] computer Implementation Confiança en servidor computer.programming_language |
| Zdroj: | UPCommons. Portal del coneixement obert de la UPC Universitat Politècnica de Catalunya (UPC) Recercat. Dipósit de la Recerca de Catalunya instname |
| ISSN: | 1572-9362 1389-5753 |
| DOI: | 10.1007/s10660-010-9057-x |
| Popis: | We investigate proxy auctions, an auction model which is proving very successful for on-line businesses (e.g.http://www.ebay.com), where a trusted server manages bids from clients by continuously updating the current price of the item and the currently winning bid as well as keeping private the winning client’s maximum bid. We propose techniques for reducing the trust in the server by defining and achieving a security property, called server integrity. Informally, this property protects clients from a novel and large class of attacks from a corrupted server by allowing them to verify the correctness of updates to the current price and the currently winning bid. Our new auction scheme achieves server integrity and satisfies two important properties that are not enjoyed by previous work in the literature: it has minimal interaction, and only requires a single trusted server. The main ingredients of our scheme are two minimal-round implementations of zero-knowledge proofs for proving lower bounds on encrypted values: one based on discrete logarithms that is more efficient but uses the random oracle assumption, and another based on quadratic residuosity that only uses standard intractability assumptions but is less efficient. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|