Practically efficient secure single-commodity multi-market auctions
From MaRDI portal
Publication:5857771
Recommendations
- Financial Cryptography and Data Security
- Information Security and Cryptology - ICISC 2003
- A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation
- Secure combinatorial auctions by dynamic programming with polynomial secret sharing
- Information Security and Cryptology - ICISC 2003
Cites work
- scientific article; zbMATH DE number 1305416 (Why is no real title available?)
- Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions
- Efficient, oblivious data structures for MPC
- How to share a secret
- Improved primitives for secure multiparty integer computation
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
- Practically efficient multi-party sorting protocols from comparison sort algorithms
- Progress in Cryptology – Mycrypt 2005
- Randomized shellsort: a simple data-oblivious sorting algorithm
- Secret-Sharing Schemes: A Survey
- Secure equality and greater-than tests with sublinear online complexity
- Secure multiparty computation goes live
- Securely solving classical network flow problems
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- Theory of Cryptography
- Zig-zag sort
Cited in
(2)
This page was built for publication: Practically efficient secure single-commodity multi-market auctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5857771)
