On server trust in private proxy auctions

DOI10.1007/s10660-010-9057-xzbMath1207.68084OpenAlexW1968597468MaRDI QIDQ608995

Javier Herranz, Giovanni Di Crescenzo, Germán Sáez

Publication date: 30 November 2010

Published in: Electronic Commerce Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10660-010-9057-x

zbMATH Keywords

trustcryptographyauctionsprivacy

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Auctions, bargaining, bidding and selling, and other market models (91B26) Internet topics (68M11)

Cites Work

• Probabilistic encryption
• The knowledge complexity of quadratic residuosity languages
• A Two-Server, Sealed-Bid Auction Protocol
• Secure Vickrey Auctions without Threshold Trust
• On Monotone Formula Composition of Perfect Zero-Knowledge Languages
• A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation
• Efficient Protocols for Set Membership and Range Proofs
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• The Knowledge Complexity of Interactive Proof Systems
• Noninteractive Zero-Knowledge
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Foundations of Cryptography
• Mathematical Foundations of Computer Science 2004
• Efficient Non-interactive Range Proof
• Information Security and Cryptology
• Public Key Cryptography - PKC 2006
• Advances in Cryptology - ASIACRYPT 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On server trust in private proxy auctions