SearcharxivSearch

arXiv subjects

Wu Xin

Publications and source records attributed to Wu Xin.

3 recordsLinked to original sources

Incentivizing Data Trading via Profit Reallocation

Data trading is a central approach to data circulation, yet data markets remain far less active than expected. A primary bottleneck is the lack of effective economic incentives. Existing approaches often treat data as traditional goods, overlooking its inherent replicability and resale potential: buyers can replicate and resell data products, thereby forming transaction chains. Upstream sellers do not benefit from downstream resales and thus have limited incentives to sell. However, the impact of data resale on market performance remains insufficiently understood. To address this gap, we propose a sequential, chain-based data trading model that explicitly captures data resale. The model reflects data flows in settings such as LLM training and strategic decision-making. We integrate this model with a profit reallocation mechanism. By reallocating profits along the transaction chain, this mechanism ensures upstream sellers benefit from downstream resales. We next develop efficient algorithms, including a polynomial-time exact algorithm for the discrete model and an FPTAS for the continuous model, to compute its sequential equilibria. We theoretically show that profit reallocation expands trade and improves social welfare under certain conditions, and empirical results demonstrate that our mechanism increases transaction volume by 120.0\% and social welfare by 50.4\% in synthetic environments, compared with the baseline mechanism that does not reallocate profits.

cs.GT

Communication Efficient Multiparty Private Set Intersection from Multi-Point Sequential OPRF

Multiparty private set intersection (MPSI) allows multiple participants to compute the intersection of their locally owned data sets without revealing them. MPSI protocols can be categorized based on the network topology of nodes, with the star, mesh, and ring topologies being the primary types, respectively. Given that star and mesh topologies dominate current implementations, most existing MPSI protocols are based on these two topologies. However, star-topology MPSI protocols suffer from high leader node load, while mesh topology protocols suffer from high communication complexity and overhead. In this paper, we first propose a multi-point sequential oblivious pseudorandom function (MP-SOPRF) in a multi-party setting. Based on MP-SOPRF, we then develop an MPSI protocol with a ring topology, addressing the challenges of communication and computational overhead in existing protocols. We prove that our MPSI protocol is semi-honest secure under the Hamming correlation robustness assumption. Our experiments demonstrate that our MPSI protocol outperforms state-of-the-art protocols, achieving a reduction of 74.8% in communication and a 6% to 287% improvement in computational efficiency.

cs.CR