A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation

DOI10.1007/11889663_10zbMath1152.94405OpenAlexW1573476887MaRDI QIDQ3524129

Jakob Illeborg Pagter, Kurt Nielsen, Tomas Toft, Peter Bogetoft, Thomas Pelle Jakobsen, Ivan B. Damgård

Publication date: 9 September 2008

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

Full work available at URL: https://doi.org/10.1007/11889663_10

Mathematics Subject Classification ID

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

Related Items (9)

Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces ⋮ \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation ⋮ Private liquidity matching using MPC ⋮ On server trust in private proxy auctions ⋮ Kicking-the-bucket: fast privacy-preserving trading using buckets ⋮ From Farfalle to \textsc{Megafono} via Ciminion: the PRF \textsc{Hydra} for MPC applications ⋮ Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries ⋮ Privacy-Preserving Subgraph Matching Protocol for Two Parties ⋮ FAST: fair auctions via secret transactions

This page was built for publication: A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation