Secure combinatorial auctions by dynamic programming with polynomial secret sharing

DOI10.1007/3-540-36504-4_4MaRDI QIDQ2995361zbMATHOpenAlexFDO

Authors Koutarou Suzuki, Makoto Yokoo

Publication date 20 April 2011

Published in Financial Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-36504-4_4

zbMATH Keywords

dynamic programmingcombinatorial auctionsecret sharingspectrum auction

Mathematics Subject Classification ID

Dynamic programming (90C39) Auctions, bargaining, bidding and selling, and other market models (91B26) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Cryptographic combinatorial clock-proxy auctions
• Secure generalized Vickrey auction using homomorphic encryption
• A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation
• scientific article; zbMATH DE number 773971
• Financial Cryptography and Data Security

Cited in

(6)

• Practically efficient secure single-commodity multi-market auctions
• Secure distributed constraint satisfaction: reaching agreement without revealing private information
• Quantum sealed-bid auction protocol based on quantum secret sharing
• How to obtain full privacy in auctions
• Secure generalized Vickrey auction using homomorphic encryption
• Cryptographic combinatorial clock-proxy auctions

This page was built for publication: Secure combinatorial auctions by dynamic programming with polynomial secret sharing

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