Practically efficient secure single-commodity multi-market auctions
From MaRDI portal
Publication:5857771
DOI10.1007/978-3-662-54970-4_7zbMATH Open1466.91126OpenAlexW2594022442MaRDI QIDQ5857771FDOQ5857771
Authors: Abdelrahaman Aly, Mathieu Van Vyve 
Publication date: 7 April 2021
Published in: Financial Cryptography and Data Security (Search for Journal in Brave)
Full work available at URL: https://www.cosic.esat.kuleuven.be/publications/article-2863.pdf
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
- How to share a secret
- Secret-Sharing Schemes: A Survey
- Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions
- Secure multiparty computation goes live
- Randomized shellsort: a simple data-oblivious sorting algorithm
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- Progress in Cryptology – Mycrypt 2005
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
- Improved primitives for secure multiparty integer computation
- Theory of Cryptography
- Efficient, oblivious data structures for MPC
- Zig-zag sort
- Secure equality and greater-than tests with sublinear online complexity
- Practically efficient multi-party sorting protocols from comparison sort algorithms
- Title not available (Why is that?)
- Securely solving classical network flow problems
Cited In (2)
Uses Software
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)
