On server trust in private proxy auctions

DOI10.1007/S10660-010-9057-XMaRDI QIDQ608995zbMATHOpenAlexFDO

Authors Giovanni Di Crescenzo, Javier Herranz, 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)

Recommendations

• A Two-Server, Sealed-Bid Auction Protocol
• Secure Vickrey auctions without threshold trust
• How to obtain full privacy in auctions
• scientific article; zbMATH DE number 1440072
• Cryptographic combinatorial clock-proxy auctions

Cites work

• scientific article; zbMATH DE number 1676657 (Why is no real title available?)
• scientific article; zbMATH DE number 2085425 (Why is no real title available?)
• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 1186869 (Why is no real title available?)
• scientific article; zbMATH DE number 177618 (Why is no real title available?)
• scientific article; zbMATH DE number 1759348 (Why is no real title available?)
• scientific article; zbMATH DE number 1775406 (Why is no real title available?)
• scientific article; zbMATH DE number 2088333 (Why is no real title available?)
• scientific article; zbMATH DE number 2102685 (Why is no real title available?)
• scientific article; zbMATH DE number 1406779 (Why is no real title available?)
• scientific article; zbMATH DE number 1440072 (Why is no real title available?)
• A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation
• A Two-Server, Sealed-Bid Auction Protocol
• Advances in Cryptology - ASIACRYPT 2003
• Efficient Non-interactive Range Proof
• Efficient Protocols for Set Membership and Range Proofs
• Efficient proofs that a committed number lies in an interval
• Foundations of Cryptography
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Information Security and Cryptology
• Mathematical Foundations of Computer Science 2004
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• Noninteractive Zero-Knowledge
• On Monotone Formula Composition of Perfect Zero-Knowledge Languages
• Probabilistic encryption
• Public Key Cryptography - PKC 2006
• Secure Vickrey auctions without threshold trust
• The Knowledge Complexity of Interactive Proof Systems
• The knowledge complexity of quadratic residuosity languages

Cited in

(5)

• Strictly-black-box zero-knowledge and efficient validation of financial transactions
• Auctions with untrustworthy bidders
• Secure Vickrey auctions without threshold trust
• scientific article; zbMATH DE number 2102685 (Why is no real title available?)
• scientific article; zbMATH DE number 2088328 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q608995)