Secure Combinatorial Auctions by Dynamic Programming with Polynomial Secret Sharing
From MaRDI portal
Publication:2995361
DOI10.1007/3-540-36504-4_4zbMath1275.94035OpenAlexW122693320MaRDI QIDQ2995361
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
Cryptography (94A60) Dynamic programming (90C39) Auctions, bargaining, bidding and selling, and other market models (91B26) Authentication, digital signatures and secret sharing (94A62)
Related Items (3)
Secure distributed constraint satisfaction: reaching agreement without revealing private information ⋮ How to obtain full privacy in auctions ⋮ Quantum sealed-bid auction protocol based on quantum secret sharing
This page was built for publication: Secure Combinatorial Auctions by Dynamic Programming with Polynomial Secret Sharing