A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation
From MaRDI portal
Publication:3524129
Recommendations
- Information Security
- Practically efficient secure single-commodity multi-market auctions
- Financial Cryptography and Data Security
- scientific article; zbMATH DE number 773971
- A secure \(M + 1^{\text{st}}\) price auction protocol based on bit slice circuits
- Practical electronic auction scheme with strong anonymity and bidding privacy
Cited in
(16)- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Practically efficient secure single-commodity multi-market auctions
- Privacy-preserving subgraph matching protocol for two parties
- Faster secure multi-party computation of AES and DES using lookup tables
- Kicking-the-bucket: fast privacy-preserving trading using buckets
- FAST: fair auctions via secret transactions
- On server trust in private proxy auctions
- \( \mathsf{Rabbit} \): efficient comparison for secure multi-party computation
- Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces
- Cryptographic protocols for auctions and bargaining
- Private liquidity matching using MPC
- Secure sealed-bid online auctions using discreet cryptographic proofs
- From Farfalle to \textsc{Megafono} via Ciminion: the PRF \textsc{Hydra} for MPC applications
- scientific article; zbMATH DE number 1700056 (Why is no real title available?)
- Secure multiparty computation goes live
- Secure combinatorial auctions by dynamic programming with polynomial secret sharing
This page was built for publication: A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524129)
