Paper 2024/1657
Securely Computing One-Sided Matching Markets
Abstract
Top trading cycles (TTC) is a famous algorithm for trading indivisible goods between a set of agents such that all agents are as happy as possible about the outcome. In this paper, we present a protocol for executing TTC in a privacy preserving way. To the best of our knowledge, it is the first of its kind. As a technical contribution of independent interest, we suggest a new algorithm for determining all nodes in a functional graph that are on a cycle. The algorithm is particularly well suited for secure implementation in that it requires no branching and no random memory access. Finally, we report on a prototype implementation of the protocol based on somewhat homomorphic encryption.
Note: Full version of FC'25 publication.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- secure multiparty computationfully homomorphic encryptiontop trading cycles
- Contact author(s)
-
jachiang @ cs au dk
ivan @ cs au dk
orlandi @ cs au dk
mahak pancholi @ imdea org
mark @ univariate org - History
- 2025-06-27: revised
- 2024-10-14: received
- See all versions
- Short URL
- https://ia.cr/2024/1657
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1657,
author = {James Hsin-Yu Chiang and Ivan Damgård and Claudio Orlandi and Mahak Pancholi and Mark Simkin},
title = {Securely Computing One-Sided Matching Markets},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1657},
year = {2024},
url = {https://eprint.iacr.org/2024/1657}
}
