Cryptographic combinatorial clock-proxy auctions

DOI10.1007/978-3-642-03549-4_19MaRDI QIDQ3655176zbMATH OpenOpenAlexFDO

Authors David C. Parkes, Michael O. Rabin, Christopher Thorpe

Publication date 7 January 2010

Published in Financial Cryptography and Data Security (Search for Journal in Brave)

Full work available at URL http://nrs.harvard.edu/urn-3:HUL.InstRepos:4000813

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Cryptography (94A60)

Recommendations

• Fully private auctions in a constant number of rounds
• scientific article; zbMATH DE number 773971
• Secure combinatorial auctions by dynamic programming with polynomial secret sharing
• How to obtain full privacy in auctions
• scientific article; zbMATH DE number 1440072

Cited in

(5)

• Secure combinatorial auctions by dynamic programming with polynomial secret sharing
• Cryptographic combinatorial securities exchanges
• Financial Cryptography
• Secure generalized Vickrey auction using homomorphic encryption
• On server trust in private proxy auctions

This page was built for publication: Cryptographic combinatorial clock-proxy auctions

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